scholarly journals Communication Pattern Models: An Extension of Action Models for Dynamic-Network Distributed Systems

2021 ◽  
Vol 335 ◽  
pp. 307-321
Author(s):  
Diego A. Velázquez ◽  
Armando Castañeda ◽  
David A. Rosenblueth

Electronics ◽  
2021 ◽  
Vol 10 (12) ◽  
pp. 1428
Author(s):  
Jinho Ahn

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.



Author(s):  
Luca Liechti ◽  
Paulo Gouveia ◽  
Joao Neves ◽  
Peter Kropf ◽  
Miguel Matos ◽  
...  


2018 ◽  
Vol 14 (1) ◽  
pp. 155014771875687 ◽  
Author(s):  
Zhiwei Yang ◽  
Weigang Wu ◽  
Yishun Chen ◽  
Xiaola Lin ◽  
Jiannong Cao

With the advance in mobile network-based systems, dynamic system has become one of the hotspots in fundamental study of distributed systems. In this article, we consider the dynamic system with frequent topology changes arising from node mobility or other reasons, which is also referred to as “dynamic network.” With the model of dynamic network, fundamental distributed computing problems, such as information dissemination and election, can be formally studied with rigorous correctness. Our work focuses on the node counting problem in dynamic environments. We first define two new dynamicity models, named ( Q, S)- distance and ( Q, S)*- distance, which describe dynamic changes of information propagation time against topology changes. Based on these two models, we design three different counting algorithms which basically adopt the approach of diffusing computation. These algorithms mainly differ in communication cost due to different information collection procedures. The correctness of all the algorithms is formally proved and their performance is evaluated via both theoretical analysis and experimental simulations.





1985 ◽  
Vol 132 (3) ◽  
pp. 89 ◽  
Author(s):  
B.D.O. Anderson ◽  
P.C. Parks
Keyword(s):  


1989 ◽  
Vol 4 (6) ◽  
pp. 321 ◽  
Author(s):  
Jeff Kramer ◽  
Jeff Magee ◽  
Morris Sloman
Keyword(s):  


1989 ◽  
Vol 4 (5) ◽  
pp. 268 ◽  
Author(s):  
Geoffrey F. Carpenter ◽  
Andrew M. Tyrrell
Keyword(s):  


2014 ◽  
pp. 209-214
Author(s):  
P. Ilin ◽  
◽  
J. Sieck ◽  
V. Brovkov ◽  
M. Pashkovskyi


Sign in / Sign up

Export Citation Format

Share Document