Now showing items 1-6 of 6

  • Dynamical adjustment of block replacement algorithms 

    Walterscheidt, U.; Pendse, Ravi (IEEE, 1998-03-08)
    Block replacement algorithms are an important component of any cache controller, specially for disk caches. In recent years, complex and sophisticated algorithms have been developed, that reduce the miss-rate of disk caches. ...
  • 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 ...
  • 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 ...