Proceedings Thirteenth Workshop on Parallel and Distributed Simulation. PADS 99. (Cat. No.PR00155) (1999)
May 1, 1999 to May 4, 1999
Girindra D. Sharma , University of Cincinnati
Radharamanan Radhakrishnan , University of Cincinnati
Umesh Kumar V. Rajasekaran , University of Cincinnati
Philip A. Wilsey , University of Cincinnati
Nael Abu-Ghazaleh , State University of New York at Binghamton
Traditionally, parallel discrete-event simulators based on the Time Warp synchronization protocol have been implemented using either the shared memory programming model or the distributed memory, message passing programming model. This was because the preferred hardware platform was either a shared memory multiprocessor workstation or a network of uniprocessor workstations. However, with the advent of "clumps" (cluster of shared memory multiprocessors), a change in this dichotomous view becomes necessary. This paper explores the design and implementation issues involved in exploiting this new platform for Time Warp simulations. Specifically, this paper presents two generic strategies for implementing Time Warp simulators on clumps. In addition, we present our experiences in implementing these strategies on an extant distributed memory, message passing Time Warp simulator (WARPED). Preliminary performance results comparing the modified clump-specific simulation kernel to the unmodified distributed memory, message passing simulation kernel are also presented.
U. K. Rajasekaran, R. Radhakrishnan, N. Abu-Ghazaleh, P. A. Wilsey and G. D. Sharma, "Time Warp Simulation on Clumps," Proceedings Thirteenth Workshop on Parallel and Distributed Simulation. PADS 99. (Cat. No.PR00155)(PADS), Atlanta, Georgia, 1999, pp. 174.