Abstract
The initiation rule of a load balancing algorithm determines when to begin a new load balancing operation. Therefore, it is critical to achieve the desired system performance. This paper proposes a generalized procedure for deriving initiation mechanisms or rules based on different objectives for the load balancing algorithm. A new metric, the initiation efficiency, is defined in order to evaluate the initiation performance and to compare the different alternatives.
Chapter PDF
Similar content being viewed by others
Keywords
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
References
Buyya, R.: High Performance Cluster Computing: Architecture and Systems, vol. I. Prentice-Hall, Englewood Cliffs (1999)
Pfister, G.: search of clusters: The Ongoing Battle in Lowly Parallel Computing. Prentice-Hall, Englewood Cliffs (1998)
Watts, J., Rieffel, M., Taylor, S.: Dynamic management of heterogeneous resources. High Performance Computing: Grand Challenges in Computer Simulation, 151–156 (1998)
Xu, C., Lau, F.C.M.: Load Balancing in Parallel Computers: Theory and Practice. Kluwer Academic Publishers, Dordrecht (1997)
Rajagolapan, A., Hariri, S.: An agent based dynamic load balancing system. In: Proceedings of the International Workshop on Autonomous Decentralized Systems, pp. 164–171 (2000)
Arora, M., Das, S.K., Biswas, R.: A de-dentralized scheduling and load balancing algorithm for heterogeneous grid environments. In: Proceedings of the International Conference on Parallel Processing Workshops (2002)
Lavi, R., Barak, A.: The home model and competitive algorithms for load balancing in a computing cluster. In: Proceedings of the 21st International Conference on Distributed Computing Systems, pp. 127–134 (2001)
Ni, L.M., Xu, C., Gendreau, T.B.: A distributed drafting algorithm for load balancing. IEEE Transactions on Software Engineering 11(10), 1153–1161 (1985)
Chowkwanyun, R., Hwang, K.: Multicomputer load balancing for LISP execution. In: Parallel Processing for Supercomputers and Artificial Intelligence, pp. 325–366. McGraw-Hill, New York (1989)
Melhem, R.G., Pruhs, K.R., Znati, T.F.: Using spanning-trees for balancing dynamic load on a multiprocessor. In: Proceedings of the Sixth Distributed Memory Computing Conference, pp. 233–237 (1991)
Beltrán, M., Guzmán, A., Bosque, J.L.: Dynamic tasks assignment for real heterogeneous clusters. In: Wyrzykowski, R., Dongarra, J., Paprzycki, M., Waśniewski, J. (eds.) PPAM 2004. LNCS, vol. 3019, pp. 888–895. Springer, Heidelberg (2004)
Mitzenmacher, M., Prabhakar, B., Shah, D.: Load balancing with memory. In: Proceedings of the 43rd Annual IEEE Symposium on Foundations of Computer Science (2002)
Beltrán, M., Bosque, J.L.: Estimating a workstation CPU assignment with the DYPAP monitor. In: Proceedings of the 3rd IEEE International Symposium on Parallel and Distributed Computing (2004)
Pastor, L., Bosque, J.L.: Efficiency and scalability models for heterogeneous clusters. In: Proceedings of the 3rd IEEE International Conference on Cluster Computing, pp. 427–434. IEEE Computer Society Press, Los Alamitos (2001)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2005 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Beltrán, M., Bosque, J.L., Guzmán, A. (2005). Initiating Load Balancing Operations. In: Cunha, J.C., Medeiros, P.D. (eds) Euro-Par 2005 Parallel Processing. Euro-Par 2005. Lecture Notes in Computer Science, vol 3648. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11549468_34
Download citation
DOI: https://doi.org/10.1007/11549468_34
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-28700-1
Online ISBN: 978-3-540-31925-2
eBook Packages: Computer ScienceComputer Science (R0)