Stochastic processes
Concurrency Control in Distributed Database Systems
ACM Computing Surveys (CSUR)
Implementing atomic actions on decentralized data
ACM Transactions on Computer Systems (TOCS)
A multi-version concurrency scheme with no rollbacks
PODC '82 Proceedings of the first ACM SIGACT-SIGOPS symposium on Principles of distributed computing
ACM Transactions on Programming Languages and Systems (TOPLAS)
Virtual time II: storage management in conservative and optimistic systems
PODC '90 Proceedings of the ninth annual ACM symposium on Principles of distributed computing
Performance analysis of Time Warp with homogeneous processors and exponential task times
SIGMETRICS '91 Proceedings of the 1991 ACM SIGMETRICS conference on Measurement and modeling of computer systems
Performance analysis of “Time Warp” with limited memory
SIGMETRICS '92/PERFORMANCE '92 Proceedings of the 1992 ACM SIGMETRICS joint international conference on Measurement and modeling of computer systems
Performance Analysis of Time Warp with Multiple Homogeneous Processors
IEEE Transactions on Software Engineering
Clustering in stochastic asynchronous algorithms for distributed simulations
SAGA'05 Proceedings of the Third international conference on StochasticAlgorithms: foundations and applications
| Hi-index | 0.00 |
In this paper we introduce a new analytical approach to modeling the performance of systems synchronized by timestamp mechanisms, including database systems. We define the virtual time - real time (T-V) plane, and an important kind of stochastic process that we call linear Poisson processes. We show how to calculate the rate of preemption (corresponding to the rate of abortion or rollback in concurrency control mechanisms) and the waiting time until last preemption (corresponding to commit time) for linear Poisson processes. Finally, we apply this theory, analyzing one example system synchronized by the Time Warp mechanism.