| Experiments in automated load balancing |
| Full text |
Pdf
(873 KB)
|
| Source
|
Workshop on Parallel and Distributed Simulation
archive
Proceedings of the tenth workshop on Parallel and distributed simulation
table of contents
Philadelphia, Pennsylvania, United States
Pages: 4 - 11
Year of Publication: 1996
ISBN:0-8186-7539-X
Also published in ...
|
|
Authors
|
|
Linda F. Wilson
|
Institute for Computer Applications, Science and Engineering, NASA Langley Research Center, Hampton, VA
|
|
David M. Nicol
|
Department of Computer Science, The College of William and Mary, P.O. Box 8795, Williamsburg, VA
|
|
| Sponsors |
|
| Publisher |
IEEE Computer Society
Washington, DC, USA
|
| Bibliometrics |
Downloads (6 Weeks): 11, Downloads (12 Months): 23, Citation Count: 9
|
|
|
ABSTRACT
One of the promises of parallelized discrete-event simulation is that it might provide significant speedups over sequential simulation. In reality, high performance cannot be achieved unless the system is fine-tuned to balance computation, communication, and synchronization requirements. In this paper, we discuss our experiments in automated load balancing using the SPEEDES simulation framework. Specifically, we examine three mapping algorithms that use run-time measurements. Using simulation models of queuing networks and the National Airspace System, we investigate (i) the use of run-time data to guide mapping, (ii) the utility of considering communication costs in a mapping algorithm, (iii) the degree to which computational ``hot-spots'' ought to be broken up in the linearization, and (iv) the relative execution costs of the different algorithms. We compare the performance of the three algorithms using results from the Intel Paragon.
REFERENCES
Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.
| |
1
|
|
| |
2
|
R. L. Graham, "Bounds on Multiprocessing Timing Anomalies", SIAM Journal of Apphed Mathematics, Vol. 17, No. 2, pp. 416-419, March 1969.
|
| |
3
|
B. Nandy and W. Loucks, "An Algorithm for Partitioning and Mapping Conservative Parallel Simulation onto Multicomputers", Proceedings of the 6th Workshop on Parallel and Distributed Simulation (PADS '92), pp. 139-146, January 1992.
|
| |
4
|
|
 |
5
|
|
| |
6
|
|
| |
7
|
|
 |
8
|
Rolf Schlagenhaft , Martin Ruhwandl , Christian Sporrer , Herbert Bauer, Dynamic load balancing of a multi-cluster simulator on a network of workstations, Proceedings of the ninth workshop on Parallel and distributed simulation, p.175-180, June 13-16, 1995, Lake Placid, New York, United States
|
 |
9
|
|
| |
10
|
J. Steinman, "SPEEDES: A Multiple-Synchronization Environment for Parallel Discrete-Event Simulation", International Journal in Computer Szmulation, 2(3): 251-286, 1992.
|
 |
11
|
Jeffrey S. Steinman , Craig A. Lee , Linda F. Wilson , David M. Nicol, Global Virtual Time and distributed synchronization, Proceedings of the ninth workshop on Parallel and distributed simulation, p.139-148, June 13-16, 1995, Lake Placid, New York, United States
|
 |
12
|
Frederick Wieland , Eric Blair , Tony Zukas, Parallel Discrete-Event Simulation (PDES): a case study in design, development, and performance using SPEEDES, Proceedings of the ninth workshop on Parallel and distributed simulation, p.103-110, June 13-16, 1995, Lake Placid, New York, United States
|
| |
13
|
|
|