Browsing by Subject "Cache memory"

Now showing items 1-5 of 5

    • A fuzzy block replacement algorithm for disk caches 

      Pendse, Ravi; Walterscheidt, U.; Kua, S.C. (IEEE, 1996-08-18)
      In this paper, we present a new block replacement algorithm for disk caches. Our Fuzzy Block Replacement Algorithm (fuzzy block-RA) utilizes nine fuzzy rules to pick out the block to be evicted when an I/O reference causes ...

    • A novel graphical technique for analysis of runtime cache behavior 

      Pendse, Ravi; Tambe, N.; Walterscheidt, U. (IEEE, 1997-08-06)
      A novel technique is introduced to graphically analyze the runtime behavior of block replacement algorithms used in cache controllers. The new method allows a behavioral comparison of two or more algorithms, previously ...

    • Pre-fetching with the segmented LRU algorithm 

      Pendse, Ravi; Bhagavathula, Ravi (IEEE, 1999)
      An economical solution to the need for unlimited amounts of fast memory is a memory hierarchy, which takes advantage of locality and cost/performance of memory technologies. Most of the advanced block replacement algorithms ...

    • Selective prefetching: prefetching when only required 

      Pendse, Ravi; Katta, H. (IEEE, 1999)
      Cache memories are commonly used to reduce the number of slower lower-level memory accesses, thereby improving the memory hierarchy performance. However, high cache miss-ratio can severely degrade system performance. It ...

    • Timing analysis of block replacement algorithms on disk caches 

      Rajamoni, R.; Bhagavathula, Ravi; Pendse, Ravi (IEEE, 2000)
      Cache memories are used to reduce the memory latency in systems. While instruction references of a CPU exhibit high temporal and spatial locality, disk references exhibit very minimal temporal and spatial locality. Owing ...