Brief announcement: self-stabilizing silent disjunction in an anonymous network

  • Authors:

  • Ajoy K. Datta;Stéphane Devismes;Lawrence L. Larmore

  • Affiliations:

  • Department of Computer Science, University of Nevada Las Vegas;VERIMAG UMR 5104, Université Joseph Fourier, France;Department of Computer Science, University of Nevada Las Vegas

  • Venue:
  • SSS'12 Proceedings of the 14th international conference on Stabilization, Safety, and Security of Distributed Systems
  • Year:
  • 2012

Quantified Score

Hi-index 0.00

Visualization

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.