Abstract
The diversity of available concurrency control algorithms in database systems necessitates the development of quantitative methods for evaluating their performance. This paper proposes an analytical model to analyze the performance of Time-stamp Ordering algorithms. In particular, Time-stamp Ordering employing blocking and restarts, both with and without Thomas Write Rule. The modeling approach is promising since it has the potential of providing useful insights to DBMS designers and at the same time very inexpensive to use. Moreover, the results obtained are extensive and closely track those of simulation.
Preview
Unable to display preview. Download preview PDF.
References
R. Agrawal, M. Carey, and M. Livny, “Concurrency control performance modeling: alternatives and implications,” ACM TODS, vol. 12, no. 4, pp. 609–654, Dec. 1987.
P. Bernstein and N. Goodman, “Concurrency control in distributed database systems,” ACM Computing Surveys, vol. 13, no. 2, pp. 185–222, June 1981.
P. Bernstein, N. Goodman and V. Hadzilacos, Concurrency control and recovery in database systems, Addison Wesley Pub., 1987.
A. Chesnais, E. Gelenbe and I. Mitrani, “On the modeling of parallel access to shared data,” Comm. ACM, vol. 26, no 3, pp. 196–202, Mar. 1983.
M. El-Toweissy, A unified approach for performance evaluation of concurrency control algorithms in database systems, M.Sc. thesis, Computer Sc. Dept., Fac. of Eng., Alexandria Univ., Egypt, July 1989.
M. El-Toweissy, M. Abougabal, N. El-Makky and H. Abdel-Wahab, “Performance evaluation of time-stamp ordering concurrency control algorithms in database systems: the pure restarts case,” Technical Report, TR-90-40, Old Dominion University, Sept. 1990.
P. Franaszek and J. Robinson, “Limitations of concurrency in transaction processing,” ACM TODS, vol. 10, no. 1, pp. 1–28, Mar. 1985.
B. Galler, Concurrency control performance issues, Ph.D. dissertation, Computer Science Dept., Univ. of Toronto, Ontario, Sept. 1982.
M. Hsu and B. Zhang, “The mean value approach to performance evaluation of cautious waiting,” Technical Report TR-05-88, Harvard Univ., Aug. 1987.
L. Kleinrock, Queuing systems, vol. 2, Wiley Interscience Pub., New York, 1976.
H. Kobayashi, Modeling and analysis: An introduction to system performance evaluation methodology, Addison Wesley pub., 1978.
W. Lin and J. Nolte, “Basic time-stamp, Multiple version time-stamp and two-phase locking,” Proc. 9th Int. Conf. on Very Large Databases, pp. 109–119, Oct. 1983.
D. Menasce and T. Nakanishi, “Optimistic versus pessimistic concurrency control mechanisms in database management systems,” Inform. Sys., vol. 7, no. 1, pp. 13–27, 1982.
C. Orji, L. Lilien and J. Hyziak, “A performance analysis of an optimistic and a basic time-stamp ordering concurrency control algorithm for centralized database systems,” Proc. 4th Int. Conf. on Data Eng., pp. 64–73, Feb. 1988.
K. Sevick, “Comparison of concurrency control methods using analytic models,” Proc. of the IFIP, North Holand, pp.298–307, 1983.
A. Shum and P. Spirakis, “Performance analysis of concurrency control methods in database systems,” Performance '81, North Holand, pp.1–19, 1981.
Y.C. Tay, R. Suri and N. Goodman, “A mean value performance model for locking in databases: The no-waiting case,” J. ACM, vol. 32, no. 3, pp. 618–651, July 1985.
Y.C. Tay, R. Suri and N. Goodman, “Locking performance in centralized databases,” ACM TODS, vol. 10, no. 4, pp. 415–462, Dec. 1985.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1991 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
El-Toweissy, M., El-Makky, N., Abougabal, M., Fouad, S. (1991). The mean value approach to performance evaluation of time-stamp ordering algorithms. In: Dehne, F., Fiala, F., Koczkodaj, W.W. (eds) Advances in Computing and Information — ICCI '91. ICCI 1991. Lecture Notes in Computer Science, vol 497. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-54029-6_176
Download citation
DOI: https://doi.org/10.1007/3-540-54029-6_176
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-54029-8
Online ISBN: 978-3-540-47359-6
eBook Packages: Springer Book Archive