By Topic

Systematic comparisons of RDT communication-induced checkpointing protocols

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)
Jichiang Tsai ; Dept. of Electr. Eng., Nat. Chung Hsing Univ., Taichung, Taiwan

Rollback-dependency trackability (RDT) is a property stating that all rollback dependencies between local checkpoints are online trackable by using a transitive dependency vector. Since the RDT property was introduced, many communication-induced checkpointing protocols satisfying such a property have been proposed in the literature. Most protocols can be classified as three families, PCM family, EPSCM family and PMM family, according to their underlying RDT characterizations. Up to now, several theoretical analyses on comparing the performance of RDT protocols were addressed, but simulation studies on this topic are rare and not comprehensive. We present a simulation study for comparing RDT protocols systematically. The simulation is carried out in different computational environments. We will not only verify the results from existing theoretical analyses, but also explore the impact of optimizations on protocols. Our results can provide guidelines for understanding the efficiency of RDT protocols.

Published in:

Dependable Computing, 2004. Proceedings. 10th IEEE Pacific Rim International Symposium on

Date of Conference:

3-5 March 2004