Title :
Scheduling of unstructured communication on the Intel iPSC/860
Author :
Wang, Jhy-Chun ; Ranka, Sanjay
Abstract :
We present several algorithms for decomposing all-to-many personalized communication into a set of disjoint partial permutations. These partial permutations avoid node contention as well as link contention. We discuss the theoretical complexity of these algorithms and study their effectiveness both from the view of static scheduling and from runtime scheduling. Experimental results for our algorithms are presented on the iPSC/860
Keywords :
communication complexity; message passing; parallel algorithms; parallel machines; processor scheduling; Intel iPSC/860; algorithms; all-to-many personalized communication; disjoint partial permutations; link contention; node contention; runtime scheduling; scheduling; static scheduling; theoretical complexity; unstructured communication; Contracts; Information science; Matrix decomposition; Packaging; Parallel processing; Performance gain; Processor scheduling; Runtime; Scheduling algorithm; US Government;
Conference_Titel :
Supercomputing '94., Proceedings
Conference_Location :
Washington, DC
Print_ISBN :
0-8186-6605-6
DOI :
10.1109/SUPERC.1994.344299
