Advertisement

Exchange of messages of different sizes

  • A. Goldman
  • D. Trystram
  • J. Peters
Regular Talks
Part of the Lecture Notes in Computer Science book series (LNCS, volume 1457)

Abstract

In this paper, we study the exchange of messages among a set of processors linked through an interconnection network. We focus on general, non-uniform versions of all-to-all (or complete exchange problems in asynchronous systems with a linear cost model and messages of arbitrary sizes. We extend previous complexity results to show that the general asynchronous problems are NP-complete. We present several approximation algorithms and determine which heuristics are best suited to several parallel systems. We conclude with experimental results that show that our algorithms outperform the native all-to-all exchange algorithm on an IBM SP2 when the number of processors is odd.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    P. Barcaccia, M. Bonuccelli, and M. Ianni. Minimun length scheduling of precedence constrained messages in distributed systems. In EUROPAR'96, volume LNCS 1123, pages 594–601, 1996.Google Scholar
  2. 2.
    M. Barnett, L. Shuler, R. van de Geijn, S. Gupta, D.G. Payne, and J. Watts. Interprocessor collective communication library. In Proceedings of the Scalable High Performance Computing Conference, pages 357–364, 1994.Google Scholar
  3. 3.
    S.H. Bokhari. Multiphase complete exchange on a circuit switched hypercube. In Proceedings of the 1991 International Conference on Parallel Procesing, volume I, pages 525–529, 1991.Google Scholar
  4. 4.
    G. Bongiovanni, D. Coppersmith, and C. Wong. An optimum time slot assignment algorithm for an ss/tdma system with variable number of transponders. IEEE Transactions on Communications, 29:721–726, 1981.Google Scholar
  5. 5.
    M.A. Bonuccelli. A polynomial time optimal algorithm for satellite-switched timedivision multiple access satellite communications with general switching modes. SIAM J. Disc. Math., 4:28–35, February 1991.Google Scholar
  6. 6.
    J. Briat, I. Ginzburg, and M. Pasin. Athapascan-Ob reference manual. Technical Report, Apache, LMC — IMAG, Grenoble, France, 1997.Google Scholar
  7. 7.
    H. Choi and S.L. Hakimi. Data transfer in networks. Algorithmica, 3:223–245, 1988.Google Scholar
  8. 8.
    E.G. Coffman, M.R. Garey, D.S. Johnson, and A.S. Lapaugh. Scheduling file transfers. SIAM J. Comput., 14(3):744–780, August 1985.Google Scholar
  9. 9.
    P. Fraigniaud and J.G. Peters. Structured communication in cut-through routed torus networks. Technical Report TR 97-05, School of Computing Science, Simon Fraser Univ, 1997.Google Scholar
  10. 10.
    A. Goldman, J. Peters, and D. Trystram. Exchange of messages of different sizes. manuscript, www-apache.imag.fr/apache/.Google Scholar
  11. 11.
    T. Gonzales and S. Sahni. Open shop scheduling to minimize finish time. Journal of the Association for Computing Machinery, 4(23):665–679, October 1976.Google Scholar
  12. 12.
    T.F. Gonzales. Multimessage multicasting with forwarding. Technical Report, UCSD Department of Computer Science, TRCS-96-16.Google Scholar
  13. 13.
    T.F. Gonzales. Multi-message multicasting. In IRREGULAR'96, volume LNCS 1117, pages 217–228, 1996.Google Scholar
  14. 14.
    Y.S. Hwang, R. Das, J. Saltz, M. Hodoscek, and B. Brooks. Parallelizing molecular dynamics programs for distributed memory machines. IEEE Computational Science & Engineering, 2(2):18–29, 1995.Google Scholar
  15. 15.
    J.G. Peters and C.C. Spencer. Global communication on circuit-switched toroidal meshes. Technical Report TR 97-02, School of Computing Science, Simon Fraser Univ., 1997. to appear in PPL.Google Scholar
  16. 16.
    S. Ranka, R.V Shankar, and K.A. Alsabti. Many-to-many personalized communication with bounded traffic. In The Fifth Symposium on the Frontiers of Massively Parallel Computation, pages 20–27, February 1995.Google Scholar
  17. 17.
    G.N Rouskas and V. Sivaraman. On the design of optimal tdm schedules for broadcast wdm networks with arbitrary transceiver tuning latencies. In INFOCOM'96, pages 1217–1224, 1996.Google Scholar
  18. 18.
    R. Tahkur and A. Choudhary. All-to-all communication on meshes with wormhole routing. In IPPS'94, pages 561–565. 1994.Google Scholar
  19. 19.
    L.G. Valiant. A bridging model for parallel computation. Communications of the ACM, 33(8):103–111, August 1990.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1998

Authors and Affiliations

  • A. Goldman
    • 1
  • D. Trystram
    • 1
  • J. Peters
    • 2
  1. 1.LMC-IMAGGrenobleFrance
  2. 2.School of Computing ScienceSimon Fraser UniversityBurnabyCanada

Personalised recommendations