The design of the UNIX operating system
The design of the UNIX operating system
Data cache management using frequency-based replacement
SIGMETRICS '90 Proceedings of the 1990 ACM SIGMETRICS conference on Measurement and modeling of computer systems
Measurements of a distributed file system
SOSP '91 Proceedings of the thirteenth ACM symposium on Operating systems principles
A static analysis of I/O characteristics of scientific applications in a production workload
Proceedings of the 1993 ACM/IEEE conference on Supercomputing
The LRU-K page replacement algorithm for database disk buffering
SIGMOD '93 Proceedings of the 1993 ACM SIGMOD international conference on Management of data
An inter-reference gap model for temporal locality in program behavior
Proceedings of the 1995 ACM SIGMETRICS joint international conference on Measurement and modeling of computer systems
Informed prefetching and caching
SOSP '95 Proceedings of the fifteenth ACM symposium on Operating systems principles
UNIX internals: the new frontiers
UNIX internals: the new frontiers
Adaptive page replacement based on memory reference behavior
SIGMETRICS '97 Proceedings of the 1997 ACM SIGMETRICS international conference on Measurement and modeling of computer systems
SIGMETRICS '99 Proceedings of the 1999 ACM SIGMETRICS international conference on Measurement and modeling of computer systems
Proceedings of the 2000 ACM SIGMETRICS international conference on Measurement and modeling of computer systems
A generalized interval caching policy for mixed interactive and long video workloads
Readings in multimedia computing and networking
Operating Systems Theory
Characterization of database access pattern for analytic prediction of buffer hit probability
The VLDB Journal — The International Journal on Very Large Data Bases
Flexible and Adaptable Buffer Management Techniques for Database Management Systems
IEEE Transactions on Computers
Symphony: an integrated multimedia file system
Symphony: an integrated multimedia file system
General adaptive replacement policies
Proceedings of the 4th international symposium on Memory management
A client-assisted interval caching strategy for video-on-demand systems
Computer Communications
Performance comparisons of load balancing algorithms for I/O-intensive workloads on clusters
Journal of Network and Computer Applications
RACE: A Robust Adaptive Caching Strategy for Buffer Cache
IEEE Transactions on Computers
Quasistatic shared libraries and XIP for memory footprint reduction in MMU-less embedded systems
ACM Transactions on Embedded Computing Systems (TECS)
| Hi-index | 14.98 |
A new buffer replacement scheme, called DEAR (DEtection-based Adaptive Replacement), is presented for effective caching of disk blocks in the operating system. The proposed DEAR scheme automatically detects block reference patterns of applications and applies different replacement policies to different applications depending on the detected reference pattern. The detection is made by a periodic process and is based on the relationship between block attribute values, such as backward distance and frequency gathered in a period, and the forward distance observed in the next period. This paper also describes an implementation and performance measurement of the DEAR scheme in FreeBSD. The results from performance measurements of several real applications show that, compared with the LRU scheme, the proposed scheme reduces the number of disk I/Os by up to 51 percent (with an average of 23 percent) and the response time by up to 35 percent (with an average of 12 percent) in the case of single application executions. For multiple application executions, the results show that the proposed scheme reduces the number of disk I/Os by up to 20 percent (with an average of 12 percent) and the overall response time by up to 18 percent (with an average of 8 percent).