IEEE Transactions on Software Engineering · 1981 · 80 citations · 45 references
ComputingComputer EngineeringComputer ScienceAlgorithmsParallel AlgorithmsParallel ComputingCommunication OverheadParallel Algorithm DesignParallel ArchitecturesParallel ComputationParallel Computer ArchitectureParallel Programming ModelsAsynchronous Parallel AlgorithmsConcurrent Algorithm DesignParallel Algorithm AnalysisParallel ProcessingParallel ProgrammingProcessor SystemsSynchronization In Parallel ComputationSynchronous Parallel Algorithms
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.
45
Sorting networks and their applications
Kenneth E. Batcher · 1968 · 2.4K citations
Branch-and-Bound Methods: A Survey
Eugene L. Lawler, Derek Wood · Operations Research · 1966 · 2K citations
Parallel Processing with the Perfect Shuffle
Harold S. Stone · IEEE Transactions on Computers · 1971 · 1.3K citations