Sciweavers

66 search results - page 1 / 14
» The Checkpoint Problem
Sort
View
TPDS
1998
135views more  TPDS 1998»
13 years 4 months ago
On Coordinated Checkpointing in Distributed Systems
—Coordinated checkpointing simplifies failure recovery and eliminates domino effects in case of failures by preserving a consistent global checkpoint on stable storage. However, ...
Guohong Cao, Mukesh Singhal
SIGOPS
2002
74views more  SIGOPS 2002»
13 years 4 months ago
Comments on "transparent user-level process checkpoint and restore for migration" by Bozyigit and Wasiq
The simple checkpointing and migration system for UNIX processes as described in the article of Bozyigit and Wasiq [1] can be improved in two ways: First by a technique to checkpo...
Felix Rauch, Thomas Stricker
SC
2000
ACM
13 years 9 months ago
Scalable Fault-Tolerant Distributed Shared Memory
This paper shows how a state-of-the-art software distributed shared-memory (DSM) protocol can be efficiently extended to tolerate single-node failures. In particular, we extend a ...
Florin Sultan, Thu D. Nguyen, Liviu Iftode
ICSE
2008
IEEE-ACM
14 years 5 months ago
Temporal dependency based checkpoint selection for dynamic verification of fixed-time constraints in grid workflow systems
In grid workflow systems, temporal correctness is critical to assure the timely completion of grid workflow execution. To monitor and control the temporal correctness, fixed-time ...
Jinjun Chen, Yun Yang
APPROX
2010
Springer
154views Algorithms» more  APPROX 2010»
13 years 6 months ago
The Checkpoint Problem
In this paper, we consider the checkpoint problem in which given an undirected graph G, a set of sourcedestinations {(s1, t1), (s1, t1), . . . , (sk, tk)} and a set of fixed paths...
MohammadTaghi Hajiaghayi, Rohit Khandekar, Guy Kor...