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 ...
  • Investigation of impact of victim cache and victim tracer on a fully associative disk cache 

    Pendse, Ravi; Kushanagar, N.; Walterscheidt, U. (IEEE, 1998-08-09)
    In this paper, we present results of investigation to study the impact of victim cache and victim tracer on the miss rates due to the LRU block replacement algorithm. A total of three different algorithms were implemented. ...
  • Performance of LRU block replacement algorithm with pre-fetching 

    Pendse, Ravi; Bhagavathula, Ravi (IEEE, 1998-08-09)
    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 ...
  • Pipeline LRU block replacement algorithm 

    Bhagavathula, Ravi; Chittoor, P.; Pendse, Ravi (IEEE, 2000)
    Recent advances in VLSI technology have spurred a tremendous increase in the performance of processors. Due to the slower main memory, there exists a bottleneck in the performance of computer systems. Caching is an effective ...
  • 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 ...