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: Essentials of MetaheuristicsEssentials of Metaheuristics
by
This is an open set of lecture notes on metaheuristics algorithms, intended for undergraduate students, practitioners, programmers, and other non-experts. It was developed as a series of lecture notes for an undergraduate course.
(11517 views)
Book cover: Algorithms and Data StructuresAlgorithms and Data Structures
by - Prentice Hall
The book treats practically important algorithms and data structures. It starts with a chapter on data structure, then it treats sorting algorithms, concentrates on several examples of recursion, and deals with dynamic data structures.
(21360 views)
Book cover: LEDA: A Platform for Combinatorial and Geometric ComputingLEDA: A Platform for Combinatorial and Geometric Computing
by - Cambridge University Press
The book treats the architecture, the implementation, and the use of the LEDA system. LEDA is a library of efficient data types and algorithms and a platform for combinatorial and geometric computing, written in C++ and freely available worldwide.
(9838 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.
(19789 views)