Data Parallel Algorithms

Data parallelism is a model of parallel computing in which the same set of instructions is applied to all the elements in a data set. A sampling of data parallel algorithms is presented. The examples are certainly not exhaustive, but address many issues involved in designing data parallel algorithms. Case studies are used to illustrate some algorithm design techniques; and to highlight some implementation decisions that influence the overall performance of a parallel algorithm. It is shown that the characteristics of a particular parallel machine to be used need to be considered in transforming a given task into a parallel algorithm that executes effectively. DATA PARALLEL ALGORITHMS Howard Jay Siegel, Lee Wang, John John E. So, and Muthucurnaru Maheswaran

[1]  Andrew B. Whinston,et al.  A Model for an Intelligent Operating System for Executing Image Understanding Tasks on a Reconfigurable Parallel Architecture , 1985, J. Parallel Distributed Comput..

[2]  L. Kronsjö,et al.  Advances in parallel algorithms , 1992 .

[3]  Anthony A. Maciejewski,et al.  A Methodology for Exploiting Concurrency among Independent Tasks in Partitionable Parallel Processing Systems , 1993, J. Parallel Distributed Comput..

[4]  W. Daniel Hillis,et al.  The connection machine , 1985 .

[5]  Gene H. Golub,et al.  Scientific computing: an introduction with parallel computing , 1993 .

[6]  Pranay Chaudhuri.  Parallel algorithms , 1992 .

[7]  S. Lakshmivarahan,et al.  Analysis and design of parallel algorithms , 1990 .

[8]  W. Daniel Hillis,et al.  The CM-5 Connection Machine: a scalable supercomputer , 1993, CACM.

[9]  Tom Blank,et al.  The MasPar MP-1 architecture , 1990, Digest of Papers Compcon Spring '90. Thirty-Fifth IEEE Computer Society International Conference on Intellectual Leverage.

[10]  Michael J. Flynn,et al.  Very high-speed computing systems , 1966 .

[11]  Gregory V. Wilson,et al.  A glossary of parallel computing terminology , 1993, IEEE Parallel & Distributed Technology: Systems & Applications.

[12]  Howard Jay Siegel,et al.  Parallel Processing Approaches to Image Correlation , 1982, IEEE Transactions on Computers.

[13]  Kenneth E. Batcher,et al.  Design of a Massively Parallel Processor , 1980, IEEE Transactions on Computers.

[14]  Selim G. Akl,et al.  Design and analysis of parallel algorithms , 1985 .

[15]  Michael Philippsen,et al.  Project Triton: towards improved programmability of parallel machines , 1993, [1993] Proceedings of the Twenty-sixth Hawaii International Conference on System Sciences.

[16]  Howard Jay Siegel,et al.  A parallel approach to hybrid range image segmentation , 1992, Proceedings Sixth International Parallel Processing Symposium.

[17]  Howard Jay Siegel,et al.  Examining the effects of CU/PE overlap and synchronization overhead when using the complete sums approach to image correlation , 1991, Proceedings of the Third IEEE Symposium on Parallel and Distributed Processing.

[18]  Richard M. Brown,et al.  The ILLIAC IV Computer , 1968, IEEE Transactions on Computers.

[19]  T. Blank,et al.  A Grimm collection of MIMD fairy tales , 1992, [Proceedings 1992] The Fourth Symposium on the Frontiers of Massively Parallel Computation.

[20]  Thomas L. Casavant,et al.  Experimental Analysis of a Mixed-Mode Parallel Architecture Using Bitonic Sequence Sorting , 1991, J. Parallel Distributed Comput..

[21]  Cherri M. Pancake,et al.  Software Support for Parallel Computing: Where Are We headed? , 1991 .