DocumentCode
1886458
Title
Complete exchange in 2D meshes
Author
Sundar, N.S. ; Jayasimha, D.N. ; Panda, D.K. ; Sadayappan, P.
Author_Institution
Dept. of Comput. & Inf. Sci., Ohio State Univ., Columbus, OH, USA
fYear
1994
fDate
23-25 May 1994
Firstpage
406
Lastpage
413
Abstract
We propose a new algorithm called Cyclic Exchange for all-to-all personalized exchange in a 2D mesh. This algorithm fully interleaves communication in both dimensions of a mesh. We have compared by simulation the performance of this algorithm with that of the Quadrant Exchange method previously proposed by S.H. Bokhari and H. Berryman (1992). The results show that the new algorithm is faster for the range of machine size, problem size and startup/transmission ratio
Keywords
parallel algorithms; parallel architectures; parallel machines; 2D meshes; Cyclic Exchange; Quadrant Exchange method; all-to-all personalized exchange; complete exchange; machine size; problem size; startup/transmission ratio; Algorithm design and analysis; Art; Circuits; Delay; Information science; Performance analysis; Routing;
fLanguage
English
Publisher
ieee
Conference_Titel
Scalable High-Performance Computing Conference, 1994., Proceedings of the
Conference_Location
Knoxville, TN
Print_ISBN
0-8186-5680-8
Type
conf
DOI
10.1109/SHPCC.1994.296672
Filename
296672
Link To Document