Experiments in Automated Load Balancing

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 ne-tuned to balance computation, communication, and synchronization requirements. As a result, parallel discrete-event simulation needs tools to automate the tuning process with little or no modication to the user's simulation code. In thispaper, we discuss our experimentsin automatedload balancing using theSPEEDES simulation framework. Specically, 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 diere...

• Type: Conference
• Year: 1996
• Where: PADS
• Authors: Linda F. Wilson, David M. Nicol
• Keywords: Discrete-event Simulation, Modelling And Simulation, PADS 1996, Parallelized Discrete-event Simulation, Simulation