Hutle, M., Malkhi, D., Schmid, U., & Zhou, L. (2009). Chasing the Weakest System Model for Implementing Ω and Consensus. IEEE Transactions on Dependable and Secure Computing, 6(4), 269–281. https://doi.org/10.1109/tdsc.2008.24
E191-02 - Forschungsbereich Embedded Computing Systems
IEEE Transactions on Dependable and Secure Computing
Number of Pages:
IEEE COMPUTER SOC
Electrical and Electronic Engineering
Aguilera et al. and Malkhi et al. presented two system models, which are weaker than all previously proposed models where the eventual leader election oracle Omega can be implemented and thus also consensus can be solved. The former model assumes unicast steps and at least one correct process with f outgoing eventually timely links, whereas the latter assumes broadcast steps and at least one correct process with f bidirectional but moving eventually timely links. Consequently, those models are incomparable. In this paper, we show that Omega can also be implemented in a system with at least one process with f outgoing moving eventually timely links, assuming either unicast or broadcast steps. It seems to be the weakest system model that allows to solve consensus via Omega-based algorithms known so far. We also provide matching lower bounds for the communication complexity of Omega in this model, which are based on an interesting "stabilization property" of infinite runs. Those results reveal a fairly high price to be paid for this further relaxation of synchrony properties.
Computer Engineering and Software-Intensive Systems: 100%