Non-preemptive time warp scheduling algorithms

1 April 1990

journal article
Published by Association for Computing Machinery (ACM) in ACM SIGOPS Operating Systems Review

Vol. 24 (2) , 7-18
https://doi.org/10.1145/382258.382787

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.

Keywords

This publication has 5 references indexed in Scilit:

Two processor scheduling with limited preemption
Performance Evaluation, 1986
Distributed operating systems
ACM Computing Surveys, 1985
Virtual time
ACM Transactions on Programming Languages and Systems, 1985
Scheduling Multipipeline and Multiprocessor Computers
IEEE Transactions on Computers, 1984
Scheduling of tasks for distributed processors
Published by Association for Computing Machinery (ACM) ,1984