A global snapshot collection algorithm with concurrent initiators with non-FIFO channel

Abstract

Taking a global snapshot in the absence of a global clock is a challenging issue in distributed system. The problem becomes more challenging when the communication channel is a non-FIFO one, due to the lack of FIFO properties in transmitting messages. Multiple initiators further complicate the situation. In this paper, we present a global snapshot collection algorithm with multiple initiators in the case of non-FIFO communication channel. We have shown that the algorithm can take a unique global consistent snapshot with non-FIFO channel, and terminates in O(mn 2) message complexity where m is the number of concurrent initiators, and n is the number of processes in the system. © 2011 Springer-Verlag.