Research Article

A Novel Low-Overhead Recovery Approach for Distributed Systems

Table 2

Brief summary of comparisons.

Required message orderingMaximum rollbacks Per failureMessage overheadMessage complexityNumber of concurrent failures

Manivannan-Singhal [7]None1 𝑂 ( 𝐹 ) 𝑂 ( 𝑛 2 ) 𝑛
Johnson-Zawenepoel [16]None1 𝑂 (1) 𝑂 ( 𝑛 )1
Juang-Venkatesan [19]None1 𝑂 (1) 𝑂 ( 𝑛 2 ) 𝑛
Damini-Grag [17]None1 𝑂 ( 𝑛 ) 𝑂 ( 𝑛 2 ) 𝑛
Our algorithmNone1None 𝑂 ( 𝑛 ) 𝑛