As capacity demands vary among simultaneously executed threads in chip multiprocessors, dynamically managing cache resources according to the run-time demands is effective to improve L2 cache performance. Differed from existing dynamic cache management schemes based on LRU replacement policy, we propose an adaptive capacity sharing mechanism based on a global reuse replacement policy. This mech...

While the field of computer architecture is always looking for novel research directions to bring improved performance and efficiency, it is often simple improvements to more mature topics that have the most substantial impact. Cache replacement policy is one such research area, where innovations are highly sought after because of their direct improvement on performance. Furthermore, as chip-mu...

in industries, preventive maintenance (pm) is not a new practice to minimise the sudden breakdown of production machine. pm will be performed at predetermine intervals to provide a balance between failure cost and component utilisation (aging). however, most of pm interval is based on experience or original equipment manufacturer (oem) recommendations. consequently, the benefits from pm are not...

For decades, researchers have pointed out that Mandatory Access Control (MAC) is an effective method to protect computer systems from being misused. Unfortunately, MAC is still not widely deployed because of its complexity. The problem is even worse in a virtual machine environment, because the current architecture is not designed to support MAC in a site-wide manner: machines with multiple vir...

Cooperative caching is a technique used in mobile ad hoc networks to improve the efficiency of information access by reducing the access latency and bandwidth usage. Cache replacement policy plays a significant role in response time reduction by selecting suitable subset of items for eviction from the cache. In this paper we have made a review of the existing cache replacement algorithms propos...

Second, mathematics i s u n i n t e l l i g i b l e to most o f us . Th is i s no t j u s t because we l a c k some educa t i on , bu t more impor tan t i t i s a consequence o f i t s abs t rac tness . The s t a t i s t i c s on smoking are c o n c l u s i v e , bu t the e f f e c t on smokers has been l i m i t e d . The T reasu ry ' s model of the economy might be as good a p r e d i c t i v...

Caching is one of the major steps in system designing to reach a higher performance in operating systems, databases and World Wide Web. High performance processors need memory systems with a proper access time, but still there is a big gap between performances of processors and memory systems. Virtual memory management and hierarchical memory models play an important role in system performance....

The performance of a prefetch cache is dependent on both the prefetch technique and the cache replacement policy. Both these algorithms execute independently of each other, but they share a data structure the cache replacement queue. This paper shows that even with a simple prefetch technique, there is an increase in hit rate when the LRU replacement queue is split into two equal sized queues. ...

Least Recently Used (LRU) cache replacement rule is at the core of many replacement algorithms in modern distributed networks. The wide popularity of this rule is primarily due to its high performance, self-organizing nature and ease of implementation. Therefore, in order to further the insights of designing network caching protocols, it is important to gain a thorough understanding of the base...