In this paper we study the moment generating function order and the new better than used in the moment generating function order (NBUmg) life distributions. A closure property of this order under an independent random sum is deduced, and stochastic comparisons among the block replacement policy, the age replacement policy, the complete repair policy, and the minimal repair policy of an NBUmg co...

— This paper summarizes ten replacement models which combine tkree basic replacements: (i)age replacement; (ii)block replacement; (in) periodic replacement with minimal repair at failure. The expected cast rates ofeach model are derived, using the usual caktdus method ofprobabitity. As an example, we give an optimum policy to minimize the expected cost rate ofone model

The use of non-volatile write caches is an effective technique to bridge the performance gap between I/O systems and processor speed. Using such caches provides two benefits: some writes will be avoided because dirty blocks will be overwritten in the cache, and physically contiguous dirty blocks can be grouped into a single I/O operation. We present a new block replacement policy that efficient...

In this paper, we present a new block replacement policy in which we proposed a new efficient algorithm for combining two important policies Least Recently Used (LRU) and Least Frequently Used (LFU). The implementation of the proposed policy is simple. It requires limited calculations to determine the victim block. We proposed our models to implement LRU and LFU policies. The new policy gives e...

In this work we propose a cache memory system based on an adaptive cache replacement scheme, as part of the virtual memory system of an operating system. We use a sequential discrete-event simulator of a distributed system to compare our approach with previous work. Our adaptive cache replacement scheme is based on several criteria about the system and applications with the objective being to e...

In this paper, we present a SRAM-PCM hybrid cache design, along with a cache replacement policy, named dead fast block (DFB) to manage the hybrid cache. This design aims to leverage the best features of both SRAM and PCM devices. Compared to a PCM-only cache, the hybrid cache with DFB policy provides superior results on all relevant evaluation metrics, viz. cache lifetime, performance and energ...

A flow cache is a fundamental building block for flowbased traffic processing. Its efficiency is critical for the overall performance of a number of networked devices and systems. The efficiency is mainly dependent on a utilized replacement policy. This work proposes an approach based on Genetic Algorithm. The proposed approach starts from recorded traffic traces and uses Genetic Algorithm to e...

In this paper, we propose a new block selection policy for Last-Level Caches (LLCs) that decides, based on Reuse Detection, whether a block coming from main memory is inserted, or not, in the LLC. The proposed policy, called ReD, is demanding in the sense that blocks bypass the LLC unless their expected reuse behavior matches specific requirements, related either to their recent reuse history o...

ÐEfficient and effective buffering of disk blocks in main memory is critical for better file system performance due to a wide speed gap between main memory and hard disks. In such a buffering system, one of the most important design decisions is the block replacement policy that determines which disk block to replace when the buffer is full. In this paper, we show that there exists a spectrum o...

SSDs use multiple NAND flash memory chips as storage media and deploy large sized RAM inside it in order to maintain the FTL mapping table. The rest portion of the inner RAM can be used as buffer. The buffer absorbs the read/write requests by file systems and thus the resulting write requests to NAND flash memory is determined by the buffer replacement scheme. The block-level LRU replacement sc...