A Dynamic Load Balancing Algorithm for Conservative Parallel Simulations

	This Article
	Subscribers, please Login Purchase article: $19 PDF IEEE Xplore Subscribers RSS feed
	Share
	Email this Article to a friend
	Bibliographic References
	ASCII Text BibTex RefWorks Procite/RefMan/Endnote
	Add to:
	Digg Furl Spurl Blink Simpy Google Del.icio.us Y!MyWeb
	Search
	Similar Articles Articles by A. Boukerche Articles by S. Das

Fifth IEEE International Workshop on Modeling, Analysis, and Simulation of Computer and Telecommunications Systems (MASCOTS'97)

Haifa, ISRAEL

January 12-January 15

ISBN: 0-8186-7758-9

	ASCII Text	x
	A. Boukerche, S. Das, "A Dynamic Load Balancing Algorithm for Conservative Parallel Simulations," Modeling, Analysis, and Simulation of Computer Systems, International Symposium on, pp. 32, Fifth IEEE International Workshop on Modeling, Analysis, and Simulation of Computer and Telecommunications Systems (MASCOTS'97), 1997.

	BibTex	x
	@article{ 10.1109/MASCOT.1997.567576, author = {A. Boukerche and S. Das}, title = {A Dynamic Load Balancing Algorithm for Conservative Parallel Simulations}, journal ={Modeling, Analysis, and Simulation of Computer Systems, International Symposium on}, volume = {0}, year = {1997}, isbn = {0-8186-7758-9}, pages = {32}, doi = {http://doi.ieeecomputersociety.org/10.1109/MASCOT.1997.567576}, publisher = {IEEE Computer Society}, address = {Los Alamitos, CA, USA}, }

	RefWorks Procite/RefMan/Endnote	x
	TY - CONF JO - Modeling, Analysis, and Simulation of Computer Systems, International Symposium on TI - A Dynamic Load Balancing Algorithm for Conservative Parallel Simulations SN - 0-8186-7758-9 SP EP A1 - A. Boukerche, A1 - S. Das, PY - 1997 KW - resource allocation KW - dynamic load balancing algorithm KW - conservative parallel simulation KW - distributed system efficiency KW - multicomputer KW - synchronization protocol KW - Chandy-Misra null-messages KW - workload parameters KW - process migration mechanism KW - CPU-queue length KW - performance KW - first-come KW - first-served queueing network models KW - Intel Paragon A4 VL - 0 JA - Modeling, Analysis, and Simulation of Computer Systems, International Symposium on ER -

A. Boukerche, Dept. of Comput. Sci., North Texas Univ., Denton, TX, USA.

S. Das, Dept. of Comput. Sci., North Texas Univ., Denton, TX, USA.

DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/MASCOT.1997.567576

Load balancing is an important component in improving the efficiency of distributed systems because it distributes an even workload over all the processors. This paper considers the problem of load-balancing a conservative parallel simulation for execution on a multicomputer. The synchronization protocol makes use of Chandy-Misra (1979) null-messages. An earlier study conducted by Boukerche and Tropper (1994) showed that static load balancing for conservative parallel simulation is effective when the workload can be sufficiently well characterized beforehand. In this paper, we present a dynamic load balancing algorithm which assumes no compile-time knowledge about the workload parameters. It is based upon a process migration mechanism and the notion of CPU-queue length, which indicates the workload at each processor. We discuss the algorithm and its implementation, and report on the performance results of a simulation of FCFS (first-come, first-served) queueing network models on an Intel Paragon A4.

Index Terms:

resource allocation, dynamic load balancing algorithm, conservative parallel simulation, distributed system efficiency, multicomputer, synchronization protocol, Chandy-Misra null-messages, workload parameters, process migration mechanism, CPU-queue length, performance, first-come, first-served queueing network models, Intel Paragon A4

Citation:

A. Boukerche, S. Das, "A Dynamic Load Balancing Algorithm for Conservative Parallel Simulations," mascots, pp.32, Fifth IEEE International Workshop on Modeling, Analysis, and Simulation of Computer and Telecommunications Systems (MASCOTS'97), 1997

Peer Review Notice | Give Us Feedback

Usage of this product signifies your acceptance of the Terms of Use.