Topic
Cache invalidation
About: Cache invalidation is a research topic. Over the lifetime, 10539 publications have been published within this topic receiving 245409 citations.
Papers published on a yearly basis
Papers
More filters
•
27 Jun 2000TL;DR: An active cache as mentioned in this paper is an OAP system that can not only answer queries that match data stored in the cache, but can also handle queries that require aggregation or other computation of the stored data.
Abstract: An “active cache”, for use by On-Line Analytic Processing (OLAP) systems, that can not only answer queries that match data stored in the cache, but can also answer queries that require aggregation or other computation of the data stored in the cache.
76 citations
•
15 Feb 2002
TL;DR: In this paper, the authors propose an approach to improve the scalability of application servers and database servers in Web systems, thereby providing higher cost-performance Web systems. But, their approach requires the application state of an application to be stored in a clustered cache database as required.
Abstract: The present invention improves the scalability of application servers and database servers in Web systems, thereby providing higher cost-performance Web systems. The session state of an application is stored in a clustered cache database as required. This enables another application running on an arbitrary cluster server to read the stored session state from the clustered cache database to continue the processing of the application. In addition, a cache database cluster in which data can be updated on the cluster servers is configured, thereby providing a mechanism of causing them to synchronize with the database servers as necessary. Furthermore, a mechanism of adding cache databases to the cache database cluster, thereby enabling the system to respond to an increase in database access load.
76 citations
••
IBM1
TL;DR: It is shown that a multithreaded cache oblivious matrix multiplication incurs cache misses when executed by the Cilk work-stealing scheduler on a machine with P processors, each with a cache of size Z, with high probability.
Abstract: We present a technique for analyzing the number of cache misses incurred by multithreaded cache oblivious algorithms on an idealized parallel machine in which each processor has a private cache. We specialize this technique to computations executed by the Cilk work-stealing scheduler on a machine with dag-consistent shared memory. We show that a multithreaded cache oblivious matrix multiplication incurs cache misses when executed by the Cilk scheduler on a machine with P processors, each with a cache of size Z, with high probability. This bound is tighter than previously published bounds. We also present a new multithreaded cache oblivious algorithm for 1D stencil computations incurring cache misses with high probability, one for Gaussian elimination and back substitution, and one for the length computation part of the longest common subsequence problem incurring cache misses with high probability.
76 citations
••
14 Apr 2013TL;DR: In this paper, the authors proposed a distributed and uncoordinated off-path caching architecture to overcome the problem of uncooperative caches in information-centric networks (ICN).
Abstract: Information-centric network (ICN), which is one of the prominent Internet re-design architectures, relies on in-network caching for its fundamental operation. However, previous works argue that the performance of in-network caching is highly degraded with the current cache-along-default-path design, which makes popular objects to be cached redundantly in many places. Thus, it would be beneficial to have a distributed and uncoordinated design. Although cooperative caches could be an answer to this, previous research showed that they are generally unfeasible due to excessive signaling burden, protocol complexity, and a need for fault tolerance. In this work we illustrate the ICN caching problem, and propose a novel architecture to overcome the problem of uncooperative caches. Our design possesses the cooperation property intrinsically. We utilize controlled off-path caching to achieve almost 9-fold increase in cache efficiency, and around 20% increase in server load reduction when compared to the classic on-path caching used in ICN proposals.
76 citations
•
31 Mar 2015TL;DR: A multi-level cache comprises a plurality of cache levels, each configured to cache I/O request data pertaining to requests of a different respective type and/or granularity.
Abstract: A multi-level cache comprises a plurality of cache levels, each configured to cache I/O request data pertaining to I/O requests of a different respective type and/or granularity. The multi-level cache may comprise a file-level cache that is configured to cache I/O request data at a file-level of granularity. A file-level cache policy may comprise file selection criteria to distinguish cacheable files from non-cacheable files. The file-level cache may monitor I/O requests within a storage stage, and may service I/O requests from a cache device.
76 citations