Design of High Performance Distributed Snapshot / Recovery Algorithms for Ring Networks

In this work, we have presented non-blocking checkpointing and recovery algorithms for bidirectional networks. We have deviated from the conventional approach of taking first temporary checkpoints and then converting them to permanent ones by processes (as followed by any coordinated checkpointing s...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:Journal of computing and information technology Jg. 16; H. 1; S. 23 - 33
Hauptverfasser: Gupta, Bidyut, Rahimi, Shahram, Liu, Ziping
Format: Journal Article Paper
Sprache:Englisch
Veröffentlicht: Zagreb University Computing Centre 01.03.2008
Sveuciliste U Zagrebu
Fakultet elektrotehnike i računarstva Sveučilišta u Zagrebu
Schlagworte:
Algorithms
Applied sciences
Computer science; control theory; systems
Computer systems and distributed systems. User interface
Exact sciences and technology
Management
Software
Token Ring networks
United States
Checkpointing
High performance
Rollback recovery
Coordination
Distributed system
recovery
ring networks
Ring network
coordinated checkpointing
Ring
Distributed algorithm
distributed systems
Execution time
ISSN:1330-1136, 1846-3908
Online-Zugang:Volltext
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Beschreibung
Zusammenfassung:In this work, we have presented non-blocking checkpointing and recovery algorithms for bidirectional networks. We have deviated from the conventional approach of taking first temporary checkpoints and then converting them to permanent ones by processes (as followed by any coordinated checkpointing scheme). Thus, the proposed coordinated checkpointing algorithm allows processes to take permanent checkpoints directly without taking temporary checkpoints and whenever a process is busy, it takes a checkpoint after completing its current procedure. We have shown that the presented algorithms take much less time for their execution and use much less number of control messages (and hence much less number of interrupts to a process) when compared to a noted recent work [4].
Bibliographie:44603
ISSN:1330-1136
1846-3908
DOI:10.2498/cit.1000906