- We will send in 10–14 business days.
/images/books/3635753/9780521388412.jpg)
- Author: Alan Gibbons
- Publisher: Cambridge University Press
- Year: 1989
- Pages: 268
- ISBN-10: 0521388414
- ISBN-13: 9780521388412
- Format: 19.2 x 23.5 x 1.6 cm, minkšti viršeliai
- Language: English
- SAVE -10% with code: EXTRA
Reviews
Description
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.
EXTRA 10 % discount with code: EXTRA
The promotion ends in 22d.20:42:15
The discount code is valid when purchasing from 10 €. Discounts do not stack.
- Author: Alan Gibbons
- Publisher: Cambridge University Press
- Year: 1989
- Pages: 268
- ISBN-10: 0521388414
- ISBN-13: 9780521388412
- Format: 19.2 x 23.5 x 1.6 cm, minkšti viršeliai
- Language: English English
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.
Reviews