Summary: Approximate counting
Randomized consensus
Conclusions
Approximate Shared-Memory Counting
Despite a Strong Adversary
James Aspnes Keren Censor
January 5th, 2009
January 5th, 2009 Approximate Shared-Memory Counting
Approximate counting
Randomized consensus
Conclusions
Model
Handling many increments
Handling few increments
Full result
Model
Processes can read and write
shared atomic registers.
Read on an atomic register
returns value of last write.

Source: Aspnes, James - Department of Computer Science, Yale University

Collections: Computer Technologies and Information Sciences