scholarly journals Enhanced Sender-Based Message Logging for Reducing Forced Checkpointing Overhead in Distributed Systems

2021 ◽  
Vol E104.D (9) ◽  
pp. 1500-1505
Author(s):  
Jinho AHN
Keyword(s):  
Distributed Systems ◽  
Message Logging

scholarly journals Communication-Induced Checkpointing with Message Logging beyond the Piecewise Deterministic (PWD) Model for Distributed Systems

Electronics ◽  
2021 ◽  
Vol 10 (12) ◽  
pp. 1428
Author(s):  
Jinho Ahn
Keyword(s):  
Distributed Systems ◽  
Deterministic Model ◽  
Effective Communication ◽  
The State ◽  
Communication Pattern ◽  
Optimized Protocol ◽  
Message Logging ◽  
Simulation Results ◽  
Better Than

This paper introduces an effective communication-induced checkpointing protocol using message logging to enable the number of extra checkpoints to be far lower than the previous number. Even if a situation occurs in which it is decided that a process receiving a message has to perform forced checkpointing, our protocol allows the process to skip the forced checkpointing action if it recognizes that the state of its sender right before the receipt of the message is recoverable. Additionally, the communication-induced checkpointing protocol is thus not required to assume the piecewise deterministic model, despite being combined with message logging. This protocol can maintain these features by piggybacking a one-bit variable and an n-size vector on each message sent. Our simulation results verify our claim that the presented protocol performs much better than the representative optimized protocol with respect to the forced checkpointing frequency, regardless of the communication pattern.

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

2019 ◽  
Vol 29 (02) ◽  
pp. 1950005
Author(s):  
Jinho Ahn
Keyword(s):  
Distributed Systems ◽  
Experimental Results ◽  
Communication Overhead ◽  
Additional Control ◽  
Message Logging ◽  
Control Message ◽  
Message Exchange

The inherent shortcoming of the conventional Sender-Based Message Logging (SBML) protocols is to require additional control message interactions per application message to satisfy the always-no-orphans condition in case of sequential failures. In this paper, a scalable SBML protocol is introduced to lower the communication overhead by handling a sequence of messages consecutively received by each process before sending as a party. The protocol enables the process to delay the update of their receive sequence numbers to their senders until there comes out the first message it is willing to send, and then perform the collective filling out task with each sender requiring only one control message exchange. Experimental results show that our protocol outperforms the previous one in terms of the number of control messages generated.

Sign in / Sign up

Export Citation Format

Share Document