**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

**The Art of Computer Programming, Volume 4**

by

**Donald E. Knuth**-

**Addison-Wesley Professional**

This work on the analysis of algorithms has long been recognized as the definitive description of classical computer science, arguably the most influential work ever written on computer programming. Volume 4 covers Combinatorial Algorithms.

(

**11819**views)

**Efficient Algorithms for Sorting and Synchronization**

by

**Andrew Tridgell**-

**samba.org**

This thesis presents efficient algorithms for parallel sorting and remote data update. The sorting algorithms approach the problem by concentrating first on efficient but incorrect algorithms followed by a cleanup phase that completes the sort.

(

**8650**views)

**Algorithms**

by

**Ian Craw, John Pulham**-

**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.

(

**9818**views)

**Algorithms and Data Structures for External Memory**

by

**Jeffrey Scott Vitter**-

**Now Publishers**

The book describes several useful paradigms for the design and implementation of efficient EM algorithms and data structures. The problem domains considered include sorting, permuting, FFT, scientific computing, computational geometry, graphs, etc.

(

**6538**views)