한국정보과학회논문지:데이타베이스 (Journal of KIISE:Databases)

한국정보과학회 (Korean Institute of Information Scientists and Engineers)
권호 표지

재배열 기반의 낙관적 캐쉬 일관성 유지 기법의 모델링과 분석

Modeling and Analysis of a Reordering-based Optimistic Cache Consistency Protocol

  • 조성호 (천안대학교 정보통신학부) ;
  • 황정현 (미국 Brown Univ. Dept. of Computer Science)
  • 발행 : 2001.09.01
PDF 다운로드
⟨ 이전 논문 다음 논문 ⟩

초록

낙관적 2단계 잠금(O2PL)은 클라이언트 캐쉬를 적절히 사용하고 상대적으로 적은 네트워크 요구량으로 인하여 다른 기법보다 좋거나 같은 성능을 나타낸다. 그러나, 모든 잠금을 얻을 때까지 해당 트랜잭션이 완료될 수 없게 때문에 O2PL은 필요없는 기다림을 만든다. 또한, 낙관적 병행수행 제어(OCC) 기법은 필요없는 철회를 만든다. 본 논문은 이러한 단점들을 완화시킬 수 있는 효율적인 낙관적 캐쉬 일관성 유지 기법을 제안한다. 제안하는 기법은 트 랜잭션의 완료나 철회를 기다림 없이 결정하며 철회율을 최소화하기 위하여 트랜잭션 재배 열을 사용한다. 제안하는 기법은재배열 기법을 사용함에도 불구하고 각 데이터 당 하나의 버전만을 필요로 한다. 마지막으로, 본 논문은 정량적 평가결과를 통하여 제안하는 기법이 O2PL과 OCC 보다 좋은 성능을 나타낸다는 것을 보인다.

Optimistic Two-Phase Locking(O2PL) performs as well as or better than the other approaches because it exploits client caching well and also has relatively lower network bandwidth requirements. However, O2PL leads to unnecessary waits, because, it can not be commit a transaction until the transaction obtains all requested locks. In addition, Optimistic Concurrency Control(OCC) tends to make needless aborts. This paper suggests an efficient optimistic cache consistency protocol that overcomes such shortcomings. Our scheme decides whether to commit or abort a transaction without wait and it adopts transaction re-ordering in order to minimize the abort rate. Our scheme needs only one version for each data item in spite of the re-ordering mechanism used. Finally, this paper presents a simulation-based analysis that shows superiority in performance of out scheme to O2PL and OCC.

키워드

참고문헌

  1. M. J. Carey, M. J. Franklin, M. Livny and E. Shekita, 'Data Caching Tradeoffs in Client-Server DBMS Architecture,' Proc. of the ACM SIGMOD International Conference on the Management of Data, May, 1991 https://doi.org/10.1145/115790.115854
  2. M. J. Franklin and M. J. Carey, 'Client-Server Caching Revisited,' Proc. of the International Work-shop on Distributed Object Management, August, 1992
  3. A. S. Tannenbaum, Distributed Operating Systems, Prentice Hall, 1995
  4. B. Liskov, M. Day and L. Shrira, 'Distributed Object Management in Thor,' Proc. of the International Workshop on Distributed Object Management, August, 1992 (Published as Distributed Object Management, Ozsu, Dayal, Valduriez, Morgan Kaufmann, 1994)
  5. B. Nitzberg and V. Lo, 'Distributed Shared Memory: A Survey of Issues and Algorithms,' IEEE Computer, 20(8), August, 1991 https://doi.org/10.1109/2.84877
  6. V. Gottemukkala, E. Omiecinski and U. Ramachandran, 'Relaxed Consistency for a Client-Server Database,' Proc. of International Conference on Data Engineering, February, 1996 https://doi.org/10.1109/ICDE.1996.492183
  7. M. J. Franklin, 'Caching and Memory Management in Client-Server Database Systems,' Ph.d. Thesis, Dept of Computer Science, University of Wisconsin, July, 1993
  8. A. J. Bernstein and P. M. Lewis, Concurrency in Programming and Database Systems, Jones and Bartlett Publishers, 1993
  9. P. A. Bernstein, V. Hadzilacos and N. Goodman, Concurrency Control and Recovery in Database Systems, Addison-Wesley, 1987
  10. Wilkinson, K. and Neimat, 'Maintaining consistency of client-cached data,' In Proc. of the Conf. on Very Large Data Bases (VLDB), pp. 122-134, 1990
  11. M. J. Carey, M. J. Franklin, M. Livny, and Shekita, 'Data caching tradeoffs in client-server DBMS architectures,' In Proc. of the ACM SIGMOD Conf. on Management of Data, pp. 357-366, 1991 https://doi.org/10.1145/115790.115854
  12. A. Adya, R. Gruber, B. Liskov, and U. Maheshwari, 'Efficient optimistic concurrency control using loosely synchronized clocks,' In Proc. of the ACM SIGMOD Conf. on Management of Data, pp. 23-34, 1995 https://doi.org/10.1145/568271.223787
  13. Y. Wang and Rowe, 'Cache consistency and concurrency control in a client-server DBMS architecture,' In Proc. of the ACM SIGMOD Conf. on Management of Data, pp. 367-377, 1991 https://doi.org/10.1145/115790.115855
  14. M. J. Franklin, M. J. Carey, and M. Livny, 'Local disk caching in client-server database systems,' In Proc. of the Conf. on Very Large Data Bases (VLDB), pp. 543-554, 1993
  15. P. S. Yu, H. Heiss, and D. M. Dias, 'Modeling and Analysis of a Time-Stamp Histroy Based Certification Protocol for Concurrency Control,' IEEE Transactions on Knowledge and Data Engineering, vol. 3. no. 4, pp. 525-537, Dec. 1991 https://doi.org/10.1109/69.109112
  16. S. Cho, K. Y. Bae and C. Hwang, 'A Certification Protocol with Low Space Overhead,' International Conference on Parallel and Distributed Systems, pp. 67-74, 1998 https://doi.org/10.1109/ICPADS.1998.741021
  17. International Conference on Parallel and Distributed Systems A Certification Protocol with Low Space Overhead S.Cho;K.Y.Bse;C.Hwang