dc.contributor.author | Busch, Costas | en |
dc.contributor.author | Mavronicolas, Marios | en |
dc.contributor.editor | Anon | en |
dc.creator | Busch, Costas | en |
dc.creator | Mavronicolas, Marios | en |
dc.date.accessioned | 2019-11-13T10:38:50Z | |
dc.date.available | 2019-11-13T10:38:50Z | |
dc.date.issued | 1998 | |
dc.identifier.isbn | 0-8186-8404-6 | |
dc.identifier.uri | http://gnosis.library.ucy.ac.cy/handle/7/53665 | |
dc.description.abstract | Counting networks were introduced as a new class of concurrent, distributed, low contention data structures suitable for implementing shared counters. Their structure is similar to that of sorting networks. High-performance asynchronous multiprocessing requires counting networks to both have small depth and incur low contention. In order to achieve this, we relax in this work the requirement that the input width of the counting network is equal to its output width. More specifically, we present an explicit, deterministic construction of a counting network with t input width and w output width, where t≤w, t = 2k and w = p2l. This construction is practical and achieves depth O(lg2 t) which is independent from the output width w. Furthermore, by taking w to be Θ(t lg t) it incurs an amortized contention of the order O((n lg t)/t), where n is the concurrency, which improves by a logarithmic factor over all previously known practical counting networks constructions of width t. | en |
dc.source | Proceedings of the International Parallel Processing Symposium, IPPS | en |
dc.source | Proceedings of the 1998 12th International Parallel Processing Symposium and 9th Symposium on Parallel and Distributed Processing | en |
dc.source.uri | https://www.scopus.com/inward/record.uri?eid=2-s2.0-0031672633&doi=10.1109%2fIPPS.1998.669944&partnerID=40&md5=d1adfc83b55b4e6d2c7b62f35da58087 | |
dc.subject | Computational complexity | en |
dc.subject | Digital arithmetic | en |
dc.subject | Electric network analysis | en |
dc.subject | Data structures | en |
dc.subject | Counting circuits | en |
dc.subject | High performance asynchronous multiprocessing | en |
dc.title | Efficient counting network | en |
dc.type | info:eu-repo/semantics/conferenceObject | |
dc.identifier.doi | 10.1109/IPPS.1998.669944 | |
dc.description.startingpage | 380 | |
dc.description.endingpage | 384 | |
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: IEEE | en |
dc.description.notes | Conference code: 48377 | en |
dc.description.notes | Cited By :9</p> | en |
dc.contributor.orcid | Busch, Costas [0000-0002-4381-4333] | |
dc.gnosis.orcid | 0000-0002-4381-4333 | |