Non-preemptive time warp scheduling algorithms

Subscribe (Full Service)


	Search: The ACM Digital Library The Guide

	Feedback

Non-preemptive time warp scheduling algorithms

Full text

Pdf (552 KB)

Source

ACM SIGOPS Operating Systems Review archive
Volume 24 , Issue 2 (April 1990) table of contents

Pages: 7 - 18

Year of Publication: 1990

ISSN:0163-5980

Authors

Christopher Burdorf	The RAND Corporation, Santa Monica, California
Jed Marti	The RAND Corporation, Santa Monica, California

Publisher

ACM New York, NY, USA

Bibliometrics

Downloads (6 Weeks): 3, Downloads (12 Months): 21, Citation Count: 3

Additional Information:

abstract references cited by index terms collaborative colleagues

Tools and Actions:	Review this Article Save this Article to a Binder Display Formats: BibTeX EndNote ACM Ref

DOI Bookmark:	Use this link to bookmark this Article: http://doi.acm.org/10.1145/382258.382787 What is a DOI?

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.

REFERENCES

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

	1	1. Thomas L. Casavant and Jon G. Kuhl. "A Formal Model of Distributed Decision-Making and its Application to Distributed Load Balancing". In Proceedings of the 6th International Conference on Distributed Computing Systems, 1986.
	2	2. H. Deitel. Introduction to Operating Systems. Addison-Wesley, Reading, Mass., 1984.
	3	3. J. P. Fitch. "A Loosely Coupled Parallel LISP Execution System". In The Design and Application of Parallel Digital Processors, 1988.
	4	4. Barbara Gates and Jed Marti. "An Empirical Study of Time Warp Request Mechanisms". In Distributed Simulation, number 3, San Diego, California, 1988. Simulation Councils, Inc.
	5	David R. Jefferson, Virtual time, ACM Transactions on Programming Languages and Systems (TOPLAS), v.7 n.3, p.404-425, July 1985 [doi>10.1145/3916.3988]
	6	E L Lloyd, Two processor scheduling with limited preemption, Performance Evaluation, v.6 n.4, p.307-312, Dec. 1986 [doi>10.1016/0166-5316(86)90038-6]
	7	7. S. Lo and V. D. Gilgor. "Properties of Multiprocessor Scheduling Algorithms". In Proceedings of the 1987 International Conference on Parallel Processing, 1987.
	8	Ravi Mehrotra , Sarosh N. Talukdar, Scheduling of tasks for distributed processors, Proceedings of the 11th annual international symposium on Computer architecture, p.263-270, January 1984
	9	9. Sartaj Sahni. "Scheduling Multipipeline and Multiprocessor Computers". IEEE Transactions on Computers, 33(7): 637-645, 1984.
	10	Andrew S. Tanenbaum , Robbert Van Renesse, Distributed operating systems, ACM Computing Surveys (CSUR), v.17 n.4, p.419-470, Dec. 1985 [doi>10.1145/6041.6074]

CITED BY 3

	Peter L. Reiher, Parallel simulation using the time warp operating system (tutorial session), Proceedings of the 22nd conference on Winter simulation, p.38-45, December 09-12, 1990, New Orleans, Louisiana, United States
	Hidehiko Masuhara , Satoshi Matsuoka , Takuo Watanabe , Akinori Yonezawa, Object-oriented concurrent reflective languages can be implemented efficiently, ACM SIGPLAN Notices, v.27 n.10, p.127-144, Oct. 1992
	Bruno R. Preiss , Wayne M. Loucks , Ian D. Macintyre, Effects of the checkpoint interval on time and space in time warp, ACM Transactions on Modeling and Computer Simulation (TOMACS), v.4 n.3, p.223-253, July 1994

INDEX TERMS

Keywords:
distributed processing, scheduling, time warp

Collaborative Colleagues:

Christopher Burdorf: colleagues

Jed Marti: colleagues

Adobe Acrobat

QuickTime

Windows Media Player

Real Player