An efficient counting network
SourceTheoretical Computer Science
Google Scholar check
MetadataShow full item record
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.
Showing items related by title, author, creator and subject.
Andreou, Panayiotis G.; Zeinalipour-Yazdi, Constantinos D.; Samaras, George S.; Chrysanthis, Panos K. (2014)Wireless sensor networks enable users to monitor the physical world at an extremely high fidelity. In order to collect the data generated by these tiny-scale devices, the data management community has proposed the utilization ...
Savva, Giannis; Manousakis, Konstantinos; Ellinas, Georgios (2019)In this work, the concept of network coding (NC) is used in conjunction with the routing and spectrum allocation (RSA) problem to jointly provide security and protection in elastic optical networks (EONs). Specifically, ...
Morgan, Ethan; Skaathun, Britt; Nikolopoulos, Georgios K.; Paraskevis, Dimitrios; Williams, Leslie D.; Smyrnov, Pavlo; Friedman, Samuel R.; Schneider, John A. (2019)Individuals with recent/acute HIV-infection have an increased likelihood of disease transmission. To evaluate effectiveness of identifying recent infections, we compared networks of recently and long-term HIV-infected ...