Data caching tradeoffs in client-server DBMS architectures
SIGMOD '91 Proceedings of the 1991 ACM SIGMOD international conference on Management of data
Cache consistency and concurrency control in a client/server DBMS architecture
SIGMOD '91 Proceedings of the 1991 ACM SIGMOD international conference on Management of data
ACM Transactions on Database Systems (TODS)
ACM Transactions on Database Systems (TODS)
IEEE Transactions on Computers
ACM Transactions on Database Systems (TODS)
Cluster architectures and S/390 Parallel Sysplex scalability
IBM Systems Journal
Processing Distributed Mobile Queries with Interleaved Remote Mobile Joins
IEEE Transactions on Computers
Optimal Design of Multiple Hash Tables for Concurrency Control
IEEE Transactions on Knowledge and Data Engineering
Optimizing Index Allocation for Sequential Data Broadcasting in Wireless Mobile Computing
IEEE Transactions on Knowledge and Data Engineering
Analysis of Distributed Database Access Histories for Buffer Allocation
WISE '00 Proceedings of the First International Conference on Web Information Systems Engineering (WISE'00)-Volume 2 - Volume 2
IEEE Transactions on Mobile Computing
Query Processing in a Mobile Computing Environment: Exploiting the Features of Asymmetry
IEEE Transactions on Knowledge and Data Engineering
| Hi-index | 0.00 |
In this paper, we conduct a performance study of coupling multiple systems with a global buffer, and present several results obtained from a multiple-system simulator. This simulator has been run against three workloads, and the coupled system behavior with these three different inputs is studied. Several statistics, including those on local and global buffer hits, page writes to the global buffer, cross-invalidations, and castouts are reported. Their relationship to the degree of data skew is explored. Moreover, in addition to the update-caching approach, a design alternative for the use of a global buffer, namely read-caching, is explored. In read-caching, not only updated pages but also pages read by each node are kept in the global buffer, thereby facilitating other nodes' access to the same pages at the cost of a higher global buffer usage. Also investigated is the case of no-caching, i.e., without using a global buffer. Several simulation results are presented and analyzed.