Linearizability: a correctness condition for concurrent objects
ACM Transactions on Programming Languages and Systems (TOPLAS)
ACM Transactions on Programming Languages and Systems (TOPLAS)
A methodology for implementing highly concurrent data objects
ACM Transactions on Programming Languages and Systems (TOPLAS)
Sequential consistency versus linearizability
ACM Transactions on Computer Systems (TOCS)
Simple, fast, and practical non-blocking and blocking concurrent queue algorithms
PODC '96 Proceedings of the fifteenth annual ACM symposium on Principles of distributed computing
Online computation and competitive analysis
Online computation and competitive analysis
Synchronizing a database to improve freshness
SIGMOD '00 Proceedings of the 2000 ACM SIGMOD international conference on Management of data
The concurrency hierarchy, and algorithms for unbounded concurrency
Proceedings of the twentieth annual ACM symposium on Principles of distributed computing
A Pragmatic Implementation of Non-blocking Linked-Lists
DISC '01 Proceedings of the 15th International Conference on Distributed Computing
Update propagation strategies to improve freshness in lazy master replicated databases
The VLDB Journal — The International Journal on Very Large Data Bases
Engineering and hosting adaptive freshness-sensitive web applications on data centers
WWW '03 Proceedings of the 12th international conference on World Wide Web
A scalable lock-free stack algorithm
Proceedings of the sixteenth annual ACM symposium on Parallelism in algorithms and architectures
Managing Deadline Miss Ratio and Sensor Data Freshness in Real-Time Databases
IEEE Transactions on Knowledge and Data Engineering
Exploring the tradeoff between performance and data freshness in database-driven Web servers
The VLDB Journal — The International Journal on Very Large Data Bases
Measuring cache freshness by additive age
ACM SIGOPS Operating Systems Review
Objects shared by Byzantine processes
Distributed Computing
Hi-index | 0.00 |
Wait-free concurrent data objects are widely used in multiprocessor systems and real-time systems. Their popularity results from the fact that they avoid locking and that concurrent operations on such data objects are guaranteed to finish in a bounded number of steps regardless of the other operations interference. The data objects allow high access parallelism and guarantee correctness of the concurrent access with respect to its semantics. In such a highly-concurrent environment, where many wait-free write-operations updating the object state can overlap a single read-operation, the age/freshness of the state returned by this read-operation is a significant measure of the object quality, especially for real-time systems. In this paper, we first propose a freshness measure for wait-free concurrent data objects. Subsequently, we model the freshness problem as an online problem and present two algorithms for it. The first one is a deterministic algorithm with asymptotically optimal competitive ratio $\sqrt{\alpha}$, where α is a function of the execution-time upper-bound of wait-free operations. The second one is a competitive randomized algorithm with competitive ratio $\frac{\ln \alpha}{1 + \ln 2 -- \frac{2}{\sqrt{\alpha}}}$.