Scheduled System Maintenance:
On May 6th, single article purchases and IEEE account management will be unavailable from 8:00 AM - 12:00 PM ET (12:00 - 16:00 UTC). We apologize for the inconvenience.
By Topic

Event scheduling based on combined rollback cost in time warp parallel simulation

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

1 Author(s)
Ramadan, H.M.S. ; Inf. Syst. Dept., King Saud Univ., Riyadh

An event scheduling policy for Time Warp parallel simulations based on combined rollback cost considerations is proposed. This policy takes into consideration a multitude of factors which affect the selection of the next event to be processed by any processor. These factors are: the event timestamp, the expected event execution time (granularity), the expected number of children events to be produced as a result of processing the candidate parent event and the particular event cancellation scheme used. Our scheduling policy is suitable for simulation models with event types having significantly different event granularity values and different numbers of children events. On any processor, it selects for scheduling from a set of candidate events the one having the smallest sum of granularity value and the expected cancellation cost for children events to be sent to other logical processes. This helps delay the execution of those candidate events which have high combined rollback costs as measured by the sum of granularity values and the expected cancellation cost of children events. Experimental results for a synthetic workload are reported. These results show that our scheduling policy can achieve a smaller simulation execution time and a fewer number of rollbacks than both LTF and grain-sensitive scheduling.

Published in:

Performance Evaluation of Computer and Telecommunication Systems, 2008. SPECTS 2008. International Symposium on

Date of Conference:

16-18 June 2008