A tighter bound for the self-stabilization time in Herman's algorithm

Yuan Feng, Lijun Zhang

    Research output: Contribution to journalArticleAcademicpeer-review

    5 Citations (Scopus)

    Abstract

    We study the expected self-stabilization time of Herman's algorithm. For N processors the lower bound is 427N^2 (0.148N^2), and an upper bound of 0.64N^2 is presented in Kiefer et al. (2011) [4]. In this paper we give a tighter upper bound 0.521N^2.
    Original languageEnglish
    Pages (from-to)486-488
    Number of pages3
    JournalInformation processing letters
    Volume113
    Issue number13
    DOIs
    Publication statusPublished - Jul 2013

    Keywords

    • EC Grant Agreement nr.: FP7/2007-2013
    • EC Grant Agreement nr.: FP7/318003

    Fingerprint Dive into the research topics of 'A tighter bound for the self-stabilization time in Herman's algorithm'. Together they form a unique fingerprint.

    Cite this