Proceedings 9th Workshop on Parallel and Distributed Simulation (ACM/IEEE) (1995)
Lake Placid, New York
June 14, 1995 to June 16, 1995
B.L. Noble , Comput. & Commun. Res. Center, Washington Univ., St. Louis, MO, USA
R.D. Chamberlain , Comput. & Commun. Res. Center, Washington Univ., St. Louis, MO, USA
The partitioning of systems for parallel simulation is a complex task, requiring consideration of both computational load requirements and communications activity. Typically, this information is not accurately known prior to execution. This paper investigates the use of historical information for the prediction of future requirements, both for computation and communications. In addition, for optimistic simulation algorithms, we present a novel technique (which we call predictive optimism) whereby binary prediction schemes can be used to increase the accuracy of optimistic assumptions, thereby decreasing rollbacks and potentially improving overall simulator performance.
discrete event simulation; processor scheduling; resource allocation; message passing; parallel programming; resource requirements; predictive optimism; parallel simulation; computational load requirements; communications activity; historical information; future requirements; optimistic simulation algorithms; binary prediction schemes; rollbacks; overall simulator performance
R. Chamberlain and B. Noble, "Predicting the future: resource requirements and predictive optimism," Proceedings 9th Workshop on Parallel and Distributed Simulation (ACM/IEEE)(PADS), Lake Placid, New York, 1995, pp. 157.