Checkpoint Sharing-Based Replication Scheme in Desktop Grid Computing

Song, Ui-Sung; Gil, Joon‐Min; Hong, Sung-Hwa

doi:10.1007/978-94-007-5076-0_58

Cited by 2 publications

(1 citation statement)

References 6 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…It is important to note that is clear that the checkpointing technique whatever its abstraction level is not sufficient to ensure a good fault tolerance in a distributed system. So many papers propose lately to combine between the checkpointing and the replication techniques [40,41]. This hybrid strategy can reduce the fault tolerance overload and execution time of the application itself since the replication ensures the fault tolerance in real time and the checkpointing reduces what suppose to be reexecuted in case of failures.…”

Section: Resultsmentioning

confidence: 99%

Abstraction Checkpointing Levels: Problems and Solutions

Meroufel¹,

Belalem²

2014

IJC

View full text Add to dashboard Cite

A common approach to guarantee an acceptable level of fault tolerance in scientific computing is the checkpointing. In this strategy: when a task fails, it is allowed to be restarted from the recently checked pointed state rather than from the beginning, which reduces the system loss and ensures the reliability. Several systems use the checkpointing to ensure the fault tolerance such as HPC, distributed discrete event simulation and Clouds. The literature proposes several classifications of checkpointing techniques using different metrics and criteria. In this paper we focus on the classification based on abstraction level. In this classification the checkpointing is categorized into two principal types: application level and system level. Each of these levels has its advantages and suffers from many problems. The difference between our present paper and the others surveys proposed in the literature is that: in this paper we will study each level in details. We will also study and analyze some works that propose solutions to solve the problems and exceed the limits of each abstraction level.

show abstract

Section: Resultsmentioning

confidence: 99%

Abstraction Checkpointing Levels: Problems and Solutions

Meroufel¹,

Belalem²

2014

IJC

View full text Add to dashboard Cite

show abstract

Design of Resource Grouping for Desktop Grid Computing and Its Application Methods to Fault-Tolerance

Shon¹,

Gil²

2013

Journal of Digital Contents Society

Self Cite

View full text Add to dashboard Cite

Desktop grid computing is the computing paradigm that can execute large-scale computing jobs using the desktop resources with heterogeneity and volatility. However, such the computing environment can not guarantee the stability and reliability of task execution because the desktop resources with different performance can freely participate and leave in task execution. Therefore, in this paper, we design resource grouping scheme using k-means clustering algorithm with an aim to provide desktop grid computing with the stability and reliability of task execution. Moreover, we conduct resource grouping using the execution log data of actual desktop grid systems and present application methods of desktop resource groups to fault-tolerance. Keywords

show abstract

Checkpoint Sharing-Based Replication Scheme in Desktop Grid Computing

Cited by 2 publications

References 6 publications

Abstraction Checkpointing Levels: Problems and Solutions

Abstraction Checkpointing Levels: Problems and Solutions

Design of Resource Grouping for Desktop Grid Computing and Its Application Methods to Fault-Tolerance

Contact Info

Product

Resources

About