Overlapping window algorithm for computing GVT in Time Warp

Author

Baldwin, Reid ; Chung, Moon Jung ; Chung, Yunmo

Author_Institution

Dept. of Comput. Sci., Michigan State Univ., East Lansing, MI, USA

fYear

1991

fDate

20-24 May 1991

Firstpage

534

Lastpage

541

Abstract

Techniques are proposed for computing a global virtual time (GVT), which is the minimum local virtual time of processes in Time Warp. The algorithm computes a conservative estimate of GVT using an approach which is considerably simpler than previous algorithms for computing GVT. This algorithm does not require a global synchronization of processors. An inherent problem is GVT computation relates to handling messages in transit. Several alternatives are proposed for solving the transient message problem. The algorithm is suitable for distributed shared memory machines such as the BBN Butterfly and message passing machines with a variety of interconnection networks

Keywords

circuit analysis computing; distributed processing; BBN Butterfly; Time Warp; computing GVT; distributed shared memory machines; global virtual time; hybrid partitioning; interconnection networks; message passing machines; minimum local virtual time; transient message problem; window algorithms overlapping; Clocks; Computational modeling; Computer science; Discrete event simulation; Frequency synchronization; Message passing; Moon; Multiprocessor interconnection networks; Processor scheduling; Time warp simulation;

fLanguage

English

Publisher

ieee

Conference_Titel

Distributed Computing Systems, 1991., 11th International Conference on

Conference_Location

Arlington, TX

Print_ISBN

0-8186-2144-3

Type

conf

DOI

10.1109/ICDCS.1991.148722

Filename

148722