Advertisement

Evaluating the DSMIO Cache-Coherence Algorithm in Cluster-Based Parallel ODBMS

  • Carla Osthoff
  • Cristiana Bentes
  • Daniel Ariosto
  • Marta Mattoso
  • Claudio L. Amorim
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 2425)

Abstract

In this paper, we assess the performance of DSMIO cachecoherence algorithm implemented in a parallel object-based database management system (ODBMS). The distinguishing feature of DSMIO is its use of the lazy release memory consistency model and multiplewriter protocol to reduce both the number and size of coherence messages required to keep coherent a distributed ODBMS across a cluster of PC servers. Using a large distributed database and several application workloads we evaluate DSMIO performance and also compare it against that of the well-known Call-Back Locking (CBL) algorithm. Our results showt hat both algorithms perform very well for read operations whereas DSMIO outperforms signi.cantly CBL for write operations with DSMIO speed-ups attaining as much as 5.4 while CBL speed-ups reach at most 1.4 for an 8-node cluster. Overall, these results suggest that designers of cluster-based ODBMS should consider DSMIO as an e.cient option for developing future projects in the field.

Keywords

Server Node Cache Coherence Distribute Shared Memory Client Cache False Sharing 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. [1]
    S. V. Adve and K. Gharachorloo. SharedMemory Consistency Models: A Tutorial. IEEE Computer, December 1996. 286Google Scholar
  2. [2]
    Y. Breibart, R. Komondoor, R. Rastogi, S. Seshdri. Update Propagation Protocols for Replicated Databases. In Bell Labs Technichal Reports.Google Scholar
  3. [3]
    R. Cattell The Object Database Standard: ODMG-3.0 In Morgan Kaufmann Publisher, 2000. 292Google Scholar
  4. [4]
    C. Ostho., C. Bentes, R. Bianchini, M. Mattoso, C. Amorim. Evaluating Cache Coherence in the DSMIO System. In Proceedings of the 12th Symposium on Computer Architecture and High Performance Computing, Sao Pedro, Brazil, 2000. 287, 290, 296Google Scholar
  5. [5]
    M. J. Carey, M. J. Franklin, and M. Zaharioudakis. Fine-Grained Sharing in a Page Server OODBMS. In Proceedings ACM SIGMOD Conference, 1990. 288Google Scholar
  6. [6]
    M. J. Carey, D. J. DeWitt, and J. F. Naughton. The 007 Benchmark. In Proceedings of the ACM SIGMOD International Conference on Management of Data, pp.12–21, 1993. 287, 288, 292Google Scholar
  7. [7]
    M. J. Franklin and M. J. Carey. Client-Server Caching Revisited. In Technical Report 1089, Computer Science Department, University of Wisconsin-Madison, May 1992. 291Google Scholar
  8. [8]
    M. J. Franklin, M. J. Carey, and M. Livny. Transactional Client-Server Cache Consistency: Alternatives and Performance. In ACM Transactions On DataBase Systems, Sept. 1997. 286Google Scholar
  9. [9]
  10. [10]
    B. Kemme, G. Alonso. Don’t be lazy, be consistent: Postgres-R, a new way to implement Database Replication. In Proceedings of th 26th VLDB Conference, Cairo, Egypt,2000.Google Scholar
  11. [11]
    P. Keleher, A. L. Cox, and W. Zwaenepoel. Lazy Release Consistency for Software Distributed Shared Memory. In Proceedings of the 19th International Symposium on Computer Architecture, May 1992. 289Google Scholar
  12. [12]
    P. Keleher, S. Dwarkadas, A. L. Cox, and W. Zwaenepoel. Treadmarks: Distributed Shared Memory on Standard Workstations and Operating Systems. In Proceedings of the 1994 Winter USENIX Conference, January 1994. 289Google Scholar
  13. [14]
    C. Morin and I. Puaut. A Survey of Recoverable Distributed Shared Virtual Memory Systems. In IEEE Transactions on Parallel and Distributed Systems, sept.1997. 296Google Scholar
  14. [15]
    T. Parker, and A. Cox I/O-Oriented Applications on a Software Distributed-Shared Memory System. Master of Science Thesis-Computer Science Dept-Rice university, 1999. 289Google Scholar
  15. [16]
    D. Scales, K. Gharachorloo and C. Thekkath. Shasta: A lowo verhead,softwareonly approach for supporting fine-grain shared memory. In Technical Report 96/2, Western Research Laboratory, Compaq Corporation,1996. 289Google Scholar
  16. [17]
    M. Ozsu, K. Voruganti, and R. Unrau. An Asynchronous Avoidance-Based Cache Consistency Algorithm for Client Caching DBMSs. In Proceedings of the 24th Very Large DataBases Conference, 1998. 288Google Scholar
  17. [18]
    K. Voruganti, M. Ozsu, and R. Unrau. An Adaptative Hybrid Server Architecture for Client-Caching Object DBMS. In Proceedings of the 25th Very Large DataBases Conference, 1999. 288Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2002

Authors and Affiliations

  • Carla Osthoff
    • 1
  • Cristiana Bentes
    • 2
  • Daniel Ariosto
    • 3
  • Marta Mattoso
    • 3
  • Claudio L. Amorim
    • 3
  1. 1.Computer Science DepartmentLNCCBrazil
  2. 2.Systems Engineering DepartmentUERJBrazil
  3. 3.Computer Science DepartmentCOPPE/UFRJBrazil

Personalised recommendations