The KIPS Transactions:PartA (정보처리학회논문지A)

Korea Information Processing Society (한국정보처리학회)
권호 표지
DOI QR코드

DOI QR Code

Comparison Analysis of Concurrency Control Algorithms by using Selection Models

선택모델을 이용한 동시성제어 알고리즘 비교 분석

  • 양기철 (목포대학교 정보공학부)
  • Published : 2003.06.01
Download PDF
⟨ Previous Next ⟩

Abstract

Comparison criteria and a selection model for concurrency control algorithms has been presented in this article. In addition, a comparison analysis has been performed with the developed comparison model. The result of the analysis can be utilized to select the best fitting concurrency control algorithm to the user's existing system environment.

본 논문에서는 여러 가지 동시성제어 알고리즘들의 비교기준을 설정하는데 어떠한 항목들이 필요한지 알아보고 선택모델을 작성한다. 또한 작성된 선택모델을 이용하여 동시성제어 알고리즘들을 비교 분석한다. 분석 결과는 동시성제어 알고리즘이 필요한 시스템 개발시 사용자 환경에 맞는 최선의 알고리즘을 선택 할 수 있도록 하는데 크게 기여할 것이다.

Keywords

References

  1. Berstein, P., V. Hadzilacos & N. Goodman, Concurrency Control and Recovery in Database Systems, Addison Wesley, 1987
  2. Irani, K.B., Lin, H., 'Queuing Network Models for Concurrent Transaction Processing in a Database System,' ACM-SIGMOD, pp.134-142, May, 1979 https://doi.org/10.1145/582095.582116
  3. Kumar, Place and Yang, An Efficient Algorithm for Mutual Exclusion Using Queue Migration in Computer Networks, IEEE Trans. on Knowledge and Data Engineering, Vol.3, No.3, September, 1991 https://doi.org/10.1109/69.91048
  4. Lamport, L., Time Clocks and the Ordering of Events in a Distributed System, CACM, 21, 7, July, 1978 https://doi.org/10.1145/359545.359563
  5. Lin, W.K. and Nolte, J., 'Read only Transactions and Two-Phase Locking,' Proc. of 2nd Symposium on Reliability in Distributed Software and Database Systems, Pittsburgh, pp.85-93, July, 1982
  6. Lin, W.K. and Nolte, J., 'Basic Timestamp, Multiple Version Timestamp, and Tow-Phase Locking,' 9th Int. Conf. on VLDB, Florence, Italy, pp.109-119, October, 1983
  7. Luk, W. and Wong, T., Two New Quorum Based Algorithms for Distributed Mutual Exclusion, 17th international conference on Distributed Computing Systems, Boltimore, 1997 https://doi.org/10.1109/ICDCS.1997.597862
  8. Maekawa, M., A SQRT(N) Algorithm for Mutual Exclusion in Decentralized Systems, ACM Trans. on Comp. Sys., 3, 2, May, 1995 https://doi.org/10.1145/214438.214445
  9. Munz, R. and Krenz, G., 'Concurrency in Database Systems - A Simulation Study,' Proc. INT. Conference on MOD., pp. 111-120, August, 1977 https://doi.org/10.1145/509404.509421
  10. Ricart, G. and Agrawala, A., An Optimal Algorithm for Mutual Exclusion in Computer Networks, CACM, 24, 1, January, 1981 https://doi.org/10.1145/358527.358537
  11. Rise, D.R. and Stonebraker, M., 'Effect of Granularity in a Database Management System,' ACM TODS, Vol.2, No.3, pp.233-246, September, 1977 https://doi.org/10.1145/320557.320566
  12. Rise, D.R. and Stonebreaker, M., 'Locking Granularity Revisited,' ACM Trans on Database Systems, Vol.4, No.2, pp.210-227, June, 1979 https://doi.org/10.1145/320071.320078
  13. Suzuki, I. and Kasami, T., A Distributed Mutual Exclusion Algorithm, ACM Trans. on Comp. Sys. 3, 4, November, 1985 https://doi.org/10.1145/6110.214406
  14. Raymond, K., A Tree-Based Algorithm for Distributed Mutual Exclusion, ACM Trans. on Comp. Sys. 7, 1, February, 1989 https://doi.org/10.1145/58564.59295
  15. Thomasian, A., 'An Iterative Solution to the Queuing Net-work Model of a DBMS with Dynamic Locking,' Proc. of the 1982 Computer Measurement Group, San Diago, pp. 252-261, 1982