Reaching Agreement on Processor Group Membership in Synchronous Distributed SystemsReaching Agreement • January 28th, 2009
Contract Type FiledJanuary 28th, 2009Reaching agreement on the identity of correctly functioning processors of a dis- tributed system in the presence of random communication delays, failures and proces- sor joins is a fundamental problem in fault-tolerant distributed systems. Assuming a synchronous communication network that is not subject to partition occurrences, we specify the processor-group membership problem and we propose three simple proto- cols for solving it. The protocols provide all correct processors with consistent views of the processor-group membership and guarantee bounded processor failure detection and join delays.
Reaching Agreement on Processor Group Membership in Synchronous Distributed SystemsReaching Agreement • November 6th, 2007
Contract Type FiledNovember 6th, 2007Reaching agreement on the identity of correctly functioning processors of a dis- tributed system in the presence of random communication delays, failures and proces- sor joins is a fundamental problem in fault-tolerant distributed systems. Assuming a synchronous communication network that is not subject to partition occurrences, we specify the processor-group membership problem and we propose three simple proto- cols for solving it. The protocols provide all correct processors with consistent views of the processor-group membership and guarantee bounded processor failure detection and join delays.