2012 International Conference on Computer Communication and Informatics 2012
DOI: 10.1109/iccci.2012.6158781
|View full text |Cite
|
Sign up to set email alerts
|

Efficient failure handling in grid computing using failure prediction algorithm

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1

Citation Types

0
1
0

Year Published

2014
2014
2014
2014

Publication Types

Select...
1

Relationship

0
1

Authors

Journals

citations
Cited by 1 publication
(1 citation statement)
references
References 11 publications
0
1
0
Order By: Relevance
“…However these should be effectively maintained to avoid checkpoint overhead, for instance, the checkpoints of p1, p2 among the more messages are passed to and from different process states. So p1 and p2 are not in coherent state where less amount of work has been accomplished [15]. The difficulty is each process takes periodic checkpoint without coordination of another in coherent global state, which is often called domino effect.…”
Section: A Checkpointing Strategymentioning
confidence: 99%
“…However these should be effectively maintained to avoid checkpoint overhead, for instance, the checkpoints of p1, p2 among the more messages are passed to and from different process states. So p1 and p2 are not in coherent state where less amount of work has been accomplished [15]. The difficulty is each process takes periodic checkpoint without coordination of another in coherent global state, which is often called domino effect.…”
Section: A Checkpointing Strategymentioning
confidence: 99%