Forced Replicable Execution for a Subset of Piecewise Deterministic Applications with Deterministic Message Passing

Danilecki, Arkadiusz

doi:10.1109/pdcat.2014.37

Cited by 1 publication

(3 citation statements)

References 31 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…It follows that in any history with a finite number of crash, for any process P i , ordering of message delivered by P i and their content is the same as in some history without a crash. Since in [3] we proved all states produced by Marching Band (in the absence of crashes) are possible in PWD system with original point-to-point messaging primitives, it follows that all states possible in histories enforced by fault-tolerant version of Marching Band are also possible in some history under a PWD system.…”

Section: Lemma 2 No Message Delivery Is Reflected In Any P I 'S Statmentioning

confidence: 69%

“…Marching Band correctness: progress: In [3] we proved that Marching Band ensures replicable execution and progress with the absence of the failures. The proofs for fault-tolerant version of Marching Band are similar and we omit them because of space limitations.…”

Section: Marching Bandmentioning

confidence: 85%

“…Ascertaining whether an application follow particular model of determinism may be hard. Instead we proposed that a subclass of piecewise-deterministic (PWD) applications can be forced to behave as if they were deterministic, using Marching Band algorithm [3]. Marching Band assures replicable execution, but it is not fault-tolerant.…”

Section: Introduction and The Motivationmentioning

confidence: 99%

See 2 more Smart Citations

Marching Band: Fault-Tolerance with Replicable Message Delivery Order

Danilecki

2015

2015 23rd Euromicro International Conference on Parallel, Distributed, and Network-Based Processing

View full text Add to dashboard Cite

Marching Band ensures the same total ordering of message deliveries in each possible execution history, providing replicable execution for a subset of piecewise deterministic applications. With Marching Band any number of failures can be tolerated with a sender-based logging. The main idea behind the algorithm is to log and then broadcast each sent message, with a precomputed tag describing ordering of the message delivery.