A Cache Replacement Policy with Considering Fluctuation Patterns of Total Priority Value

The Effect of using State-Based Priority Information in a Shared-Memory Multiprocessor Cache Replacement Policy

Secure Hierarchy-Aware Cache Replacement Policy (SHARP)

In cache-based side channel attacks, a spy that shares a cache with a victim probes cache locations to extract information on the victim’s access patterns. For example, in evict+reload, the spy repeatedly evicts and then reloads a probe address, checking if the victim has accessed the address in between the two operations. While there are many proposals to combat these cache attacks, they all h...

An Efficient Web Cache Replacement Policy

Several replacement policies for web caches have been proposed and studied extensively in the literature. Different replacement policies perform better in terms of (i) the number of objects found in the cache (cache hit), (ii) the network traffic avoided by fetching the referenced object from the cache, or (iii) the savings in response time. In this paper, we propose a simple and efficient repl...

Cooperative Cache Replacement Policy for MANETs

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

Non-Volatile Memory Based Cache Replacement Policy

Currently, most computer systems consist of Dynamic RAM (DRAM) as main memory and Hard Disk Drives (HDDs) as storage devices. Due to DRAM’s volatile nature, it suffers from data loss in the event of power failure or system crash. With rapid development of new types of non-volatile memory, it becomes promising that one of these technologies will replace DRAM as main memory in the near future. Co...