Advertisement

Brief Announcement: Self-stabilizing Silent Disjunction in an Anonymous Network

  • Ajoy K. Datta
  • Stéphane Devismes
  • Lawrence L. Larmore
Conference paper
  • 546 Downloads
Part of the Lecture Notes in Computer Science book series (LNCS, volume 7596)

Abstract

Given a network of processes \({\cal G}\), where each process has a fixed input bit, Input(x), the disjunction problem is for each process to compute \(\mbox{\it Output\/}=\bigvee_{x\in{\cal G}}\mbox{\it Input\/}(x)\), the disjunction of all input bits in the network.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    Dijkstra, E.: Self stabilizing systems in spite of distributed control. Communications of the Association of Computing Machinery 17, 643–644 (1974)zbMATHCrossRefGoogle Scholar
  2. 2.
    Dolev, S.: Self-Stabilization. The MIT Press (2000)Google Scholar
  3. 3.
    Datta, A.K., Larmore, L.L., Vemula, P.: Self-stabilizing leader election in optimal space under an arbitrary scheduler. Theoretical Computer Science 412(40), 5541–5561 (2011)MathSciNetzbMATHCrossRefGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2012

Authors and Affiliations

  • Ajoy K. Datta
    • 1
  • Stéphane Devismes
    • 2
  • Lawrence L. Larmore
    • 1
  1. 1.Department of Computer ScienceUniversity of Nevada Las VegasUSA
  2. 2.VERIMAG UMR 5104Université Joseph FourierFrance

Personalised recommendations