Skip to main content
SpringerLink
Log in

A library of static and dynamic communication algorithms for parallel computation

  • Published:
Telecommunication Systems Aims and scope Submit manuscript

Abstract

Communication efficiency is one of the keys to the broad success of parallel computation, as one can see by looking at the successes of parallel computation, which are currently limited to applications that have small communication requirements, or applications that use a small number of processors. In order to use fine grain parallel computation for a broader range of applications, efficient algorithms to execute the underlying interprocessor communications have to be developed. In this paper we survey several generic static and dynamic communication problems that are important for parallel computation, and present some general methodologies for addressing these problems. Our objective is to obtain a collection of communication algorithms to execute certain prototype communication tasks that arise often in applications. These algorithms can be called as communication primitives by the programmer or the compiler of a multiprocessor computer, in the same way that subroutines implementing standard functions are called from a library of functions in a conventional computer. We discuss both algorithms to execute static (deterministic) primitive communication tasks, as well as schemes that are appropriate for dynamic (stochastic) environments. Our emphasis is on algorithms that apply to many similar problems and can be used in various network topologies.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. M.M. Azevedo, N. Bagherzadeh and S. Latifi, Broadcasting algorithms for the star-connected cycles interconnection network, Journal of Parallel and Distributed Computing 25(2) (1995) 209–222.

    Article  Google Scholar 

  2. D.P. Bertsekas, C. Ozveren, G.D. Stamoulis, P. Tseng and J.N. Tsitsiklis, Optimal communication algorithms for hypercubes, Journal of Parallel and Distributed Computing 11 (1991) 263–275.

    Article  Google Scholar 

  3. D.P. Bertsekas and J.N. Tsitsiklis, Parallel and Distributed Computation: Numerical Methods (Prentice-Hall, Englewood Cliffs, NJ, 1989).

    Google Scholar 

  4. K. Coolsaet and V. Fack, Optimal data exchange algorithms on star graphs, Computers and Mathematics with Applications 27(33) (1994) 21–25.

    Article  Google Scholar 

  5. W.J. Dally, Network and processor architecture for message-driven computers, in: VLSI and Parallel Computation, eds. R. Suaya and G. Birtwistle (Morgan Kaufmann, San Mateo, CA, 1990) pp. 140–222.

    Google Scholar 

  6. A. Edelman, Optimal matrix transposition and bit reversal on hypercubes: All-to-all personalized communication, Journal of Parallel and Distributed Computing 11 (1991) 328–331.

    Article  Google Scholar 

  7. P. Fragopoulou and S.G. Akl, Optimal communication algorithms on star graphs using spanning tree constructions, Journal of Parallel and Distributed Computing 24 (1995) 55–71.

    Article  Google Scholar 

  8. P. Fragopoulou, S.G. Akl and H. Meijer, Optimal communication primitives on the generalized hypercube network, Journal of Parallel and Distributed Computing 32 (1996) 173–187.

    Article  Google Scholar 

  9. P. Fraigniaud, Complexity analysis of broadcasting in hypercubes with restricted communication capabilities, Journal of Parallel and Distributed Computing 16 (1992) 15–26.

    Article  Google Scholar 

  10. M.D. Grammatikakis, D.F. Hsu, M. Kraetzl and J.F. Sibeyn, Packet routing in fixed-connection networks: A survey, to appear in Journal of Parallel and Distributed Computing.

  11. S.M. Hedetniemi, S.T. Hedetniemi and A.L. Liestman, A survey of gossiping and broadcasting in communication networks, Networks 18 (1988) 319–349.

    Google Scholar 

  12. S.L. Johnsson, Communication in network architectures, in: VLSI and Parallel Computation, eds. R. Suaya and G. Birtwistle (Morgan Kaufmann, San Mateo, CA, 1990) pp. 223–389.

    Google Scholar 

  13. S.L. Johnsson and C.T. Ho, Optimum broadcasting and personalized communication in hypercubes, IEEE Transactions on Computers 38 (1989) 1249–1268.

    Article  Google Scholar 

  14. Y. Lan, A.-H. Esfahanian and L. Ni, Multicast in hypercube multiprocessors, Journal of Parallel and Distributed Computing 8 (1990) 30–41.

    Article  Google Scholar 

  15. O.A. McBryan and E.F. Van de Velde, Hypercube algorithms and their implementations, SIAM Journal on Scientific and Statical Computing 8 (1987) 227–287.

    Article  Google Scholar 

  16. J. Misic and Z. Jovanovic, Communication aspects of the star graph interconnection network, IEEE Transactions on Parallel and Distributed Systems (1994) 678–687.

  17. E. Modiano and A. Ephremides, Efficient algorithms for performing packet broadcasts in a mesh network, IEEE/ACM Transactions on Networking 4(4) (1996) 639–648.

    Article  Google Scholar 

  18. S. Ranka and S. Sahni, Hypercube Algorithms with Applications to Image Processing and Pattern Recognition (Springer, New York, 1990).

    Google Scholar 

  19. Y. Saad and M.H. Schultz, Topological properties of hypercubes, IEEE Transactions on Computers 37 (1988) 867–872.

    Article  Google Scholar 

  20. Y. Saad and M.H. Schultz, Data communication in hypercubes, Journal of Parallel and Distributed Computing 6 (1989) 115–135.

    Article  Google Scholar 

  21. Y. Saad and M.H. Schultz, Data communication in parallel architectures, Parallel Computing 11 (1989) 131–150.

    Article  Google Scholar 

  22. G.D. Stamoulis and J.N. Tsitsiklis, Efficient routing schemes for multiple broadcasts in hypercubes, IEEE Transactions on Parallel and Distributed Systems 4 (1993) 725–739.

    Article  Google Scholar 

  23. G.D. Stamoulis and J.N. Tsitsiklis, An efficient algorithm for multiple simultaneous broadcasts in the hypercube, Information Processing Letters (July 1993) 219–224.

  24. Q.F. Stout, Intensive hypercube communication, Journal of Parallel and Distributed Computing 10 (1990) 167–181.

    Article  Google Scholar 

  25. E.A. Varvarigos, Optimal routing algorithms for folded-cubes, in: Proc. of IEEE Internat. Phoenix Conf. on Computers and Communications (1995) pp. 143–151.

  26. E.A. Varvarigos, Optimal communication algorithms for Manhattan Street networks, Discrete Applied Mathematics 83(1F–3) (March 1998) 303–326.

    Article  Google Scholar 

  27. E.A. Varvarigos and A. Banerjee, Routing schemes for multiple random broadcasts in arbitrary network topologies, IEEE Transactions on Parallel and Distributed Systems (August 1996) 886–895.

  28. E.A. Varvarigos and D.P. Bertsekas, Communication algorithms for isotropic tasks in hypercubes and wraparound meshes, Parallel Computing 18 (1992) 1233–1257.

    Article  Google Scholar 

  29. E.A. Varvarigos and D.P. Bertsekas, Multinode broadcast in hypercubes and rings with randomly distributed lengths of packets, IEEE Transactions on Parallel and Distributed Systems 4(2) (1993) 144–154.

    Article  Google Scholar 

  30. E.A. Varvarigos and D.P. Bertsekas, Partial multinode broadcast and partial exchange in d-dimensional wraparound meshes, Journal of Parallel and Distributed Computing 23 (1994) 177–189.

    Article  Google Scholar 

  31. E.A. Varvarigos and D.P. Bertsekas, Transposition of banded matrices in hypercubes: A nearly isotropic task, Parallel Computing 21 (1995) 243–264.

    Article  Google Scholar 

  32. E.A. Varvarigos and D.P. Bertsekas, Dynamic broadcasting in parallel computing, IEEE Transactions on Parallel and Distributed Systems 6(2) (1995) 120–131.

    Article  Google Scholar 

  33. C.H. Yeh, E.A. Varvarigos and H. Lee, The priority broadcast scheme for dynamic broadcast in hypercubes and related networks, in: Proc. of 7th Symp. on the Frontiers of Massively Parallel Computation, Annapolis (February 1999) pp. 294–301.

Download references

Author information

Authors and Affiliations

  1. Department of Electrical and Computer Engineering, University of California, Santa Barbara, CA, 93106, USA

    Emmanouel A. Varvarigos

Authors
  1. Emmanouel A. Varvarigos
    View author publications

    You can also search for this author in PubMed Google Scholar

Rights and permissions

Reprints and permissions

About this article

Cite this article

Varvarigos, E.A. A library of static and dynamic communication algorithms for parallel computation. Telecommunication Systems 13, 3–20 (2000). https://doi.org/10.1023/A:1019167317239

Download citation

  • Issue Date:

  • DOI: https://doi.org/10.1023/A:1019167317239

Keywords

Search

Navigation