By Topic

Event scheduling in window based parallel simulation schemes

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
$33 $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

2 Author(s)
R. Ayani ; Dept. of Telecommun. & Comput. Syst., R. Inst. of Technol., Stockholm, Sweden ; H. Rajaei

The authors study the impact of load balancing on the performance of a window-based parallel simulation scheme. They show the impact of four scheduling policies: static, dynamic, majority, and longest window. For simple simulation problems where there are a few events and the events need fairly short computation, i.e., small event granularity, the first three policies perform fairly close to each other. However, for large simulation problems where millions of events exist and the event granularity is large, majority scheduling is a better choice. For instance, if each event requires 18.3 ms processing time, majority scheduling performs 38.5% better than dynamic scheduling and 43.6% better than static scheduling

Published in:

Parallel and Distributed Processing, 1992. Proceedings of the Fourth IEEE Symposium on

Date of Conference:

1-4 Dec 1992