Brief Announcement: Fast Shared Counting using (O(n)) Compare-and-Swap Registers

We consider the problem of building a wait-free and linearizable counter using shared registers. The counter supports a read operation, which returns the value of the counter, and an increment operation, which increments the value of the counter and returns nothing. The shared registers support read, write and compare-and-swap instructions. We show that given (n) processes and (O(n)) shared registers, the increment operation is in (O(log n)) and read operation is in (O(1)).