TY - GEN
T1 - Faster than optimal snapshots (for a while)
T2 - 2012 ACM Symposium on Principles of Distributed Computing, PODC'12
AU - Aspnes, James
AU - Attiya, Hagit
AU - Censor-Hillel, Keren
AU - Ellen, Faith
PY - 2012
Y1 - 2012
N2 - This paper presents a novel implementation of a snapshot object for n processes, with O(log 2blogn) step complexity for update operations and O(logb) step complexity for scan operations, where b is the number of updates. The algorithm uses only reads and writes. For polynomially many updates, this is an exponential improvement on previous snapshot algorithms, which have linear step complexity. It overcomes the existing Ω(n) lower bound on step complexity by having the step complexity depend on the number of updates. The key to this implementation is the construction of a new object consisting of a pair of max registers that supports a scan operation. Applications of this construction include an implementation of a limited-use generalized counter with polylogarithmic step complexity. This can be used, for example, to monitor the number of active processes, which is crucial to adaptive algorithms.
AB - This paper presents a novel implementation of a snapshot object for n processes, with O(log 2blogn) step complexity for update operations and O(logb) step complexity for scan operations, where b is the number of updates. The algorithm uses only reads and writes. For polynomially many updates, this is an exponential improvement on previous snapshot algorithms, which have linear step complexity. It overcomes the existing Ω(n) lower bound on step complexity by having the step complexity depend on the number of updates. The key to this implementation is the construction of a new object consisting of a pair of max registers that supports a scan operation. Applications of this construction include an implementation of a limited-use generalized counter with polylogarithmic step complexity. This can be used, for example, to monitor the number of active processes, which is crucial to adaptive algorithms.
KW - atomic snapshot
KW - concurrent objects
KW - generalized counters
KW - restricted-use objects
UR - http://www.scopus.com/inward/record.url?scp=84865033158&partnerID=8YFLogxK
U2 - https://doi.org/10.1145/2332432.2332507
DO - https://doi.org/10.1145/2332432.2332507
M3 - منشور من مؤتمر
SN - 9781450314503
T3 - Proceedings of the Annual ACM Symposium on Principles of Distributed Computing
SP - 375
EP - 383
BT - PODC'12 - Proceedings of the 2012 ACM Symposium on Principles of Distributed Computing
Y2 - 16 July 2012 through 18 July 2012
ER -