Results 1 - 10 of 135

Manetho: Transparent Rollback-Recovery with Low Overhead, Limited Rollback and Fast Output Commit

by Elmootazbellah N. Elnozahy, Willy Zwaenepoel - IEEE TRANSACTIONS ON COMPUTERS , 1992
"... Manetho is a new transparent rollback-recovery protocol for long-running distributed computations. It uses a novel combination of antecedence graph maintenance, uncoordinated checkpointing, and sender-based message logging. Manetho simultaneously achieves the advantages of pessimistic message loggin ..."
Abstract - Cited by 209 (11 self) - Add to MetaCart
Manetho is a new transparent rollback-recovery protocol for long-running distributed computations. It uses a novel combination of antecedence graph maintenance, uncoordinated checkpointing, and sender-based message logging. Manetho simultaneously achieves the advantages of pessimistic message

Hierarchical Coordinated Checkpointing Protocol

by Himadri S. Paul, Arobinda Gupta, R. Badrinath - In International Conference on Parallel and Distributed Computing Systems , 2002
"... Coordinated checkpointing protocol is a simple and useful protocol, used for fault tolerance in distributed system on LAN. However, checkpoint overhead of the protocol is bottlenecked by the link speed. Checkpoint overhead of the protocol increases even if only one link in the network is of low-spee ..."
Abstract - Cited by 4 (3 self) - Add to MetaCart
Coordinated checkpointing protocol is a simple and useful protocol, used for fault tolerance in distributed system on LAN. However, checkpoint overhead of the protocol is bottlenecked by the link speed. Checkpoint overhead of the protocol increases even if only one link in the network is of low

SPEEDITY-A Real Time Commit Protocol

by S. Agrawal, Udai Shanker, Abhay N. Singh, A. Anand
"... This paper presents Shadow, Piggy bag, Elemental External Dependency Inversion and in Time Yielding (SPEEDITY) commit protocol for distributed real time database systems (DRTDBS). Here, only abort dependent cohort having deadline greater than a specific value (T shadow_creation_time) needs to forks ..."
Abstract - Add to MetaCart
This paper presents Shadow, Piggy bag, Elemental External Dependency Inversion and in Time Yielding (SPEEDITY) commit protocol for distributed real time database systems (DRTDBS). Here, only abort dependent cohort having deadline greater than a specific value (T shadow_creation_time) needs to forks

CRAK: Linux Checkpoint/Restart As a Kernel Module

by Hua Zhong, Jason Nieh , 2001
"... Process checkpoint/restart is a very useful technology for process migration, load balancing, crash recovery, rollback transaction, job controlling and many other purposes. Although process migration has not yet been widely used and is not widely available commercial systems, the growing shift of co ..."
Abstract - Cited by 47 (1 self) - Add to MetaCart
Process checkpoint/restart is a very useful technology for process migration, load balancing, crash recovery, rollback transaction, job controlling and many other purposes. Although process migration has not yet been widely used and is not widely available commercial systems, the growing shift

Volume 1 – No. 3 SPEEDITY-A Real Time Commit Protocol

by S. Agrawal, Udai Shanker, Abhay N. Singh, A. Anand
"... This paper presents Shadow, Piggy bag, Elemental External Dependency Inversion and in Time Yielding (SPEEDITY) commit protocol for distributed real time database systems (DRTDBS). Here, only abort dependent cohort having deadline greater than a specific value (Tshadow_creation_time) needs to forks o ..."
Abstract - Add to MetaCart
This paper presents Shadow, Piggy bag, Elemental External Dependency Inversion and in Time Yielding (SPEEDITY) commit protocol for distributed real time database systems (DRTDBS). Here, only abort dependent cohort having deadline greater than a specific value (Tshadow_creation_time) needs to forks

Using Message Semantics for Fast-Output Commit in Checkpointing-and-Rollback Recovery

by Luís Moura, Silva João, Gabriel Silva
"... Checkpointing is a very effective technique to ensure the continuity of long-running applications in the occurrence of failures. However, one of the handicaps of coordinated checkpointing is the high latency for committing output from the application to the external world. Enhancing the checkpointin ..."
Abstract - Add to MetaCart
Checkpointing is a very effective technique to ensure the continuity of long-running applications in the occurrence of failures. However, one of the handicaps of coordinated checkpointing is the high latency for committing output from the application to the external world. Enhancing

Architectural semantics for practical transactional memory

by Austen Mcdonald, Jaewoong Chung, Brian D. Carlstrom, Chi Cao Minh, Hassan Chafi, Christos Kozyrakis, Kunle Olukotun - In International Symposium on Computer Architecture , 2006
"... Transactional Memory (TM) simplifies parallel programming by allowing for parallel execution of atomic tasks. Thus far, TM systems have focused on implementing transactional state buffering and conflict resolution. Missing is a robust hardware/software interface, not limited to simplistic instructio ..."
Abstract - Cited by 75 (10 self) - Add to MetaCart
comprehensive instruction set architecture (ISA) for TM systems. Our proposal introduces three key mechanisms: two-phase commit; support for software handlers on commit, violation, and abort; and full support for open- and closed-nested transactions with independent rollback. These mechanisms provide a flexible

Checkpointing and Recovery for Distributed Shared Memory Applications

by Jinsong Ouyang, Gernot Heiser - IN PROCEEDINGS OF THE 4TH INTERNATIONAL WORKSHOP ON OBJECT ORIENTATION IN OPERATING SYSTEMS , 1995
"... This paper proposes an approach for adding fault tolerance, based on consistent checkpointing, to distributed shared memory applications. Two different mechanisms are presented to efficiently address the issue of message losses due to either site failures or unreliable non-FIFO channels. Both guaran ..."
Abstract - Cited by 2 (1 self) - Add to MetaCart
guarantee a correct and efficient recovery from a consistent distributed system state following a failure. A variant of the two-phase commit protocol is employed such that the communication overhead required to take a consistent checkpoint is the same as that of systems using a one-phase commit protocol

Recovery management in QuickSilver

by Roger Haskin, Yoni Malachi, Wayne Sawdon, Gregory Chan - ACM Transactions on Computer Systems , 1988
"... developed at the IBM Almaden Research Center, which uses atomic tran.sactions as a unified failure recovery mechanism for a client-server structured distributed system. Transactions allow failure atomicity for related activities at a single server or at a number of independent servers. Rather than b ..."
Abstract - Cited by 73 (0 self) - Add to MetaCart
bundling transaction management into a dedicated language or recoverable object manager, Quicksilver exposes the basic commit protocol and log recovery primi-tives, allowing clients and servers to tailor their recovery techniques to their specific needs. Servers can implement their own log recovery

Adaptable, efficient, and modular coordination of distributed extended transactions

by Tong Zhou - In Proceeding of the International Conference on Parallel and Distributed Databases , 1996
"... We describe a method for building a variety of coor-dination protocols as well as distributed extended trans-action primitives. The method is called Open Coordi-nation Protocol (OCP), and we apply OCP to construct many variants of Commit_Transaction [15, 13, 22, 12], as well as distributed Split_Tra ..."
Abstract - Cited by 7 (7 self) - Add to MetaCart
We describe a method for building a variety of coor-dination protocols as well as distributed extended trans-action primitives. The method is called Open Coordi-nation Protocol (OCP), and we apply OCP to construct many variants of Commit_Transaction [15, 13, 22, 12], as well as distributed Split_Transaction
Results 1 - 10 of 135