By Topic

Cyclic Storage for Fault-Tolerant Distributed Executions

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

3 Author(s)
R. Marcelin-Jimenez ; Departamento de Ingenieria Electrica, UAM-lztapalapa ; S. Rajsbaum ; B. Stevens

Given a set V of active components in charge of a distributed execution, a storage scheme is a sequence B0, B1,..., Bb-1 of subsets of V, where successive global states are recorded. The subsets, also called blocks, have the same size and are scheduled according to some fixed and cyclic calendar of b steps. During the ith step, block Bi is selected. Each component takes a copy of its local state and sends it to one of the components in Bi, in such a way that each component stores (approximately) the same number of local states. Afterward, if a component of Bi crashes, all of its stored data is lost and the computation cannot continue. If there exists a block with no failed components in it, then a recent global state can be retrieved and the computation does not need to start over from the very beginning. The goal is to design storage schemes that tolerate as many crashes as possible, while trying to have each component participating in as few blocks as possible and, at the same time, working with large blocks (so that a component in a block stores a small number of local states). In this paper, several such schemes are described and compared in terms of these measures

Published in:

IEEE Transactions on Parallel and Distributed Systems  (Volume:17 ,  Issue: 9 )