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.
Synthesis and characterization of robust double-networks based on end-linked, pH-responsive first networks Kitiri, Elina N.; Rikkou-Kalourkoti, Maria D.; Sophocleous, Manolia; Patrickios, Costas S. (2015)Abstract Fragile, end-linked hydrophilic tertiary amine based methacrylate (first) networks were mechanically reinforced using the double-network principle, via the introduction of a polyacrylamide second network. Reinforcement ...
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 ...
Andreou, Panayiotis G.; Zeinalipour-Yazdi, Constantinos D.; Chrysanthis, Panos K.; Samaras, George S. (2011)This paper assumes a set of n mobile sensors that move in the Euclidean plane as a swarm. Our objectives are to explore a given geographic region by detecting and aggregating spatiooral events of interest and to store these ...