HOPE: A Hybrid Optimistic checkpointing and selective Pessimistic mEssage logging protocol for large scale distributed systems

Scalable Sender-Based Message Logging Protocol with Little Communication Overhead for Distributed Systems

“…It is classified into two categories, synchronous and asynchronous, depending on when the always-no-orphans condition is ensured [3]. The first, also called pessimistic logging [4,5,7,9,10,14], forces each message to be logged as soon as it is received or before transmitting the message expected to be sent in the first place after the former message. In contrast, the second, called optimistic logging [11,12], allows logging each message to be delayed up to the favorable time to its receiver expecting the task will be successfully finished before a failure occurs.…”

“…Sender-based message logging (SBML) is a lightweight synchronous one that performs volatile logging by saving each message recovery information in its sender's volatile memory while ensuring the always-no-orphans condition in case of sequential failures [4]. However, the inherent drawback of the conventional SBML protocols [4,5,7,9,10] is to require additional control message interactions for every application message to satisfy the condition. However, we found that the control message interaction overhead of the conventional SBML may highly be reduced if a distributed application repetitively exhibits a sequence of one way message exchange patterns to each process.…”

“…However, the traditional SBML protocols [4,5,7,9,10] satisfy the alwaysno-orphans condition in sequential failures at the expense of two extra control messages for RSN notification and confirmation per application message. So, in this paper, a new SBML protocol is proposed that may considerably lower the communication overhead resulting from the inherent feature of the traditional ones.…”

Hybrid Message Pessimistic Logging. Improving current pessimistic message logging protocols

“…Works like [17], [18] and [19] focus on grouping the processes that communicate more frequently in order to reduce the number of messages logged using a coordinated checkpoint between these processes.…”

Marching Band: Fault-Tolerance with Replicable Message Delivery Order

“…Similarly, the processes may be divided into groups based on their behavior, code analysis, or location [20], [21]. Usually coordinated checkpoint is used within a group, while only messages exchanged between the groups are logged [1].…”