Scheduling of unstructured communication on the Intel iPSC/860

Authors:
Jhy Chun Wang;Sanjay Ranka
Affiliations:
Syracuse University, Syracuse, NY;Syracuse University, Syracuse, NY
Venue:
Proceedings of the 1994 ACM/IEEE conference on Supercomputing
Year:
1994

Citing 6
Cited 2

Deadlock-Free Message Routing in Multiprocessor Interconnection Networks

IEEE Transactions on Computers
Principles of runtime support for parallel processors

ICS '88 Proceedings of the 2nd international conference on Supercomputing
Solving problems on concurrent processors: vol. 2

Solving problems on concurrent processors: vol. 2
Hypercube algorithms: with applications to image processing and pattern recognition

Hypercube algorithms: with applications to image processing and pattern recognition
Load balancing and communication support for irregular problems

Load balancing and communication support for irregular problems
A Survey of Wormhole Routing Techniques in Direct Networks

Computer

Software Techniques for Improving MPP Bulk-Transfer Performance

IPPS '96 Proceedings of the 10th International Parallel Processing Symposium
A two-stage hardware scheduler combining greedy and optimal scheduling

Journal of Parallel and Distributed Computing

Quantified Score

Hi-index	0.00

Visualization

Abstract

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.