Unstructured communication, Partial permutations, Node contention, Link contention, Static scheduling, Runtime scheduling
Computer Sciences | Systems and Communications
In this paper 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.
Wang, Jhy-Chun and Ranka, Sanjay, "Scheduling of Unstructured Communication on the Intel iPSC/860" (1994). L.C. Smith College of Engineering and Computer Science - Former Departments, Centers, Institutes and Projects. Paper 48.