Distributed Counting: How to Bypass Bottlenecks

Roger P. Wattenhofer · Repository for Publications and Research Data (ETH Zurich) · 1998

A distributed counter is avariable that is common to all processors in the system and that supports an atomic tesi-tuui-increment opcration: The operation delivors the counter valuo to the reqnesting processor and increments it.In this work we examine different aspects of distributed counting, with the emphasis on elnciencv.

Read the paper · More papers on PaperTik