| | |
Summary: The Relative Overhead of Piggybacking
in Causal Message Logging Protocols
Karan Bhatia Keith Marzullo \Lambda
Dept. of Computer Science and Eng.
University of California, San Diego
Lorenzo Alvisi y
Dept. of Computer Sciences
University of Texas at Austin
Abstract
Message logging protocols ensure that crashed pro
cesses make the same choices when reexecuting non
deterministic events during recovery. Causal message
logging protocols achieve this by piggybacking the re
sults of these choices (called determinants) on the am
bient message traffic. By doing so, these protocols do
not create orphan processes nor introduce blocking in
failurefree executions. To survive f failures, they ensure
that determinants are stored by at least f + 1 processes.
Causal logging protocols differ in the kind of infor
mation they piggyback to other processes. The more
|