One of the most important items for better file system performance is efficient buffering of disk blocks in main memory. Efficient buffering helps to reduce the widespeed gap between main memory and hard disks. In this buffering system, the block replacement policy is one of the most important design decisions that determines which disk block should be replaced when the buffer is full. To o...

One of the most important items for better file system performance is efficient buffering of disk blocks in main memory. Efficient buffering helps to reduce the widespeed gap between main memory and hard disks. In this buffering system, the block replacement policy is one of the most important design decisions that determines which disk block should be replaced when the buffer is full. To o...

one of the most important items for better file system performance is efficient buffering of disk blocks in main memory. efficient buffering helps to reduce the widespeed gap between main memory and hard disks. in this buffering system, the block replacement policy is one of the most important design decisions that determines which disk block should be replaced when the buffer is full. to overc...

Block replacement policy is a type of preventive replacement policies where the units are always replaced at failure or at a scheduled time periodically. Assuming the lifetimes of the units are uncertain variables, this paper studies the block replacement policy in an uncertain environment. To deal with the different constraints a decision maker may face, three different criterions are used to ...

The block replacement policy with no replacement at failure means that a unit is always replaced at fixed time, but not replaced at failure. In this paper, the lifetime of the unit is assumed to be an uncertain variable, the model of expected cost per unit time following no replacement at failure policy is proposed, and the existence condition of the optimal replacement time is given. Furthermo...

The cache replacement policy is one of the factors that determines the eeectiveness of cache memories. In this paper, we study the impact of incorporating the cache block coherence state information in the Random replacement policy in a shared{memory multipro-cessor. We assign replacement priority to each cache block within a set based on its state. To reduce the probability of replacing a rece...

Novel replacement policies that are hybrids of inspection maintenance and block replacement are developed for an n component series system in which the component parts used at successive replacements arise from a heterogeneous population. The heterogeneous nature of components implies a mixed distribution for time to failure. In these circumstances, a hybrid policy comprising two phases, and ea...

Recent research has shown that near optimal performance can be achieved by adaptive block replacement policies that use user-level hints regarding the block reference pattern. However, obtaining user-level hints requires considerable effort from users making it difficult to apply adaptive replacement policies to diverse kinds of applications. We propose a new adaptive block management scheme th...

Prefetching is an inbuilt feature of file system and storage caches. The cache replacement policy plays a key role in the performance of prefetching techniques, since a miss occurs if a prefetch block is evicted before the arrival of the on-demand user request for the block. Prefetch blocks display spatial locality, but existing cache replacement policies are designed for blocks that display te...

In the past several decades, maintenance and replacement problems have been extensively studied in the literature. Thousands of maintenance and replacement models have been created. However, all these models can fall into some categories of maintenance policies: age replacement policy, block replacement policy, periodic preventive maintenance policy, failure limit policy, sequential preventive ...