1990
DOI: 10.1145/382258.382787
|View full text |Cite
|
Sign up to set email alerts
|

Non-preemptive time warp scheduling algorithms

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.

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1

Citation Types

0
2
0

Year Published

1992
1992
2020
2020

Publication Types

Select...
5
1

Relationship

0
6

Authors

Journals

citations
Cited by 13 publications
(2 citation statements)
references
References 5 publications
0
2
0
Order By: Relevance
“…Runtime tuning and self optimization is a technique which has been thoroughly studied in the context of speculative simulation, focusing on diverse subsystems of traditional Time Warp runtime environments [17]. For example, it has been used to fine tune the checkpoint interval [1,13,30], to select the best checkpointing strategy [27], for event scheduling [4,24,29,31], to decide upon the technique to implement a rollback (e.g. state saving vs. reverse computation [7]), to find a proper binding between LPs and processing elements performance-wise [23,33], or to control overall memory consumption [10].…”
Section: Related Workmentioning
confidence: 99%
“…Runtime tuning and self optimization is a technique which has been thoroughly studied in the context of speculative simulation, focusing on diverse subsystems of traditional Time Warp runtime environments [17]. For example, it has been used to fine tune the checkpoint interval [1,13,30], to select the best checkpointing strategy [27], for event scheduling [4,24,29,31], to decide upon the technique to implement a rollback (e.g. state saving vs. reverse computation [7]), to find a proper binding between LPs and processing elements performance-wise [23,33], or to control overall memory consumption [10].…”
Section: Related Workmentioning
confidence: 99%
“…In our context, it can be improved upon to reduce overall PDES program execution time. It has been suggested that a better policy for scheduling simulation processes would use simulation parameters, such as LVT (logical process Local Virtual Time), or the timestamp of the next event message [8].…”
Section: Schedulingmentioning
confidence: 99%