DocumentCode :
3486949
Title :
Mapping onto three classes of parallel machines: a case study using the cyclic reduction algorithm
Author :
Saghi, Gene ; Siegel, Howard Jay ; Gray, Jeffery L.
Author_Institution :
Parallel Process. Lab., Purdue Univ., West Lafayette, IN, USA
fYear :
1993
fDate :
13-16 Apr 1993
Firstpage :
238
Lastpage :
247
Abstract :
Mapping cyclic reduction, a known approach for the parallel solution of tridiagonal systems of equations, onto the MasPar MP-1, nCUBE 2, and PASM parallel machines is discussed. Each of these represents a different mode of parallelism. Issues addressed are SIMD/MIMD trade-offs, the effect on execution time of increasing the number of processors used, the impact of the inter-processor communications network on performance, the importance of predicting algorithm performance as a function of the mapping used, and the advantages of a partitionable system. Analytical results are validated by experimentation on all three machines
Keywords :
cyclic codes; parallel algorithms; parallel machines; performance evaluation; MasPar MP-1; PASM; SIMD/MIMD trade-offs; case study; cyclic reduction algorithm; execution time; inter-processor communications network; mapping; nCUBE 2; parallel machines; parallel solution; partitionable system; performance; tridiagonal systems of equations; Algorithm design and analysis; Communication networks; Computer aided software engineering; Laboratories; Parallel machines; Parallel processing; Partial differential equations; Partitioning algorithms; Prediction algorithms; Switches;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
Parallel Processing Symposium, 1993., Proceedings of Seventh International
Conference_Location :
Newport, CA
Print_ISBN :
0-8186-3442-1
Type :
conf
DOI :
10.1109/IPPS.1993.262888
Filename :
262888
Link To Document :
بازگشت