Vector models for data-parallel computing

作者: Guy E. Blelloch

DOI:

关键词:

摘要: "Vector Models for Data-Parallel Computing "describes a model of parallelism that extends and formalizes the on which Connection Machine other supercomputers are based. It presents many algorithms based model, ranging from graph to numerical algorithms, argues data-parallel models not only practical can be applied surprisingly wide variety problems, they also well suited very-high-level languages lead concise clear description their complexity. Many author's ideas have been incorporated into instruction set currently running Machine.The book includes definition parallel vector machine; an extensive uses scan (also called parallel-prefix) operations; introduction segmented data structures trees, graphs, grids; computational-geometry, graph, sorting algorithms; techniques compiling nested parallelism; compiler Paralation Lisp; details implementation operations.Guy E. Blelloch is Assistant Professor Computer Science Principal Investigator with Super Compiler Advanced Language project at Carnegie Mellon University.Contents: Introduction. Parallel Vector Models. The Scan Primitives. Computational-Geometry Algorithms. Graph Numerical Languages Compilers. Correction-Oriented Languages. Flattening Nested Parallelism. A Lisp. Paralation-Lisp Code. Model. Data Structures. Implementing Operations. Conclusions. Glossary.

参考文章(99)
Guy Blelloch, Charles R. Rosenberg, Network learning on the connection machine international joint conference on artificial intelligence. pp. 323- 326 ,(1987)
Quentin F. Stout, Sorting, Merging, Selecting, and Filtering on Tree and Pyramid Machines. international conference on parallel processing. pp. 214- 221 ,(1983)
Stephen M. Omohundro, Efficient Algorithms with Neural Network Behavior. Complex Systems. ,vol. 1, ,(1987)
Boris D. Lubachevsky, Albert G. Greenberg, Simple, Efficient Asynchronous Parallel Prefix Algorithms. international conference on parallel processing. pp. 66- 69 ,(1987)
Baruch Awerbuch, Tripurari Singh, New Connectivity and MSF Algorithms for Ultracomputer and PRAM. international conference on parallel processing. pp. 175- 179 ,(1983)
A. V. Goldberg, EFFICIENT GRAPH ALGORITHMS FOR SEQUENTIAL AND PARALLEL COMPUTERS Massachusetts Institute of Technology. ,(1987)
Robert Endre Tarjan, Data Structures and Network Algorithms ,(1983)
Hillel Gazit, Gary L. Miller, Shang-Hua Teng, Optimal Tree Contraction in the EREW Model Springer, Boston, MA. pp. 139- 156 ,(1988) , 10.1007/978-1-4684-5511-3_9