Vector Models for Data-Parallel Computing
by Guy Blelloch
Publisher: The MIT Press 1990
ISBN/ASIN: 026202313X
ISBN-13: 9780262023139
Number of pages: 268
Description:
Vector Models for Data-Parallel Computing describes a model of parallelism that extends and formalizes the Data-Parallel model on which the Connection Machine and other supercomputers are based. It presents many algorithms based on the model, ranging from graph algorithms to numerical algorithms, and argues that data-parallel models are not only practical and can be applied to a surprisingly wide variety of problems, they are also well suited for very-high-level languages and lead to a concise and clear description of algorithms and their complexity.
Download or read it online for free here:
Download link
(1.3MB, PDF)
Similar books
![Book cover: Greedy Algorithms](images/2669.jpg)
by Witold Bednorz - InTech
Each chapter comprises a separate study on some optimization problem giving both an introductory look into the theory the problem comes from and some new developments invented by authors. Usually some elementary knowledge is assumed.
(15340 views)
![Book cover: Data Structures and Algorithms](images/11597.jpg)
by Catherine Leung - GitBook
This book is a survey of several standard algorithms and data structures. It will also introduce the methodology used to perform a formal analysis of an algorithm so that the reason behind the different implementations can be better understood.
(12300 views)
![Book cover: Data Structures and Algorithm Analysis in C++](images/7307.jpg)
by Clifford A. Shaffer - Dover Publications
A comprehensive treatment focusing on efficient data structures and algorithms, this text explains how to select or design the data structure best suited to specific problems. It uses C++ programming language and is suitable for second-year courses.
(24118 views)
![Book cover: Data Structures and Algorithms](images/3656.jpg)
by John Morris
The text focuses on data structures and algorithms for manipulating them. Data structures for storing information in tables, lists, trees, queues and stacks are covered. Some basic graph and discrete transform algorithms are also discussed.
(15233 views)