A Novel Low-Overhead Recovery Approach for Distributed Systems

Algorithm 2

 For each process 𝑃_𝑘 and 1≤𝑖≤𝑛,𝑖≠𝑘

   if 𝑆^ik_𝑥>𝑅^ki_𝑥

     𝑃^∗ records these sequence numbers (𝑅^ki_𝑥+1) to 𝑆^ik_𝑥 in lost-from- 𝑃^𝑘𝑖 ;

      // messages with sequence numbers (𝑅^ki_𝑥+1) to 𝑆^ik_𝑥 are

      the lost messages from 𝑃_𝑖 to 𝑃_𝑘.

     𝑃^∗ forms the total order of all lost messages sent by every 𝑃_𝑖,𝑖≠𝑘 to 𝑃_𝑘

   using lost-from- 𝑃^𝑘𝑖 and the message log MESG_𝑘 for 𝑃_𝑘;