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...
Uložené v:
| Vydané v: | Journal of computing and information technology Ročník 16; číslo 1; s. 23 - 33 |
|---|---|
| Hlavní autori: | , , |
| Médium: | Journal Article Paper |
| Jazyk: | English |
| Vydavateľské údaje: |
Zagreb
University Computing Centre
01.03.2008
Sveuciliste U Zagrebu Fakultet elektrotehnike i računarstva Sveučilišta u Zagrebu |
| Predmet: | |
| ISSN: | 1330-1136, 1846-3908 |
| On-line prístup: | Získať plný text |
| Tagy: |
Pridať tag
Žiadne tagy, Buďte prvý, kto otaguje tento záznam!
|
| Shrnutí: | 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]. |
|---|---|
| Bibliografia: | 44603 |
| ISSN: | 1330-1136 1846-3908 |
| DOI: | 10.2498/cit.1000906 |