Time Warp simulation on clumps

  • Authors:

  • Girindra D. Sharma;Radharamanan Radhakrishnan;Umesh Kumar V. Rajasekaran;Nael Abu-Ghazaleh;Philip A. Wilsey

  • Affiliations:

  • Dept. of ECECS, University of Cincinnati, Cincinnati, OH;Dept. of ECECS, University of Cincinnati, Cincinnati, OH;Dept. of ECECS, University of Cincinnati, Cincinnati, OH;Dept. of Computer Science, S.U.N.Y, Binghamton, NY;Dept. of ECECS, University of Cincinnati, Cincinnati, OH

  • Venue:
  • PADS '99 Proceedings of the thirteenth workshop on Parallel and distributed simulation
  • Year:
  • 1999

Quantified Score

Hi-index 0.00

Visualization

Abstract

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.