Results 1 - 10 of 2,082

Message Logging: Pessimistic, Optimistic, and Causal

by Lorenzo Alvisi, Keith Marzullo - IEEE Transactions on Software Engineering , 1995
"... Message logging protocols are an integral part of a technique for implementing processes that can recover from crash failures. All message logging protocols require that, when recovery is complete, there be no orphan processes, which are surviving processes whose states are inconsistent with the rec ..."
Abstract - Cited by 140 (16 self) - Add to MetaCart
with the recovered state of a crashed process. We give a precise specification of the consistency property "no orphan processes". From this specification, we describe how different existing classes of message logging protocols (namely optimistic, pessimistic, and a class that we call causal) implement

A Survey of Rollback-Recovery Protocols in Message-Passing Systems

by E. N. ( Mootaz) Elnozahy, Lorenzo Alvisi, Yi-min Wang, David B. Johnson , 1996
"... this paper, we use the terms event logging and message logging interchangeably ..."
Abstract - Cited by 716 (22 self) - Add to MetaCart
this paper, we use the terms event logging and message logging interchangeably

Message Logging Optimistic Causal Pessimistic

by Keshav Pingali , 2003
"... • Old picture of high-performance computing: – Turn-key big-iron platforms – Short-running codes • Modern high-performance computing: – Roll-your-own platforms • Large clusters from commodity parts • Grid Computing – Long-running codes • Program runtimes are exceeding MTBF ..."
Abstract - Add to MetaCart
• Old picture of high-performance computing: – Turn-key big-iron platforms – Short-running codes • Modern high-performance computing: – Roll-your-own platforms • Large clusters from commodity parts • Grid Computing – Long-running codes • Program runtimes are exceeding MTBF

MPICH-V2: a fault tolerant MPI for volatile nodes based on pessimistic sender based message logging

by Aurélien Bouteiller, Thomas Hérault - In SuperComputing 2003 , 2003
"... Execution of MPI applications on clusters and Grid deployments suffering from node and network failures motivates the use of fault tolerant MPI implementations. We present MPICH-V2 (the second protocol of MPICH-V project), an automatic fault tolerant MPI implementation using an innovative protocol t ..."
Abstract - Cited by 84 (4 self) - Add to MetaCart
that removes the most limiting factor of the pessimistic message logging approach: reliable logging of in transit messages. MPICH-V2 relies on uncoordinated checkpointing, sender based message logging and remote reliable logging of message logical clocks. This paper presents the architecture of MPICH-V2, its

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

Understanding The Message Logging Paradigm For Masking Process Crashes

by Lorenzo Alvisi , 1996
"... ... This dissertation presents the first such formal specification. From this specification, the two major classes of message-logging protocols, namely optimistic and pessimistic, are characterized. A third and new class of message-logging protocols, called causal, is introduced. A notion of optimal ..."
Abstract - Cited by 26 (5 self) - Add to MetaCart
... This dissertation presents the first such formal specification. From this specification, the two major classes of message-logging protocols, namely optimistic and pessimistic, are characterized. A third and new class of message-logging protocols, called causal, is introduced. A notion

A distributed algorithm for minimum-weight spanning trees

by R. G. Gallager, P. A. Humblet, P. M. Spira , 1983
"... A distributed algorithm is presented that constructs he minimum-weight spanning tree in a connected undirected graph with distinct edge weights. A processor exists at each node of the graph, knowing initially only the weights of the adjacent edges. The processors obey the same algorithm and exchange ..."
Abstract - Cited by 435 (3 self) - Add to MetaCart
and exchange messages with neighbors until the tree is constructed. The total number of messages required for a graph of N nodes and E edges is at most 5N log2N + 2E, and a message contains at most one edge weight plus log28N bits. The algorithm can be initiated spontaneously at any node or at any subset

Using Message Logging and Checkpointing

by Checkpointing, David B. Johnson, David Bruce Johnson, S. Cartwright, John E. Dennis, David Bruce Johnson, David Bruce Johnson , 1989
"... Fault tolerance can allow processes executing in a computer system to survive failures within the system. This thesis addresses the theory and practice of transparent faulttolerance methods using message logging and checkpointing in distributed systems. A general model for reasoning about the behavi ..."
Abstract - Add to MetaCart
as sublattices. There is thus always a unique maximum recoverable system state. The rst method presented uses a new pessimistic message logging protocol called

Coordinated Checkpoint from Message Payload in Pessimistic Sender-Based Message Logging

by Mehdi Aminian, Mohammad K. Akbari, Bahman Javadi
"... Execution of MPI applications on Clusters and Grid deployments suffers from node and network failure that motivates the use of fault tolerant MPI implementations. Two category techniques have been introduced to make these systems fault-tolerant. The first one is checkpoint-based technique and the ot ..."
Abstract - Add to MetaCart
and the other one is called log-based recovery protocol. Sender-based pessimistic logging which falls in the second category is harnessing from huge amount of messages payloads which must be kept in volatile memory. In this paper we present a Coordinated Checkpoint from Message Payload (CCMP) to reduce

Distributed System Fault Tolerance Using Message Logging and Checkpointing

by David Bruce Johnson , 1989
"... Fault tolerance can allow processes executing in a computer system to survive failures within the system. This thesis addresses the theory and practice of transparent faulttolerance methods using message logging and checkpointing in distributed systems. A general model for reasoning about the behavi ..."
Abstract - Cited by 58 (10 self) - Add to MetaCart
as sublattices. There is thus always a unique maximum recoverable system state. The rst method presented uses a new pessimistic message logging protocol called
Results 1 - 10 of 2,082