Name
Abstract | ||
|---|---|---|
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. |
Year | DOI | Venue |
|---|---|---|
2013 | 10.1587/transinf.E96.D.886 | IEICE TRANSACTIONS ON INFORMATION AND SYSTEMS |
Keywords | Field | DocType |
distributed systems, communication-induced checkpointing, immediate dependency relation | Computer science,Scalability,Distributed computing | Journal |
Volume | Issue | ISSN |
E96D | 4 | 0916-8532 |
Citations | PageRank | References |
1 | 0.36 | 7 |
Authors | ||
5 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Alberto Calixto Simon | 1 | 5 | 1.83 |
| Saúl E. Pomares Hernández | 2 | 15 | 3.96 |
| Jose Roberto Perez Cruz | 3 | 6 | 3.53 |
| Pilar Gómez-gil | 4 | 60 | 9.39 |
| Khalil Drira | 5 | 481 | 82.48 |