Skip to main content
SpringerLink
Log in

Block‐cyclic redistribution over heterogeneous networks

  • Published:
Cluster Computing Aims and scope Submit manuscript

Abstract

Clusters of workstations and networked parallel computing systems are emerging as promising computational platforms for HPC applications. The processors in such systems are typically interconnected by a collection of heterogeneous networks such as Ethernet, ATM, and FDDI, among others. In this paper, we develop techniques to perform block-cyclic redistribution over P processors interconnected by such a collection of heterogeneous networks. We represent the communication scheduling problem using a timing diagram formalism. Here, each interprocessor communication event is represented by a rectangle whose height denotes the time to perform this event over the heterogeneous network. The communication scheduling problem is then one of appropriately positioning the rectangles so as to minimize the completion time of all the communication events. For the important case where the block size changes by a factor of K, we develop a heuristic algorithm whose completion time is at most twice the optimal. The running time of the heuristic is O(PK 2). Our heuristic algorithm is adaptive to variations in network performance, and derives schedules at run-time, based on current information about the available network bandwidth. Our experimental results show that our schedules always have communication times that are very close to optimal.

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. F. Desprez, J. Dongarra, A. Petitet, C. Randriamaro and Y. Robert, Scheduling block-cyclic array redistribution, IEEE Trans. Parallel Distributed Systems 9(2) (February 1998) 192-205.

    Article  Google Scholar 

  2. D. Ferrari, A. Gupta and G. Ventre, Distributed advance reservation of real-time connections, in: Proc. 5th Int. Workshop on Network and Operating Systems Support for Digital Audio and Video (April 1995).

  3. T. Gonzalez and S. Sahni, Open shop scheduling to minimize finish time, Journal of the ACM 23(4) (October 1976) 665-679.

    Article  MATH  MathSciNet  Google Scholar 

  4. S.D. Kaushik, C.H. Huang, J. Ramanujam and P. Sadayappan, Multiphase array redistribution: Modeling and evaluation, in: Proc. Int. Parallel Processing Symposium (April 1995) pp. 441-445.

  5. J. Kim and D.J. Lilja, Exploiting multiple heterogeneous networks to reduce communication costs in parallel programs, in: Proc. Heterogeneous Computing Workshop (April 1997) pp. 83-95.

  6. J. Kim and D.J. Lilja, Utilizing heterogeneous networks in distributed parallel computing systems, in: Proc. Sixth IEEE Int. Symp. High Performance Distributed Computing (1997).

  7. H. Korab and M.D. Brown, eds., Virtual Environments and Distributed Computing at SC '95: GII Testbed and HPC Challenge Applications on the I-WAY, ACM/IEEE Supercomputing '95 (1995).

  8. Y.W. Lim, P.B. Bhat and V.K. Prasanna, Efficient algorithms for block-cyclic redistribution of arrays, Algorithmica (to appear).

  9. Y.W. Lim, P.B. Bhat and V.K. Prasanna, Efficient data remapping algorithms for embedded signal processing applications, in: Proc. 10th Int. Conference on High Performance Computers (June 1996).

  10. N. Park, V.K. Prasanna and C.S. Raghavendra, Efficient algorithms for block-cyclic array redistribution between processor sets, in: Proc. Supercomputing '98.

  11. S. Ramaswamy and P. Banerjee, Automatic generation of efficient array redistribution routines for distributed memory multicomputers, in: Proc. 5th Symposium on Frontiers of Massively Parallel Computation (February 1995) pp. 342-349.

  12. D.B. Shmoys, C. Stein and J. Wein, Improved approximation algorithms for shop scheduling problems, SIAM J. Computing 23(3) (June 1994) 617-632.

    Article  MATH  MathSciNet  Google Scholar 

  13. L. Smarr and C.E. Catlett, Metacomputing, Comm. of the ACM 35(6) (June 1992) 45-52.

    Article  Google Scholar 

  14. M. Tan, M.D. Theys, H.J. Siegel, N.B. Beck and M. Jurczyk, A mathematical model, heuristic, and simulation study for a basic data staging problem in a heterogeneous networking environment, in: Proc. Heterogeneous Computing Workshop (March 1998) pp. 115-129.

  15. R. Thakur, A. Choudhary and J. Ramanujam, Efficient algorithms for array redistribution, IEEE Trans. Parallel Distributed Systems 7(6) (June 1996) 587-594.

    Article  Google Scholar 

  16. D.W. Walker and S.W. Otto, Redistribution of block-cyclic data distributions using MPI, Technical Report ORNL/TM-12999, Oak Ridge National Labs (June 1995).

  17. L.C. Wolf, L. Delgrossi, R. Steinmetz, S. Schaller and H. Wittig, Issues of reserving resources in advance, in: Proc. 5th Int. Workshop on Network and Operating Systems Support for Digital Audio and Video (April 1995).

Download references

Author information

Authors and Affiliations

  1. Department of EE‐Systems, University of Southern California, Los Angeles, CA, 90089‐2562, USA

    Prashanth B. Bhat & Viktor K. Prasanna

  2. The Aerospace Corporation, Los Angeles, CA, 90009, USA

    C.S. Raghavendra

Authors
  1. Prashanth B. Bhat
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Viktor K. Prasanna
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. C.S. Raghavendra
    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

Bhat, P.B., Prasanna, V.K. & Raghavendra, C. Block‐cyclic redistribution over heterogeneous networks. Cluster Computing 3, 25–34 (2000). https://doi.org/10.1023/A:1019059632297

Download citation

  • Issue Date:

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

Keywords

Search

Navigation