Leader Election in the Timed Finite Average Response Time Model

The finite average response time model is a very weak distributed systems model: it permits runs with unbounded transmission and processing delays and it does not bound the relative speed of neither the processors nor the communication links. The main assumption of this model is that the average response time of a correct process is finite - but not necessarily bounded. In this paper we investigate if one can solve the strong election problem in this system model: we show that we need to add an additional assumption to solve the strong leader election problem. We prove that with the help of a hardware clock with a bounded drift rate one can solve the election problem in this timed FAR model. Technical Report

• Type: Conference
• Year: 2006
• Where: PRDC
• Authors: Christof Fetzer, Martin Süßkraut
• Keywords: Average Response Time, Dependable Computing, Election Problem, PRDC 2006, Response Time Model