Issue No. 04 - October (1990 vol. 1)
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/71.80175
<p>The basic concept of pipelined data-parallel algorithms is introduced by contrasting the algorithms with other styles of computation and by a simple example (a pipeline image distance transformation algorithm). Pipelined data-parallel algorithms are a class of algorithms which use pipelined operations and data level partitioning to achieve parallelism. Applications which involve data parallelism and recurrence relations are good candidates for this kind of algorithm. The computations are ideal for distributed-memory multicomputers. By controlling the granularity through data partitioning and overlapping the operations through pipelining, it is possible to achieve a balanced computation on multicomputers. An analytic model is presented for modeling pipelined data-parallel computation on multicomputers. The model uses timed Petri nets to describe data pipelining operations. As a case study, the model is applied to a pipelined matrix multiplication algorithm. Predicted results match closely with the measured performance on a 64-node NCUBE hypercube multicomputer.</p>
Index Termspipelined data-parallel algorithms; pipelined operations; data level partitioning; data parallelism; Petri nets; parallel algorithms
W. Chou, C. King and L. Ni, "Pipelined Data Parallel Algorithms-I: Concept and Modeling," in IEEE Transactions on Parallel & Distributed Systems, vol. 1, no. , pp. 470-485, 1990.