Por favor, use este identificador para citar o enlazar este ítem: http://inaoe.repositorioinstitucional.mx/jspui/handle/1009/2400
A Scalable Communication-Induced Checkpointing Algorithm for Distributed Systems
Alberto Calixto Simón
SAUL EDUARDO POMARES HERNANDEZ
JOSE ROBERTO PEREZ CRUZ
María del Pilar Gómez Gil
Acceso Abierto
Atribución-NoComercial-SinDerivadas
Communication-induced checkpointing (CIC) has two main advantages: first, it allows processes in a distributed computation to take asynchronous checkpoints, and secondly, it avoids the domino effect. To achieve these, CIC algorithms piggyback information on the application messages and take forced local checkpoints when they recognize potentially dangerous patterns. The main disadvantages of CIC algorithms are the amount of overhead per message and the induced storage overhead. In this paper we present a communication-induced checkpointing algorithm called Scalable Fully-Informed (S-FI) that attacks the problem of message overhead. For this, our algorithm modifies the Fully-Informed algorithm by integrating it with the immediate dependency principle. The S-FI algorithm was simulated and the result shows that the algorithm is scalable since the message overhead presents an under-linear growth as the number of processes and/or the message density increase.
IEICE Transactions on Information and Systems
2013
Artículo
Inglés
Estudiantes
Investigadores
Público en general
Calixto, A., et al., (2013). A Scalable Communication-Induced Checkpointing Algorithm for Distributed Systems, IEICE Transactions on Information and Systems, Vol. E96.D (4): 886-896
CIENCIA DE LOS ORDENADORES
Versión aceptada
acceptedVersion - Versión aceptada
Aparece en las colecciones: Artículos de Ciencias Computacionales

Cargar archivos: