A Survey on Counting Networks

In the counting problem, asynchronous concurrent processes repeatedly assign themselves successive values, such as integers or locations in memory. Counting networks are a class of concurrent data structures that support highly concurrent counting in a way that minimizes serialization and memory contention. In the past six years, counting networks have been the focus of a growing body of research. This paper surveys recent work on counting networks.

• Type: Conference
• Year: 1998
• Where: WDAS
• Authors: Costas Busch, Maurice Herlihy
• Keywords: Asynchronous Concurrent Processes, Concurrent Counting, Counting Problem, Distributed And Parallel Computing, WDAS 1998