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

Arkadiusz Danilecki

doi:10.1109/PDCAT.2014.37

Scientific Information System of the Poznań University of Technology

PL EN

Main page / Publications / Forced Replicable Execution for a Subset of Piecewise Deterministic Applications with Deterministic Message Passing

Submit a comment

Chapter

Download BibTeX

Title

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

Authors

Arkadiusz Danilecki (WI) ^{[ 1 ][ P ]}

^{[ 1 ]} Instytut Informatyki, Wydział Informatyki, Politechnika Poznańska | ^{[ P ]} employee

Year of publication

2014

Chapter type

paper

Publication language

english

Keywords

EN

determinism
message passing
replicable execution

Abstract

EN Ensuring replicable execution of distributed computation has many possible applications in areas of fault-tolerance, debugging, and state-machine based replication. We design a message-passing algorithm which forces a deterministic behavior for a subset of piecewise-deterministic applications. The main principle of the algorithm is to affix each message with a predetermined tag, prescribing a total order for messages.

Pages (from - to)

186 - 192

DOI

10.1109/PDCAT.2014.37

URL

https://ieeexplore.ieee.org/document/7174785

Book

15th International Conference on Parallel and Distributed Computing, Applications and Technologies, PDCAT 2014, Hong Kong, China, December 9-11, 2014

Presented on

15th International Conference on Parallel and Distributed Computing, Applications and Technologies, PDCAT 2014, 9-11.12.2014, Hong Kong, China

Publication indexed in

WoS (15)

System created by Poznań University of Technology and Poznan Supercomputing and Networking Center

Log in through eKonto to add to SIS