Skip to content
Free planNo credit card requiredStart writing
AI for Research home
AI for Research home
Dashboard
Sign inGet started

Search 250 million research papers

Read the abstract, see who wrote it and who cites it, and get the citation in APA, MLA, Chicago or Harvard.

About 446 papers for “Cache invalidation”

Energy-Efficient Mobile Cache Invalidation

Kun-lung Wu, Philip S. Yu, Ming-syan Chen · 1998

Caching data in a wireless mobile computer can significantly reduce the bandwidth requirement. However, due to battery power limitation, a wireless mobile computer may often be forced to operate in a doze or even totally disconnected mode. As a result, the mobile computer may miss some cache invalidation reports. In this paper, we present an energy-efficient cache invalidation method for a wireless mobile computer. The new cache invalidation scheme is called grouping with cold update-set retention (GCORE). Upon waking up, a mobile computer checks its cache validity with the server. To reduce the bandwidth requirement for validity-checking, data objects are partitioned into groups. However, instead of simply invalidating a group if any of the objects in the group has been updated, GCORE retains the cold update set of objects in a group if possible. We present an efficient implementation of GCORE and conduct simulations to evaluate its caching effectiveness. The results show that GCORE can subs...

Cited by 0

Cache Invalidation in a Mobile Environment

S. Lim · IGI Global eBooks · 2011

In this article, we describe the use of caching that allows coping with the characteristics of the mobile environment. We concentrate particularly on cache invalidation strategy, which is basically a type of caching strategy that is used to ensure that the data items that are cached in the mobile client are consistent in comparison to the ones that are stored on the server.Request access from your librarian to read this chapter's full text.

Cited by 0Open access

Adaptive cache invalidation methods in mobile environments

Qinglong Hu, Dik Lun Lee · 2002

Caching of frequently accessed data items can reduce the bandwidth requirement in a mobile wireless computing environment. Periodically broadcast of invalidation reports is an efficient cache invalidation strategy. However, this strategy is severely affected by the disconnection and mobility of the clients. In this paper, we present two adaptive cache invalidation report methods, in which the server broadcasts different invalidation reports according to the update and query rates/patterns and client disconnection time while spending little uplink cost. Simulation results show that the adaptive invalidation methods are efficient in improving mobile caching and reducing the uplink and downlink costs without degrading the system throughput.

Cited by 34

Analysis of cache invalidation patterns in multiprocessors

W.-D. Weber, Aman Gupta · 1989

To make shared-memory multiprocessors scalable, researchers are now exploring cache coherence protocols that do not rely on broadcast, but instead send invalidation messages to individual caches that contain stale data. The feasibility of such directory-based protocols is highly sensitive to the cache invalidation patterns that parallel programs exhibit. In this paper, we analyze the cache invalidation patterns caused by several parallel applications and investigate the effect of these patterns on a directory-based protocol. Our results are based on multiprocessor traces with 4, 8 and 16 processors. To gain insight into what the invalidation patterns would look like beyond 16 processors, we propose a classification scheme for data objects found in parallel applications and link the invalidation traffic patterns observed in the traces back to these high-level objects. Our results show that synchronization objects have very different invalidation patterns from those of other data objects. A write reference to a synchronization object usually causes invalidations in many more caches. We point out situations where restructuring the application seems appropriate to reduce the invalidation traffic, and others where hardware support is more appropriate. Our results also show that it should be possible to scale “well-written” parallel programs to a large number of processors without an explosion in invalidation traffic.

Cited by 122

Dynamic cache invalidation technique in mobile environments

Rajeev Tiwari, Neeraj Kumar · 2015

