ScienceDirect® Home Skip Main Navigation Links
You have guest access to ScienceDirect. Find out more.
 
Home
Browse
My Settings
Alerts
Help
 Quick Search
 Search tips (Opens new window)
    Clear all fields    
Journal of Parallel and Distributed Computing
Volume 65, Issue 1, January 2005, Pages 65-73
 
Font Size: Decrease Font Size  Increase Font Size
 Abstract - selected
Article
Purchase PDF (213 K)

  E-mail Article   
  Add to my Quick Links   
Bookmark and share in 2collab (opens in new window)
Request permission to reuse this article
  Cited By in Scopus (0)
 
 
 
Related Articles in ScienceDirect
View More Related Articles
 
View Record in Scopus
 
doi:10.1016/j.jpdc.2004.09.016    How to Cite or Link Using DOI (Opens New Window)
Copyright © 2004 Elsevier Inc. All rights reserved.

An overhead reducing technique for Time Warp

Moon Jung Chunga, Corresponding Author Contact Information, E-mail The Corresponding Author and Jinsheng Xub, E-mail The Corresponding Author

aDepartment of Computer Science and Engineering, Michigan State University, Engineering Building, East Lansing, MI 48824-1027, USA bDepartment of Computer Science, North Carolina A&T State University, USA

Received 28 October 2002; 
revised 2 August 2004. 
Available online 8 December 2004.

Purchase the full-text article



References and further reading may be available for this article. To view references and further reading you must purchase this article.

Abstract

In this paper, we introduce a technique to reduce the number of state savings and the event queue size of Time Warp. By reducing the state saving and the sizes of event queues, we can decrease the overhead and the maximum memory requirement in Time Warp. We exploit the look-ahead technique to get a lower bound time stamp of the next event and to determine if an event is safe to be executed. No State saving is carried out when the event execution is safe. This lower bound can be used to discard saved states even though the time stamps are greater than the global virtual time (GVT). We prove that the proposed technique is correct under both aggressive and lazy cancellation schemes. This technique can be implemented with minimal additional overhead. Benchmark results on logic simulation show that the mechanism can reduce the number of state savings and memory size requirements significantly.

Keywords: Parallel discrete event simulation; Time Warp; Global virtual time; State saving


 
Home
Browse
My Settings
Alerts
Help
Elsevier.com (Opens new window)
About ScienceDirect  |  Contact Us  |  Information for Advertisers  |  Terms & Conditions  |  Privacy Policy
Copyright © 2008 Elsevier B.V. All rights reserved. ScienceDirect® is a registered trademark of Elsevier B.V.