A Causal Broadcast Algorithm with Low-Complexity and Deadlock-Free in Asynchronous Systems

This paper presents an algorithm called LCDF, derived from Low-Complexity and Deadlock-Free. LCDF is a message-passing algorithm that preserves the causality of messages. This algorithm focuses on two critical challenges in asynchronous distributed systems: reducing communication complexity and avoiding deadlock. We first review past causal broadcast algorithms and, by addressing the aforementioned challenges encountered in previous works, propose a low-complexity and deadlock-free algorithm. Subsequently, we prove that our algorithm has communication complexity of order O(n). Additionally, we demonstrate that while maintaining the causal delivery property, LCDF ensures no deadlock occurs during message exchange among participating processes.

کلیدواژه ها:

Reliable Communication ، Causal Broadcast ، Deadlock-Free ، Communication Complexity ، Asynchronous System