2004•NCSU Libraries Repository (North Carolina State University Libraries)Open access

Cache Invalidation and Propagation of Updates in Distributed Caching.

Pooja Kohli

Open full text 0 citations

Abstract

Replication and caching strategies are increasingly being used to improve performance and reduce user perceived delays in distributed environments. A query can be answered much faster by accessing a cached copy than by making a database roundtrip. This setting creates a number of important issues such as maintaining consistency among copies of the same data item. Numerous techniques have been proposed to achieve caching and replication while maintaining consistency among the replicas. A closer investigation of these schemes reveals that no one scheme can be optimal for all environments. In this thesis we look at invalidation protocols for achieving consistency in systems that use distributed caching. We propose heuristics for dynamic adaptation of these protocols for cache consistency. These heuristics aim at propagating invalidations while reducing the cost of data transfer.

Open-access reader

About this research paper

What this paper is about

Replication and caching strategies are increasingly being used to improve performance and reduce user perceived delays in distributed environments. A query can be answered much faster by accessing a cached copy than by making a database roundtrip. This setting creates a number of important issues such as maintaining consistency among copies of the same data item. Numerous techniques have been proposed to achieve caching and replication while maintaining consistency among the replicas. A closer investigation of these schemes reveals that no one scheme can be optimal for all environments. In this thesis we look at invalidation protocols for achieving consistency in systems that use distributed caching. We propose heuristics for dynamic adaptation of these protocols for cache consistency. These heuristics aim at propagating invalidations while reducing the cost of data transfer.

Why it matters

A significance statement is not available in the OpenAlex record.

Key contribution

A contribution statement is not available in the OpenAlex record.

Method / approach

Method details are not available in the OpenAlex metadata.

Main findings

Findings are not separately available in the OpenAlex metadata.

Limitations

Limitations are not available in the OpenAlex metadata.

Applications

Application details are not available in the OpenAlex metadata.

Available abstract

Replication and caching strategies are increasingly being used to improve performance and reduce user perceived delays in distributed environments. A query can be answered much faster by accessing a cached copy than by making a database roundtrip. This setting creates a number of important issues such as maintaining consistency among copies of the same data item. Numerous techniques have been proposed to achieve caching and replication while maintaining consistency among the replicas. A closer investigation of these schemes reveals that no one scheme can be optimal for all environments. In this thesis we look at invalidation protocols for achieving consistency in systems that use distributed caching. We propose heuristics for dynamic adaptation of these protocols for cache consistency. These heuristics aim at propagating invalidations while reducing the cost of data transfer.

Key concepts: Computer science, Cache, Smart Cache, Cache invalidation, Parallel computing, Distributed computing, Computer network, Cache algorithms

Related papers

Back to paper searchBrowse research topicsOriginal source
Cache Invalidation and Propagation of Updates in Distributed Caching. — Research Paper | ScholarLens