|Betriebssysteme · Institut für Systemarchitektur · Fakultät Informatik · TU Dresden|
09. 03. 2015
Performance Analysis of Distributing Erasure-Coded Checkpoing Data
Sondertermin: 11:00 Uhr, APB/3105
The downside of those systems, however, is that with an increasing number of nodes such a system consists of, the probability of single or even multiple nodes failing also increases massively.
Checkpointing is used to mitigate this problem by allowing to simply restart an application in case of failure. Distributing checkpointing data additionally increases availability with more severe failures.
Erasure coding checkpoint data could be a good approach to allow space and bandwidth efficient storing of checkpoint data while still maintaining or even increasing resistance against multiple node failures.
This work tries to find out whether distributing erasure-coded checkpoint data could be an applicable approach on real-life systems.
17. Oct 2018
|· Copyright © 2001-2010 Operating Systems Group, TU Dresden | Impressum ·|