Advanced Search

Journal Navigation

Journal Home

Subscriptions

Archive

Contact Us

Table of Contents

Sign In to gain access to subscriptions and/or personal tools.
SIMULATION
This Article
Right arrow Full Text (PDF)
Right arrow References
Right arrow Alert me when this article is cited
Right arrow Alert me if a correction is posted
Services
Right arrow Email this article to a friend
Right arrow Similar articles in this journal
Right arrow Similar articles in Web of Science
Right arrow Alert me to new issues of the journal
Right arrow Add to Saved Citations
Right arrow Download to citation manager
Right arrowRequest Permissions
Right arrow Request Reprints
Right arrow Add to My Marked Citations
Citing Articles
Right arrow Citing Articles via Google Scholar
Right arrow Citing Articles via Scopus
Google Scholar
Right arrow Articles by Iskra, K. A.
Right arrow Articles by Sloot, P. M. A.
Right arrow Search for Related Content
Social Bookmarking
Add to CiteULike   Add to Complore   Add to Connotea   Add to Del.icio.us   Add to Digg   Add to Reddit   Add to Technorati   Add to Twitter  
What's this?

Toward Grid-Aware Time Warp

K. A. Iskra

Computing, System Architecture, and Programming Laboratory, Universiteit van Amsterdam, Kruislaan 403, 1098 SJ Amsterdam, the Netherlands, kamil{at}science.uva.nl

G. D. van Albada

Computing, System Architecture, and Programming Laboratory, Universiteit van Amsterdam, Kruislaan 403, 1098 SJ Amsterdam, the Netherlands

P. M. A. Sloot

Computing, System Architecture, and Programming Laboratory, Universiteit van Amsterdam, Kruislaan 403, 1098 SJ Amsterdam, the Netherlands

The authors study the adaptation of an optimistic Time Warp kernel to cross-cluster computing on the Grid. Wide-area communication, the primary source of overhead, is offloaded onto dedicated routing processes. This allows the simulation processes to run at full speed and thus significantly decreases the performance gap caused by the wide-area distribution. Further improvements are obtained by employing message aggregation on the wide-area links and using a distributed global virtual time algorithm. The authors achieve many of their objectives for a cellular automaton simulation with lazy cancellation and moderate communication. High communication rates, especially with aggressive cancellation, present a challenge. This is confirmed by the experiments with synthetic loads. Even then, a satisfactory speedup can be achieved, provided that the computational grain of events is large enough.

Key Words: Optimistic parallel discrete event simulation • grid computing • message aggregation • GVT algorithms

SIMULATION, Vol. 81, No. 4, 293-306 (2005)
DOI: 10.1177/0037549705055015
Add to CiteULike CiteULike   Add to Complore Complore   Add to Connotea Connotea   Add to Del.icio.us Del.icio.us   Add to Digg Digg   Add to Reddit Reddit   Add to Technorati Technorati   Add to Twitter Twitter    What's this?