## Abstract

The time complexity of wait-free algorithms in so-called normal executions, where no failures occur and processes operate at approximately the same speed, is considered. A lower bound of log n on the time complexity of any wait-free algorithm that achieves approximate agreement among n processes is proved. In contrast, there exists a non-wait-free algorithm that solves this problem in constant time. This implies an Ω(log n)-time separation between the wait-free and non-wait-free computation models. An O(log n)-time wait-free approximate agreement algorithm is presented. Its complexity is within a small constant of the lower bound.

Original language | English |
---|---|

Pages (from-to) | 55-64 |

Number of pages | 10 |

Journal | IEEE Transactions on Industry Applications |

Volume | 27 |

Issue number | 1 pt 1 |

State | Published - Jan 1991 |

Externally published | Yes |

Event | 1989 Industry Applications Society Annual Meeting - San Diego, CA, USA Duration: 1 Oct 1989 → 5 Oct 1989 |