dc.contributor.author | Busch, Costas | en |
dc.contributor.author | Mavronicolas, Marios | en |
dc.creator | Busch, Costas | en |
dc.creator | Mavronicolas, Marios | en |
dc.date.accessioned | 2019-11-13T10:38:51Z | |
dc.date.available | 2019-11-13T10:38:51Z | |
dc.date.issued | 1996 | |
dc.identifier.uri | http://gnosis.library.ucy.ac.cy/handle/7/53668 | |
dc.description.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. | en |
dc.source | Proceedings of the Annual ACM Symposium on Principles of Distributed Computing | en |
dc.source | Proceedings of the 1996 15th Annual ACM Symposium on Principles of Distributed Computing | en |
dc.source.uri | https://www.scopus.com/inward/record.uri?eid=2-s2.0-0029713955&partnerID=40&md5=204032b9a60d687d095856a5d1d0b59b | |
dc.subject | Distributed computer systems | en |
dc.subject | Algorithms | en |
dc.subject | Theorem proving | en |
dc.subject | Network protocols | en |
dc.subject | Synchronization | en |
dc.subject | Combinatorial circuits | en |
dc.subject | Equivalence classes | en |
dc.subject | Data structures | en |
dc.subject | Counting networks | en |
dc.subject | Shared counters | en |
dc.subject | Counting circuits | en |
dc.subject | Computer operating procedures | en |
dc.subject | Elimination balancers | en |
dc.title | Strength of counting networks | en |
dc.type | info:eu-repo/semantics/conferenceObject | |
dc.author.faculty | 002 Σχολή Θετικών και Εφαρμοσμένων Επιστημών / Faculty of Pure and Applied Sciences | |
dc.author.department | Τμήμα Πληροφορικής / Department of Computer Science | |
dc.type.uhtype | Conference Object | en |
dc.description.notes | <p>Sponsors: ACM | en |
dc.description.notes | Conference code: 44773 | en |
dc.description.notes | Cited By :3</p> | en |
dc.contributor.orcid | Busch, Costas [0000-0002-4381-4333] | |
dc.gnosis.orcid | 0000-0002-4381-4333 | |