Fault-Tolerant Termination Detection with Safra’s Algorithm

Abstract

General rightsCopyright and moral rights for the publications made accessible in the public portal are retained by the authors and/or other copyright owners and it is a condition of accessing publications that users recognise and abide by the legal requirements associated with these rights.• Users may download and print one copy of any publication from the public portal for the purpose of private study or research. • You may not further distribute the material or use it for any profit-making activity or commercial gain • You may freely distribute the URL identifying the publication in the public portal ? Take down policyIf you believe that this document breaches copyright please contact us providing details, and we will remove access to the work immediately and investigate your claim.

Assessing the impacts of nonideal communications on distributed optimal power flow algorithms

“…The authors of [17] propose using a variation of the rooted tree method by having multiple roots of the rooted tree and a mechanism for reorganizing the tree's nodes. Most recently, [18] proposes a modification of the ring method in [12] that regularly checks the processors' statuses and reorganizes the ring's network upon detecting a faulty processor.…”

“…The main difference between distributed optimization and distributed computing is that the agents in distributed optimization algorithms run simultaneously, i.e., there are no successors and predecessors, and no agent will be idle until the algorithm terminates. Further, fully distributed optimization algorithms may not have a central agent that initiates and terminates the algorithm similar to [8], [10], [14], nor a communication network topology restriction similar to [11]- [13], [15], [18]- [20].…”