### 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.

Original language | English (US) |
---|---|

Pages (from-to) | 3001-3030 |

Number of pages | 30 |

Journal | Theoretical Computer Science |

Volume | 411 |

Issue number | 34-36 |

DOIs | |

State | Published - Jul 17 2010 |

Externally published | Yes |

### Keywords

- Balancing network
- Contention
- Counting network
- Distributed data structure
- Shared memory

### ASJC Scopus subject areas

- Theoretical Computer Science
- Computer Science(all)

## Fingerprint Dive into the research topics of 'An efficient counting network'. Together they form a unique fingerprint.

## Cite this

*Theoretical Computer Science*,

*411*(34-36), 3001-3030. https://doi.org/10.1016/j.tcs.2010.04.023