Summary: Approximate Shared-Memory Counting Despite a Strong Adversary
A new randomized asynchronous shared-memory data
structure is given for implementing an approximate
counter that can be incremented up to n times.
For any fixed , the counter achieves a relative
error of with high probability, at the cost of
O(((1/) log n)O(1/ )
) register operations per increment
((1/) log n)O(1/ )
) register operations per
read. The counter combines randomized sampling for
estimating large values with an expander for estimating
small values. This is the first sublinear solution to this
problem that works despite a strong adversary scheduler
that can observe internal states of processes.
An application of the improved counter is an im-