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:50Z | |
dc.date.available | 2019-11-13T10:38:50Z | |
dc.date.issued | 2010 | |
dc.identifier.uri | http://gnosis.library.ucy.ac.cy/handle/7/53664 | |
dc.description.abstract | We present a novel counting network construction, where the number of input wires w is smaller than or equal to the number of output wires t. The depth of our network is Θ(lg2w), which depends only on w. In contrast, the amortized contention of the network depends on the number of concurrent processes n and the parameters w and t. This offers more flexibility than all previously known networks, with the same number w of input and output wires, whose contention depends only on two parameters, w and n. In case n>wlgw, by choosing t>wlgw the contention of our network is O(nlgww), which improves by a logarithmic factor of w over all previously known networks with w wires. © 2010 Elsevier B.V. | en |
dc.source | Theoretical Computer Science | en |
dc.source.uri | https://www.scopus.com/inward/record.uri?eid=2-s2.0-77955419583&doi=10.1016%2fj.tcs.2010.04.023&partnerID=40&md5=d36a8b86afc38741280b3a078d3c8105 | |
dc.subject | Wire | en |
dc.subject | Data structures | en |
dc.subject | Counting networks | en |
dc.subject | Distributed data structures | en |
dc.subject | Balancing network | en |
dc.subject | Contention | en |
dc.subject | Counting network | en |
dc.subject | Distributed data structure | en |
dc.subject | Network contention | en |
dc.subject | Shared memories | en |
dc.subject | Shared memory | en |
dc.title | An efficient counting network | en |
dc.type | info:eu-repo/semantics/article | |
dc.identifier.doi | 10.1016/j.tcs.2010.04.023 | |
dc.description.volume | 411 | |
dc.description.issue | 34-36 | |
dc.description.startingpage | 3001 | |
dc.description.endingpage | 3030 | |
dc.author.faculty | 002 Σχολή Θετικών και Εφαρμοσμένων Επιστημών / Faculty of Pure and Applied Sciences | |
dc.author.department | Τμήμα Πληροφορικής / Department of Computer Science | |
dc.type.uhtype | Article | en |
dc.source.abbreviation | Theor.Comput.Sci. | en |
dc.contributor.orcid | Busch, Costas [0000-0002-4381-4333] | |
dc.gnosis.orcid | 0000-0002-4381-4333 | |