Cache management protocols based on re-ordering for distributed systems

Authors:
SungHo Cho;Kyoung Yul Bae
Affiliations:
Dept. of Information Science & Telecommunication, Hanshin University, Korea;Division of Computer Software, SangMyung University, Korea
Venue:
ICCSA'05 Proceedings of the 2005 international conference on Computational Science and its Applications - Volume Part I
Year:
2005

Citing 9
Cited 0

Data caching tradeoffs in client-server DBMS architectures

SIGMOD '91 Proceedings of the 1991 ACM SIGMOD international conference on Management of data
Efficient optimistic concurrency control using loosely synchronized clocks

SIGMOD '95 Proceedings of the 1995 ACM SIGMOD international conference on Management of data
Bit-sequences: an adaptive cache invalidation method in mobile client/server environments

Mobile Networks and Applications
Characterizing reference locality in the WWW

DIS '96 Proceedings of the fourth international conference on on Parallel and distributed information systems
Multiversion Data Broadcast

IEEE Transactions on Computers
Mobile Computing and Databases-A Survey

IEEE Transactions on Knowledge and Data Engineering
Quantifying Complexity and Performance Gains of Distributed Caching in a Wireless Mobile Computing Environment

ICDE '97 Proceedings of the Thirteenth International Conference on Data Engineering
Relaxed Index Consistency for a Client-Server Database

ICDE '96 Proceedings of the Twelfth International Conference on Data Engineering
Local Disk Caching for Client-Server Database Systems

VLDB '93 Proceedings of the 19th International Conference on Very Large Data Bases

Quantified Score

Hi-index	0.00

Visualization

Abstract

Database systems have used a client-server computing model to support shared data in distributed systems such as Web systems. To reduce server bottlenecks, each client may have its own cache for later reuse. This paper suggests an efficient cache consistency protocol based on a optimistic approach. The main characteristic of our scheme is that some transactions that read stale data items can not be aborted, because it adopts a re-ordering mechanism to enhance the performance. This paper presents a simulation-based analysis on the performance of our scheme with other well-known protocols. The analysis was executed under the Zipf workload which represents the popularity distribution on the Web. The simulation experiments show that our scheme performs as well as or better than other schemes with low overhead.