Due to exponential requests of users for accessing Internet wireless services, longer delays can incur in full filling requests. So optimizations for delay is required. One such method is using cache and storing frequently accessed pages in local cache. Consistency in cache and server data becomes a major issue. As if cache is not valid then whole optimization will be lost. Many researches have strong consistency mechanism which incurs longer delays in query responses. In this paper, we explored some of vital cache invalidation techniques for mobile devices. Focused on advantages and disadvantages of each technique and then found few important parameters for their performance comparison like state full, stateless, IR based, Time-stamp based or not, congestion, query delay and Round Trip Time(RTT) etc. Then we conceptually evaluated the performance of cache invalidation schemes which indicates that the schemes with smaller and dynamic IRs can remarkably reduce the query delay and can utilize the bandwidth more efficiently.

Cited by 1

Analysis of cache invalidation patterns in multiprocessors

W.-D. Weber, Aman Gupta · ACM SIGARCH Computer Architecture News · 1989

To make shared-memory multiprocessors scalable, researchers are now exploring cache coherence protocols that do not rely on broadcast, but instead send invalidation messages to individual caches that contain stale data. The feasibility of such directory-based protocols is highly sensitive to the cache invalidation patterns that parallel programs exhibit. In this paper, we analyze the cache invalidation patterns caused by several parallel applications and investigate the effect of these patterns on a directory-based protocol. Our results are based on multiprocessor traces with 4, 8 and 16 processors. To gain insight into what the invalidation patterns would look like beyond 16 processors, we propose a classification scheme for data objects found in parallel applications and link the invalidation traffic patterns observed in the traces back to these high-level objects. Our results show that synchronization objects have very different invalidation patterns from those of other data objects. A write reference to a synchronization object usually causes invalidations in many more caches. We point out situations where restructuring the application seems appropriate to reduce the invalidation traffic, and others where hardware support is more appropriate. Our results also show that it should be possible to scale “well-written” parallel programs to a large number of processors without an explosion in invalidation traffic.

Cited by 144Open access

Timestamp-based cache invalidation for search engines

Şadiye Alıcı, İsmail Sengör Altıngövde, Rifat Ozcan et al. · OpenMETU (Middle East Technical University) · 2011

We propose a new mechanism to predict stale queries in the result cache of a search engine. The novelty of our approach is in the use of timestamps in staleness predictions. We show that our approach incurs very little overhead on the system while its prediction accuracy is comparable to earlier works.

Cited by 2Open access

Cache invalidation and propagation in distributed caching

Pooja Kohli, Rada Chirkova · NCSU Libraries Repository (North Carolina State University Libraries) · 2005

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 study 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.

Cited by 5Open access

Hybrid Cache Invalidation Schemes in Mobile Environments

Yuliang Bao, R. Alhajj, K. Barker · 2005

To make cached data consistent, the server periodically broadcasts an invalidation report to all mobile clients in its cell so that each can invalidate obsolete data items from its local cache. We present two hybrid cache invalidation schemes: Hybrid cache invalidation with simple broadcasting (HSB), and hybrid cache invalidation with attribute bit sequence broadcasting (HABSB). In these schemes the server is stateful as it stores the caching information of each mobile client in its cell to allow for long disconnections. However, the server periodically broadcasts an invalidation report similar to a stateless server. In HABSB, attribute bit sequences are added in each broadcasted invalidation report to maximize the cache-hit ratio and to reduce the data transmission of queried data items. The simulation results show that HSB and HABSB can significantly reduce the bandwidth requirement, and HABSB is very efficient in improving mobile caching.

Cited by 0

Cache invalidation for data dependent web content rendering

Radwan, Raja · CSUN ScholarWorks (California State University, Northridge) · 2017

Fast, efficient, and reliable rendering of web content requires a carefully designed system capable of managing the relationship of dependencies between various web pages using shared content.This project examines the considerations and challenges associated with the design and implementation of a solution for cache invalidation in a databasedriven, static web content rendering system.The goal is to present a preferred implementation for cache invalidation in such systems through the examination and analysis of two proposed solutions utilizing field-level and page-level dependencies, respectively.The analysis of the results will establish why the field-level implementation is the optimal solution despite some shortcomings.

Cited by 0Open access