From Simulation to Experiment: A Case Study on Multiprocessor Task Scheduling

Sascha Hunold, Henri Casanova, Frederic Suter
2011 2011 IEEE International Symposium on Parallel and Distributed Processing Workshops and Phd Forum  
Simulation is a popular approach for empirically evaluating the performance of algorithms and applications in the parallel computing domain. Most published works present results without quantifying simulation error. In this work we investigate accuracy issues when simulating the execution of parallel applications. This is a broad question, and we focus on a relevant case study: the evaluation of scheduling algorithms for executing mixed-parallel applications on clusters. Most such scheduling
more » ... such scheduling algorithms have been evaluated in simulation only. We compare simulations to real-world experiments in a view to identify which features of a simulator are most critical for simulation accuracy. Our first finding is that simple yet popular analytical simulation models lead to simulation results that cannot be used for soundly comparing scheduling algorithms. We then show that, by contrast, simulation models instantiated based on brute-force measurements of the target execution environment lead to usable results. Finally, we develop empirical simulation models that provide a reasonable compromise between the two previous approaches.
doi:10.1109/ipdps.2011.201 dblp:conf/ipps/HunoldCS11 fatcat:74qef77k4rbbpp452xazdob4he