• DocumentCode
    2977678
  • Title

    A Variable-Length Quorum Generation Algorithm for Distributed Mutual Exclusion

  • Author

    Li, Meian ; Zhan, Junwei ; Pei, Xichun

  • Author_Institution
    Coll. of Comput. & Inf. Eng., Inner Mongolia Agric. Univ., Huhehaote, China
  • fYear
    2010
  • fDate
    29-31 Oct. 2010
  • Firstpage
    1
  • Lastpage
    4
  • Abstract
    Based on the advantages and disadvantages of LUK´s and LI´s algorithms, a symmetric distributed mutual exclusion quorum generation algorithm with variable-length has been presented. Through introducing the concepts of laxity and average permission repeat times, the time complexity of this quorum generation algorithm became to O(N/2) and the quorum length became N1/2+laxity.
  • Keywords
    computational complexity; distributed algorithms; LI algorithms; LUK algorithm; symmetric distributed mutual exclusion; time complexity; variable-length quorum generation algorithm; Algorithm design and analysis; Arrays; Complexity theory; Encoding; Indexes; Manganese; Radiation detectors;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    Multimedia Technology (ICMT), 2010 International Conference on
  • Conference_Location
    Ningbo
  • Print_ISBN
    978-1-4244-7871-2
  • Type

    conf

  • DOI
    10.1109/ICMULT.2010.5629759
  • Filename
    5629759
    • Link To Document
    https://search.isc.ac/dl/search/defaultta.aspx?DTC=49&DC=2977678