By Topic

Scheduling message processing for reducing rollback propagation

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

2 Author(s)
Wang, Y.-M. ; Coordinated Sci. Lab., Illinois Univ., Urbana, IL, USA ; Fuchs, W.K.

The authors show that the probability of rollback propagation in a message-passing system can often be greatly reduced by reordering the processing of messages. Also, rollback propagation was measured for several parallel programs. A scheduling algorithm for message processing and its implementation for reducing rollback propagation are described. The algorithm incorporates a user-transparent prioritized scheme based on the run-time communication and checkpointing history. Communication trace-driven simulation for several parallel programs written in the Chare Kernel language demonstrated that the probability of rollback propagation can be reduced at the cost of slight additional performance degradation.<>

Published in:

Fault-Tolerant Computing, 1992. FTCS-22. Digest of Papers., Twenty-Second International Symposium on

Date of Conference:

8-10 July 1992