Abstract
We focus on mapping iterative algorithms onto heterogeneous clusters. The application data is partitioned over the processors, which are arranged along a virtual ring. At each iteration, independent calculations are carried out in parallel, and some communications take place between consecutive processors in the ring. The question is to determine how to slice the application data into chunks, and assign these chunks to the processors, so that the total execution time is minimized. A major difficulty is to embed a processor ring into a network that typically is not fully connected, so that some communication links have to be shared by several processor pairs. We establish a complexity result assessing the difficulty of this problem, and we design a practical heuristic that provides efficient mapping, routing, and data distribution schemes.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Bertsekas, D., Gallager, R.: Data Networks. Prentice Hall, Englewood Cliffs (1987)
Brent, R.P.: The LINPACK Benchmark on the AP1000: Preliminary Report. In: CAP Workshop 1991. Australian National University (1991), Website, http://www.netlib.org/linpack/
Calvert, K.L., Doar, M.B., Zegura, E.W.: Modeling internet topology. IEEE Communications Magazine 35(6), 160–163 (1997)
Downey, A.B.: Using pathchar to estimate internet link characteristics. In: Measurement and Modeling of Computer Systems, pp. 222–223 (1999)
Katabi, D., Handley, M., Rohrs, C.: Congestion control for high bandwidth-delay product networks. In: ACM SIGCOMM 2002, pp. 89–102. ACM Press, New York (2002)
Legrand, A., Renard, H., Robert, Y., Vivien, F.: Load-balancing iterative computations in heterogeneous clusters with shared communication links. Research Report RR-2003-23, LIP, ENS Lyon, France (April 2003)
Taylor, A.G., Hindmarsh, A.C.: User documentation for KINSOL. Technical Report UCRL-ID-131185, Lawrence Livermore National Laboratory (July 1998)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2004 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Legrand, A., Renard, H., Robert, Y., Vivien, F. (2004). Load-Balancing Iterative Computations on Heterogeneous Clusters with Shared Communication Links. In: Wyrzykowski, R., Dongarra, J., Paprzycki, M., Waśniewski, J. (eds) Parallel Processing and Applied Mathematics. PPAM 2003. Lecture Notes in Computer Science, vol 3019. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-24669-5_120
Download citation
DOI: https://doi.org/10.1007/978-3-540-24669-5_120
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-21946-0
Online ISBN: 978-3-540-24669-5
eBook Packages: Springer Book Archive