hrcak mascot   Srce   HID

Izvorni znanstveni članak
https://doi.org/10.2498/cit.1000906

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

Shahram Rahimi
Ziping Liu
Bidyut Gupta

Puni tekst: engleski, pdf (372 KB) str. 23-33 preuzimanja: 413* citiraj
APA 6th Edition
Rahimi, S., Liu, Z. i Gupta, B. (2008). Design of High Performance Distributed Snapshot/Recovery Algorithms for Ring Networks. Journal of computing and information technology, 16 (1), 23-33. https://doi.org/10.2498/cit.1000906
MLA 8th Edition
Rahimi, Shahram, et al. "Design of High Performance Distributed Snapshot/Recovery Algorithms for Ring Networks." Journal of computing and information technology, vol. 16, br. 1, 2008, str. 23-33. https://doi.org/10.2498/cit.1000906. Citirano 02.03.2021.
Chicago 17th Edition
Rahimi, Shahram, Ziping Liu i Bidyut Gupta. "Design of High Performance Distributed Snapshot/Recovery Algorithms for Ring Networks." Journal of computing and information technology 16, br. 1 (2008): 23-33. https://doi.org/10.2498/cit.1000906
Harvard
Rahimi, S., Liu, Z., i Gupta, B. (2008). 'Design of High Performance Distributed Snapshot/Recovery Algorithms for Ring Networks', Journal of computing and information technology, 16(1), str. 23-33. https://doi.org/10.2498/cit.1000906
Vancouver
Rahimi S, Liu Z, Gupta B. Design of High Performance Distributed Snapshot/Recovery Algorithms for Ring Networks. Journal of computing and information technology [Internet]. 2008 [pristupljeno 02.03.2021.];16(1):23-33. https://doi.org/10.2498/cit.1000906
IEEE
S. Rahimi, Z. Liu i B. Gupta, "Design of High Performance Distributed Snapshot/Recovery Algorithms for Ring Networks", Journal of computing and information technology, vol.16, br. 1, str. 23-33, 2008. [Online]. https://doi.org/10.2498/cit.1000906

Sažetak
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].

Hrčak ID: 44603

URI
https://hrcak.srce.hr/44603

Posjeta: 583 *