Static and Runtime Scheduling of Unstructured Communication 1

@inproceedings{Ranka1993StaticAR,
  title={Static and Runtime Scheduling of Unstructured Communication 1},
  author={Sanjay Ranka and Jhy-Chun Wang},
  year={1993}
}
With the advent of new routing methods, the distance to which a message is sent is becoming relatively less and less important. Thus assuming no link contention, permutation seems to be an eecient collective communication primitive. All-to-many communication is required for solving a large class of irregular and loosely synchronous problems on distributed memory MIMD machines. In this paper we present several algorithms for decomposing all-to-many personalized communication into a set of… CONTINUE READING

From This Paper

Topics from this paper.
4 Citations
17 References
Similar Papers

References

Publications referenced by this paper.
Showing 1-10 of 17 references

Benchmarking the CM-5 multicomputer

  • Zeki Bozkus, Sanjay Ranka, Geoorey C Fox
  • Proceedings of the Frontiers of Massively…
  • 1992

Intel Corporation, Beaverton, Oregon. iPSC/860 System Calls Reference Manual

  • Intel Corporation, Beaverton, Oregon. iPSC/860…
  • 1992

Intel Corporation, Beaverton, Oregon. iPSC/860 System User's Guide

  • Intel Corporation, Beaverton, Oregon. iPSC/860…
  • 1992

Complete exchange on the iPSC/860

  • H Shahid, Bokhari
  • Complete exchange on the iPSC/860
  • 1991

Distributed memory compiler methods for irregular problems -data copy reuse and runtime partitioning

  • R Das, R Ponnusamy, J Saltz, D Mavriplis
  • Compilers and Runtime Software for Scalable…
  • 1991

Similar Papers

Loading similar papers…