Efficient Parallel Algorithms (Paperback)

Alan Gibbons

ISBN 10: 0521388414 / ISBN 13: 9780521388412

Published by Cambridge University Press, Cambridge, 1989

About this Item

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. This item is printed on demand. Shipping may be from our Sydney, NSW warehouse or from our UK or US warehouse, depending on stock availability.

Seller Inventory # 9780521388412

Bibliographic Details

• Title: Efficient Parallel Algorithms (Paperback)
• Publisher: Cambridge University Press, Cambridge
• Publication Date: 1989
• Language: English
• ISBN 10: 0521388414
• ISBN 13: 9780521388412
• Binding: Paperback
• Condition: new

About this title

Synopsis

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.

Book Description

Regularly-used techniques and a range of algorithms, including some of the more celebrated ones, are presented in an approach concentrating on the essence of algorithmic theory, and determining the inherently parallel nature of certain types of problems.