Strength of counting networks

Costas Busch, Marios Mavronicolas

Research output: Contribution to conferencePaperpeer-review

3 Scopus citations

Abstract

This paper shows that any counting network, made up of balancers whose fan-in and fan-out vary arbitrarily, is, indeed, strong enough to simultaneously support both Fetch&Increment and Fetch&Decrement operations, once each of its balancers is substituted by an elimination balancer. Its proof is purely combinatorial, carried out within the elegant combinatorial framework put forth for the study of balancing networks. Through equivalence theorems, impossibility results, lower bounds, verification algorithms and methodologies to prove correctness carry over to counting networks with enriched operation set.

Original languageEnglish (US)
Pages311
Number of pages1
DOIs
StatePublished - 1996
Externally publishedYes
EventProceedings of the 1996 15th Annual ACM Symposium on Principles of Distributed Computing - Philadelphia, PA, USA
Duration: May 23 1996May 26 1996

Conference

ConferenceProceedings of the 1996 15th Annual ACM Symposium on Principles of Distributed Computing
CityPhiladelphia, PA, USA
Period5/23/965/26/96

ASJC Scopus subject areas

  • Software
  • Hardware and Architecture
  • Computer Networks and Communications

Fingerprint Dive into the research topics of 'Strength of counting networks'. Together they form a unique fingerprint.

Cite this