Data Access Type Aware Replacement Policy for Cache Clustering Organization of Chip Multiprocessors

2013 ◽  
pp. 254-268
Author(s):  
Chongmin Li ◽  
Dongsheng Wang ◽  
Haixia Wang ◽  
Guohong Li ◽  
Yibo Xue
Keyword(s):  
Chip Multiprocessors ◽  
Data Access ◽  
Replacement Policy

A Spatio-Temporal Cache Replacement Policy for Location Dependent Data in Mobile Environments

2010 ◽  
Vol 6 (3) ◽  
pp. 31-48 ◽  
Author(s):  
Mary Magdalene Jane.F ◽  
R. Nadarajan ◽  
Maytham Safar
Keyword(s):  
Data Access ◽  
Data Availability ◽  
Replacement Policy ◽  
Dependent Data ◽  
Access Time ◽  
Cache Replacement ◽  
Cache Replacement Policy ◽  
Active Sets ◽  
Mobile Clients ◽  
Spatio Temporal

Data caching in mobile clients is an important technique to enhance data availability and improve data access time. Due to cache size limitations, cache replacement policies are used to find a suitable subset of items for eviction from the cache. In this paper, the authors study the issues of cache replacement for location-dependent data under a geometric location model and propose a new cache replacement policy RAAR (Re-entry probability, Area of valid scope, Age, Rate of Access) by taking into account the spatial and temporal parameters. Mobile queries experience a popularity drift where the item loses its popularity after the user exhausts the corresponding service, thus calling for a scenario in which once popular documents quickly become cold (small active sets). The experimental evaluations using synthetic datasets for regular and small active sets show that this replacement policy is effective in improving the system performance in terms of the cache hit ratio of mobile clients.

scholarly journals A Cache Fill and Migration Policy for STT-RAM-Based Multi-Level Hybrid Cache in 3D CMPs

Electronics ◽  
2019 ◽  
Vol 8 (6) ◽  
pp. 639
Author(s):  
Fen Ge ◽  
Lei Wang ◽  
Ning Wu ◽  
Fang Zhou
Keyword(s):  
Chip Multiprocessors ◽  
Migration Policy ◽  
Data Access ◽  
Data Migration ◽  
Access Policy ◽  
Low Leakage ◽  
Hybrid Cache ◽  
Non Volatile Memory ◽  
Multi Level ◽  
And Migration

Recently, in 3D Chip-Multiprocessors (CMPs), a hybrid cache architecture of SRAM and Non-Volatile Memory (NVM) is generally used to exploit high density and low leakage power of NVM and a low write overhead of SRAM. The conventional access policy does not consider the hybrid cache and cannot make good use of the characteristics of both NVM and SRAM technology. This paper proposes a Cache Fill and Migration policy (CFM) for multi-level hybrid cache. In CFM, data access was optimized in three aspects: Cache fill, cache eviction, and dirty data migration. The CFM reduces unnecessary cache fill, write operations to NVM, and optimizes the victim cache line selection in cache eviction. The results of experiments show that the CFM can improve performance by 24.1% and reduce power consumption by 18% when compared to conventional writeback access policy.

AUGMENTED FIFO CACHE REPLACEMENT POLICIES FOR LOW-POWER EMBEDDED PROCESSORS

2009 ◽  
Vol 18 (06) ◽  
pp. 1081-1092 ◽  
Author(s):  
SANGYEUN CHO ◽  
LORY AL MOAKAR
Keyword(s):  
Low Power ◽  
Energy Savings ◽  
Data Access ◽  
Replacement Policy ◽  
Embedded Processors ◽  
Cache Replacement ◽  
Implementation Cost ◽  
Control Logic ◽  
And Control ◽  
Cache Configuration

This paper explores a family of augmented FIFO replacement policies for highly setassociative caches that are common in low-power embedded processors. In such processors, the implementation cost and complexity of the replacement policy is as important as the cache hit rate. By exploiting the cache hit way information between two replacements, the proposed replacement schemes reduce cache misses by 1% to 18% on average depending on the cache configuration, compared with the conventional FIFO policy. The proposed schemes come at a small implementation cost of additional state bits and control logic. The reduction in cache misses directly translates into data access energy savings of 1% to 15% on average, depending on the cache configuration. Our work suggests that there is room for improving the popular FIFO policy at a small cost.

Cooperative Cache Replacement Policy for MANETs

2014 ◽  
Vol 6 (2) ◽  
pp. 36-47 ◽  
Author(s):  
Prashant Kumar ◽  
Naveen Chauhan ◽  
LK Awasthi ◽  
Narottam Chand
Keyword(s):  
Ad Hoc ◽  
Data Access ◽  
Data Availability ◽  
Replacement Policy ◽  
Cache Replacement ◽  
Cache Replacement Policy ◽  
Cooperative Cache ◽  
Dynamic Topology ◽  
Adhoc Networks ◽  
Hoc Networks

Mobile Adhoc Networks (MANETs) are autonomously structured multi-hop wireless links in peer to peer fashion without aid of any infrastructure network. In MANETs network topology is dynamic, as nodes are mobile. Due to this dynamic topology and multi-hop environment data availability in MANETs is low. Caching of frequently accessed data in ad hoc networks is a potential technique that can improve the data access, performance and availability. While caching the new data items, it is very important which data item is to be removed, as in MANETs the data is not stored only on behalf of caching node but interest of the vicinity is also considered. In this paper the authors presented a new cache replacement policy for MANETs. This policy is based on multi-parameter value called SAT. We simulate the proposed work on OMNET++ and the simulation results shows that proposed replacement policy helps to improve the data availability in network.

Mobile Cache Management

2011 ◽  
pp. 32-59
Author(s):  
Jianliang Xu ◽  
Haibo Hu ◽  
Xueyan Tang ◽  
Baihua Zheng
Keyword(s):  
Data Access ◽  
Replacement Policy ◽  
Cache Replacement ◽  
Wireless Data ◽  
Mobile Data ◽  
Cache Consistency ◽  
Mobile Caching ◽  
The Cost ◽  
Client Side ◽  
Cache Replacement Policies

This chapter introduces advanced client-side data-caching techniques to enhance the performance of mobile data access. The authors address three mobile caching issues. The first is the necessity of a cache replacement policy for realistic wireless data-broadcasting services. The authors present the Min-SAUD policy, which takes into account the cost of ensuring cache consistency before each cached item is used. Next, the authors discuss the caching issues for an emerging mobile data application, that is, location-dependent information services (LDISs). In particular, they consider data inconsistency caused by client movements and describe several location-dependent cache invalidation schemes. Then, as the spatial property of LDISs also brings new challenges for cache replacement policies, the authors present two novel cache replacement policies, called PA and PAID, for location-dependent data.

Random-LRU: A Replacement Policy for Chip Multiprocessors

2013 ◽  
pp. 204-213 ◽  
Author(s):  
Shirshendu Das ◽  
Nagaraju Polavarapu ◽  
Prateek D. Halwe ◽  
Hemangee K. Kapoor
Keyword(s):  
Chip Multiprocessors ◽  
Replacement Policy
Sign in / Sign up

Export Citation Format

Share Document