Timestamp representations for virtual sequences

Authors:
John G. Cleary;J. A. David McWha;Murray Pearson
Affiliations:
Computer Science Department, University of Waikato, Private Bag 3105, Hamilton, New Zealand;Computer Science Department, University of Waikato, Private Bag 3105, Hamilton, New Zealand;Computer Science Department, University of Waikato, Private Bag 3105, Hamilton, New Zealand
Venue:
Proceedings of the eleventh workshop on Parallel and distributed simulation
Year:
1997

Citing 13
Cited 2

Virtual time

ACM Transactions on Programming Languages and Systems (TOPLAS)
Text compression

Text compression
User interface design

User interface design
Parallel discrete event simulation

Communications of the ACM - Special issue on simulation
Time warp on a shared memory multiprocessor

Transactions of the Society for Computer Simulation International
Virtual time II: storage management in conservative and optimistic systems

PODC '90 Proceedings of the ninth annual ACM symposium on Principles of distributed computing
Techniques for debugging parallel programs with flowback analysis

ACM Transactions on Programming Languages and Systems (TOPLAS)
Undoing actions in collaborative work

CSCW '92 Proceedings of the 1992 ACM conference on Computer-supported cooperative work
Computer architecture (2nd ed.): a quantitative approach

Computer architecture (2nd ed.): a quantitative approach
The Time Warp Mechanism for Database Concurrency Control

Proceedings of the Second International Conference on Data Engineering
Using optimistic execution techniques as a parallelisation tool for general purpose computing

HPCN Europe '95 Proceedings of the International Conference and Exhibition on High-Performance Computing and Networking
The architecture of an optimistic CPU: the WarpEngine

HICSS '95 Proceedings of the 28th Hawaii International Conference on System Sciences
Time-stamp generation for optimistic parallel computing

SS '95 Proceedings of the 28th Annual Simulation Symposium

Safe timestamps and large-scale modeling

PADS '00 Proceedings of the fourteenth workshop on Parallel and distributed simulation
Tasking with out-of-order spawn in TLS chip multiprocessors: microarchitecture and compilation

Proceedings of the 19th annual international conference on Supercomputing

Quantified Score

Hi-index	0.00

Visualization

Abstract

The problem of executing sequential programs in parallel using the optimistic algorithm Time Warp is considered. This is done by first mapping the sequential execution to a control tree and then assigning timestamps to each node in the tree.For such timestamps to be effective in either hardware or software they must be finite, this implies that they must be periodically rescaled to allow old timestamps to be reused. A number of timestamp representations are described and compared on the basis of: their complexity; the frequency and cost of rescaling; and the cost of performing basic operations, including comparison and creation of new timestamps.