|
ABSTRACT
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.
REFERENCES
Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.
 |
1
|
|
| |
2
|
Chang, Youan. Personal communication. Forthcoming in a paper
|
| |
3
|
Jefferson, D.R. and Motro, A. The Time Warp Concurrency Control Mechanism For Distributed Databases. Department of Computer Science, University of Southern California, Los Angeles, California, 90089-0782, June, 1983.
|
| |
4
|
Jefferson, D.R. and Sowizral, H. Fast Concurrent Simulation Using Time Warp Mechanism, Part1: Local Control. Rand Corporation, Santa Monica, Cal., 1982.
|
| |
5
|
|
 |
6
|
|
| |
7
|
Ross, S.M., Introduction to Probability Models. Academic Press, Inc., 1972.
|
 |
8
|
|
|