Logo

Vector Models for Data-Parallel Computing

Small book cover: Vector Models for Data-Parallel Computing

Vector Models for Data-Parallel Computing
by

Publisher: The MIT Press
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.

Home page url

Download or read it online for free here:
Download link
(1.3MB, PDF)

Similar books

Book cover: AlgorithmsAlgorithms
by - University of Aberdeen
This course studies computer algorithms, their construction, validation and effectiveness. A number of topics will be covered: a general introduction to the subject, the problem of sorting data sets into order, the theory of formal grammars, etc.
(10158 views)
Book cover: Data Structures and Algorithms: Annotated Reference with ExamplesData Structures and Algorithms: Annotated Reference with Examples
by - DotNetSlackers
The book provides implementations of common and uncommon algorithms in pseudocode which is language independent and provides for easy porting to most programming languages. We assume that the reader is familiar with the object oriented concepts.
(12222 views)
Book cover: Algorithms and ComplexityAlgorithms and Complexity
by - AK Peters, Ltd.
An introductory textbook on the design and analysis of algorithms. Recursive algorithms are illustrated by Quicksort, FFT, and fast matrix multiplications. Algorithms in number theory are discussed with some applications to public key encryption.
(13121 views)
Book cover: Design and Analysis of AlgorithmsDesign and Analysis of Algorithms
by - Duke University
The main topics to be covered in this course are: Design Techniques; Searching; Prioritizing; Graph Algorithms; Topological Algorithms; Geometric Algorithms; NP-completeness. The emphasis will be on algorithm design and on algorithm analysis.
(12653 views)