Loading...
Please wait, while we are loading the content...
Similar Documents
An Efficient Counting Network (1998)
| Content Provider | CiteSeerX |
|---|---|
| Author | Busch, Costas |
| 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.Inorder 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 =2 k and w = p2 l . This construction is practical and achieves depth O#lg 2 t# which is independent from the output width w.Further- more, by taking w to be ##t lg t# it incurs an amortized contention of the order O##n lg t#=t#,wheren is the concurrency, which improves by a logarithmic factor over all previously known practical counting networks constructions of width t. |
| File Format | |
| Volume Number | 41 |
| Journal | JOURNAL OF THE ACM |
| Language | English |
| Publisher Date | 1998-01-01 |
| Access Restriction | Open |
| Subject Keyword | Efficient Counting Network Output Width Input Width Counting Network High-performance Asynchronous Multiprocessing Depth Lg New Class Practical Counting Network Construction Low Contention Amortized Contention Deterministic Construction Small Depth Logarithmic Factor Low Contention Data Structure |
| Content Type | Text |
| Resource Type | Article |
