Abstract
In this paper, we present the design and implementation of an effective and scalable dynamic load balancing system for Non-Uniform Memory Access (NUMA) multiprocessors where load balancing is a key issue to achieve adequate efficiency. The proposed load balancing algorithm extends the well-known gradient model to enhance its applicability in a wide range of multiprocessor systems and to improve the overall system performance. A comparative performance study between the two models based on the preliminary simulation results is also reported in the paper.
This work has been partially supported by the German Science Foundation (DFG)
Preview
Unable to display preview. Download preview PDF.
References
I. Ahmad and A. Ghafoor, Semi-distributed load balancing for massively parallel multicomputer systems, IEEE trans. Software Eng. 17(10) (Oct. 1991) 987–1004.
K.A.M. Ali and M. Wang, An investigation of an OR-parallel model for Horn clause programs, SICS research report, Sept, 1986.
M.J. Berger adn S. Bokhari, A partitioning strategy for non-uniform problems on multiprocessors, IEEE Trans. Computer, C-36, 5 (1987), 570–580.
T. Casavant and J.G. Kuhl, A taxonomy of scheduling in general-purpose distributing systems, IEEE Trans. Software Eng., 14(2) (Feb. 1988) 141–154.
R. Jain, The art of computer systems performance analysis, John Wiley and Sons, 1991.
F. Lin and R. Keller, The gradient model load balancing method, IEEE Trans. Software Eng., 13(1), (January 1987), 32–38.
R. Lulin, B. Monien and F. Ramme, Load balancing in large networks: a comparative study, 3rd IEEE Symp. on Parallel and Distributed Processing, Dallas 1991, 329–336.
E. Mohr, D. A. Kranz and R. H. Halstead, Lazy Task Creation, A technique for Increasing the Granularity of Parallel Programs, IEEE Transactions on Parallel and distributed systems, 1990.
F.J. Muniz and E.J. Zaluska, Parallel Load-balancing: An extension to the gradient model, Parallel Computing, No. 21, Jan, 1995.
N. G. Shivaratri, P. Krueger, and M. Singhal, Load distributing for locally distributed systems, IEEE Computer, December, 1992.
S. Nishimura and T.L. Kunii, A decentralized dynamic scheduling scheme for transputer networks, in T.L. Kunii and D, Nay, eds., Proc. 3rd Transputer/OCCAM int. conf., May, 1990, Tokyo, Japan.
R.D. Rettberg, W.R. Crowther, R.P. Carvey and R.S. Tomlinson, The monarch parallel processor hardware design, IEEE computer, April, 1990, 18–30.
V. Sarkar and J. Hennesey, Compile-time partitioning and scheduling of parallel programs, Proc. SIGPLAN'86 symp. compiler construction, 21(7), 1986, 17–26.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1995 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Liu, F., Peikenkamp, T., Damm, W. (1995). An extended gradient model for NUMA multiprocessor systems. In: Kanchanasut, K., Lévy, JJ. (eds) Algorithms, Concurrency and Knowledge. ACSC 1995. Lecture Notes in Computer Science, vol 1023. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-60688-2_46
Download citation
DOI: https://doi.org/10.1007/3-540-60688-2_46
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-60688-8
Online ISBN: 978-3-540-49262-7
eBook Packages: Springer Book Archive