Matrix operations on a multicomputer system with switchable main memory modules and dynamic control
IEEE Transactions on Computers
Bounds on the speedup and efficiency of partial synchronization in parallel processing systems
Journal of the ACM (JACM)
Generating a deterministic task migration path for multiprocessor scheduling
SAC '94 Proceedings of the 1994 ACM symposium on Applied computing
Graph Theoretical Analysis and Design of Multistage Interconnection Networks
IEEE Transactions on Computers
A Pipelined Pseudoparallel System Architecture for Real-Time Dynamic Scene Analysis
IEEE Transactions on Computers
Applications of SIMD computers in signal processing
AFIPS '82 Proceedings of the June 7-10, 1982, national computer conference
On detecting parallelism in software
Journal of Systems and Software
Formulation of parallel image processing tasks
Pattern Recognition Letters
| Hi-index | 0.01 |
As multiple processor systems become more widely accepted the importance of parallel programming increases. In this paper, approaches to the design and analysis of parallel algorithms are investigated. Through several examples, the importance of interprocessor communication in parallel processing is demonstrated. Various techniques that are applicable in the design and analysis of parallel algorithms are examined with emphasis on those techniques that incorporate communication aspects. The paper discusses several models of synchronous and asynchronous parallel computation and their use in analyzing algorithms. Relatively primitive methodologies for designing parallel algorithms are discussed and the need for more general and practical methodologies is indicated.