Non-preemptive time warp scheduling algorithms

Authors:
Christopher Burdorf;Jed Marti
Affiliations:
The RAND Corporation, Santa Monica, California;The RAND Corporation, Santa Monica, California
Venue:
ACM SIGOPS Operating Systems Review
Year:
1990

Citing 4
Cited 4

Virtual time

ACM Transactions on Programming Languages and Systems (TOPLAS)
Distributed operating systems

ACM Computing Surveys (CSUR) - The MIT Press scientific computation series
Two processor scheduling with limited preemption

Performance Evaluation
Scheduling of tasks for distributed processors

ISCA '84 Proceedings of the 11th annual international symposium on Computer architecture

Object-oriented concurrent reflective languages can be implemented efficiently

OOPSLA '92 conference proceedings on Object-oriented programming systems, languages, and applications
Effects of the checkpoint interval on time and space in time warp

ACM Transactions on Modeling and Computer Simulation (TOMACS)
Parallel simulation using the time warp operating system (tutorial session)

WSC' 90 Proceedings of the 22nd conference on Winter simulation
TWLinuX: Operating System Support for Optimistic Parallel Discrete Event Simulation

HiPC '01 Proceedings of the 8th International Conference on High Performance Computing

Quantified Score

Hi-index	0.00

Visualization

Abstract

This paper presents results of experiments we conducted on a number of scheduling algorithms used in a multi-processing Time Warp system. Our results show that system performance can be improved by using indirect indicators of Time Warp progress without going to the expense of user specified scheduling or relying on dependency graphs. Our best algorithm is based on a composite measure of simulation advance rate, flow control, and the appearance of specific message types.