By Topic

A hypercube algorithm for GVT computation and its application in optimistic parallel simulation

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
Das, S.K. ; Dept. of Comput. Sci., North Texas Univ., Denton, TX, USA ; Sarkar, F.

We present an algorithm for computing the global virtual time (GVT) in an optimistic parallel discrete event simulation, on the distributed memory hypercube architecture. Our algorithm uses only 3N messages and runs in O(log N) time where N is the number of logical processors (LP's) representing components of the simulation system. It is based on the construction of a spanning binomial tree in the hypercube. In most simulation systems, there is an LP designated for GVT computation, called the GVT manager. Failure of the physical processor running this LP causes the simulation process to stop, and in such a case reorganization of LPs is necessary so that another logical processor take the roll of the GVT manager. In our algorithm, any LP in the system can elect itself to be the GVT manager and hence such reorganization is not necessary. We show how our algorithm can be used for memory management and hierarchical load balancing in a hypercube machine, and suggest a new technique to handle transient messages

Published in:

Simulation Symposium, 1995., Proceedings of the 28th Annual

Date of Conference:

9-13 Apr 1995