Efficient Parallel Algorithms (Paperback)

Alan Gibbons

ISBN 10: 0521388414 / ISBN 13: 9780521388412

Editore: Cambridge University Press, Cambridge, 1989

Riguardo questo articolo

Paperback. This largely self-contained text is an introduction to the field of efficient parallel algorithms and to the techniques for efficient parallelism, that presumes no special knowledge of parallel computers or particular mathematics. The book emphasizes designing algorithms within the timeless and abstracted context of a high-level programming language rather than within highly specific computer architectures. This is an approach that concentrates on the essence of algorithmic theory, determining and taking advantage of the inherently parallel nature of certain types of problems. The authors present regularly-used techniques and a range of algorithms including some of the more celebrated ones. Nonspecialists considering entering the field of parallel algorithms, as well as advanced undergraduate or postgraduate students of computer science and mathematics will find this book helpful. An introduction to the field of efficient parallel algorithms and to the techniques for efficient parallelization. It is self-contained and presumes no special knowledge of parallel computers or particular mathematics. Shipping may be from our UK warehouse or from our Australian or US warehouses, depending on stock availability.

Codice articolo 9780521388412

Dati bibliografici

• Titolo: Efficient Parallel Algorithms (Paperback)
• Editore: Cambridge University Press, Cambridge
• Data di pubblicazione: 1989
• Lingua: Inglese
• ISBN 10: 0521388414
• ISBN 13: 9780521388412
• Rilegatura: Paperback
• Condizione: new

Descrizione articolo

Riassunto

This is an introduction to the field of efficient parallel algorithms and to the techniques for efficient parallelisation. It is self-contained and presumes no special knowledge of parallel computers or particular mathematics. The book emphasises designing algorithms within the timeless and abstracted context of a high-level programming language rather than within highly specific computer architectures. This is an approach which concentrates on the essence of algorithmic theory, determining and taking advantage of the inherently parallel nature of certain types of problem. The authors present regularly-used techniques and a range of algorithms which includes some of the more celebrated and well-known. Efficient Parallel Algorithms is targeted at non-specialists who are considering entering the field of parallel algorithms. It will be particularly useful for courses aimed at advanced undergraduate or new postgraduate students of computer science and mathematics.

Recensione

"...a coherent introduction for all those who wish to enter this new field of research....a valuable contribution to the expository literature and will certainly become a favoured introduction to the field of parallel algorithms." Mathematical Reviews

"Highly recommended." Choice

"...a successful introduction to the area of parallel algorithms and to methods for parallelisation." N. I. Yanev, Mathematical Reviews