Global Virtual Time Approximation for Split Queue Time Warp

Authors:
Helge Hagenauer
Affiliations:
-
Venue:
ParNum '99 Proceedings of the 4th International ACPC Conference Including Special Tracks on Parallel Numerics and Parallel Computing in Image Processing, Video Processing, and Multimedia: Parallel Computation
Year:
1999

Citing 8
Cited 0

Virtual time

ACM Transactions on Programming Languages and Systems (TOPLAS)
Distributed discrete-event simulation

ACM Computing Surveys (CSUR)
Parallel program design: a foundation

Parallel program design: a foundation
Parallel discrete event simulation

Communications of the ACM - Special issue on simulation
A fixed point approach to parallel discrete event simulation

Acta Informatica
Efficient algorithms for distributed snapshots and global virtual time approximation

Journal of Parallel and Distributed Computing - Special issue on parallel and discrete event simulation
Prototyping a parallel discrete event simulation system in Ada

Proceedings of the conference on TRI-Ada '96: disciplined software development with Ada
Distributed simulation, algorithms and performance analysis (load balancing, distributed processing)

Distributed simulation, algorithms and performance analysis (load balancing, distributed processing)

Quantified Score

Hi-index	0.02

Visualization

Abstract

In the field of distributed discrete event simulation we introduced the split queue time warp algorithm, which is a generalization of the well known time warp algorithm. The main feature is allowing lazy message reception and so the rollback frequency may be reduced. This paper describes a method for global virtual time approximation during a simulation run respecting the specific structure of such a system. This will keep the interference with the underlying simulation at a very low degree.