|
| This Article | ||
| ||
| Share | ||
| Bibliographic References | ||
| Add to: | ||
 Digg  Furl  Spurl  Blink  Simpy  Google  Del.icio.us  Y!MyWeb | ||
| Search | ||
| ||
| ASCII Text | x | ||
| Y.-F. Huang, Y.-H. Chin, "A New Methodology to Evaluate Locking Protocols," IEEE Transactions on Knowledge and Data Engineering, vol. 2, no. 4, pp. 431-435, December, 1990. | |||
| BibTex | x | ||
| @article{ 10.1109/69.63255, author = {Y.-F. Huang and Y.-H. Chin}, title = {A New Methodology to Evaluate Locking Protocols}, journal ={IEEE Transactions on Knowledge and Data Engineering}, volume = {2}, number = {4}, issn = {1041-4347}, year = {1990}, pages = {431-435}, doi = {http://doi.ieeecomputersociety.org/10.1109/69.63255}, publisher = {IEEE Computer Society}, address = {Los Alamitos, CA, USA}, } | |||
| RefWorks Procite/RefMan/Endnote | x | ||
| TY - JOUR JO - IEEE Transactions on Knowledge and Data Engineering TI - A New Methodology to Evaluate Locking Protocols IS - 4 SN - 1041-4347 SP431 EP435 EPD - 431-435 A1 - Y.-F. Huang, A1 - Y.-H. Chin, PY - 1990 KW - average lock range; evaluation factor; locking-based concurrency control methods; nonstructural locking; queueing model; ALR; popular locking protocols; 2PL protocol; tree protocol; simulation; correctness; concurrency control; distributed databases; protocols; trees (mathematics) VL - 2 JA - IEEE Transactions on Knowledge and Data Engineering ER - | |||
The average lock range (ALR) is proposed as an evaluation factor for measuring the strengths and weaknesses of locking-based concurrency control methods, for both structural and nonstructural locking. The methodology provides a simple and general way to analyze the performance of any locking method, and requires no queueing model. Based on the concept of the ALR, two popular locking protocols, the 2PL protocol and the tree protocol, are analyzed and a simulation is done to validate the correctness of the ALR model.
[1] R. Agrawal, M. J. Carey, and M. Livny, "Models for studying concurrency control performance: Alternatives and implications,"ACM SIGMOD Int. Conf. Management of Data, 1985, pp. 108-121.
[2] K. P. Eswaran, J. N. Gray, R. A. Lorie, and I. L. Traiger, "The notions of consistency and predicate locks in a database system,"Commun. ACM, vol. 19, no. 11, pp. 624-633, Nov. 1976.
[3] Y. F. Huang and Y. H. Chin, "Performance evaluation of three locking protocols," inProc. Int. Conf. Performance '87, 1987, pp. 447-465.
[4] Y. F. Huang, "An ascending order locking protocol and its performance evaluation," Ph.D. dissertation, Institute of Computer Science, National Tsing Hua University, June 1988.
[5] Z. M. Kedem and A. Silberschatz, "Controlling concurrency using locking protocols," inProc. 20th IEEE Symp. FOCS, 1979, pp. 274-285.
[6] D. Mitra and P. J. Weinberger, "Probabilistic models of database locking: Solutions, computational algorithms and asymptotics,"J. ACM, vol. 31, no. 4, pp. 855-878, Oct. 1984.
[7] D. Potier and P. Leblanc, "Analysis of locking policies in database management systems,"Commun. ACM, vol. 23, no. 10, pp. 584- 593, Oct. 1980.
[8] D. Ries, "Effects of locking granularity in a database management system,"ACM Trans. Database Syst., Sept. 1977.
[9] D. R. Ries and M. R. Stonebraker, "Locking granularity revisited,"ACM Trans. Database Syst., June 1979.
[10] 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.