Aspects of mapping tasks onto parallel processing systems
Howard Jay Siegel, John H. Armstrong, Daniel W. Watson, Wayne G. Nation, M.D. Allemang · 2002
A discussion of how three algorithms can map onto parallel processing systems is presented. Issues addressed are single instruction multiple data (SIMD)/multiple instruction multiple data (MIMD) tradeoffs, mixed-mode parallelism, the impact of partitioning the system for subtask parallelism, the effect on execution time of increasing the number of processors used, and the advantages of a flexible interprocessor communications network.>