A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2008; you can also visit the original URL.
The file type is application/pdf.
Filters
Dynamic buffer management with extensible replacement policies
2005
The VLDB journal
Preserved Fulltext
This paper addresses the problem of supporting extensibility of buffer replacement policies. The main contribution is the proposal of a framework for modeling buffer replacement policies. ...
First, by providing a uniform and generic specification of buffer replacement policies, the proposed framework unifies existing work in this area. ...
Supporting extensibility at the buffer management level (specifically, replacement policy extensibility) has the following advantages: -With buffer replacement extensibility, it becomes possible to custom-tailor ...
doi:10.1007/s00778-004-0145-1
fatcat:vxz5u6edpfdvtkwx4erzmpuujy
An Efficient Design and Implementation of Multi-level Cache for Database Systems
[chapter]
2015
Lecture Notes in Computer Science
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is application/pdf.
In this paper, we propose a SSD-based multilevel buffer scheme, called flash-aware second-level cache(FASC), where SSD serves as an extension of the DRAM buffer. ...
For this purpose, a cost-aware main memory replacement policy is proposed, which can efficiently reduce the cost of page evictions. ...
This is because the LC design uses a LRU-2 replacement policy manage the pages cached in the SSD. ...
doi:10.1007/978-3-319-18120-2_10
fatcat:j3iqsluysfft7ivr6kcufhjmga
Page 2231 of Mathematical Reviews Vol. , Issue 2003C
[page]
2003
Mathematical Reviews
Preserved Fulltext
The Internet Archive has digitized a microfilm copy of this work. It may be possible to borrow a copy for reading.
policy with minimal repair. ...
2231 90B Operations research and management science
dom walks is of the same nature as the difficulty of understanding the dynamics of the dynamical system under consideration. ...
FD-buffer
2010
Proceedings of the 19th ACM international conference on Information and knowledge management - CIKM '10
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is application/pdf.
flash-aware replacement policy. ...
We design and implement FD-Buffer, a buffer manager for database systems running on flash-based disks. ...
Unlike the existing policies such as CFLRU [28] and CFDC [27] that highly depend on a specific existing replacement policy, each pool of FD-Buffer is managed by an independent policy. ...
doi:10.1145/1871437.1871605
dblp:conf/cikm/OnLHWLX10
fatcat:4ulcxjfwaba4hchgsakzempvcm
An automatic prefetching and caching system
2010
International Performance Computing and Communications Conference
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
cache partitioning, (2) prefetch pipelining, and (3) prefetch buffer management. ...
Recent studies have shown that disk I/O performance gains provided by a cache buffer do not scale with cache size. ...
For example, the current GNU/Linux kernel uses a simple LRU replacement policy to manage its cache. ...
doi:10.1109/pccc.2010.5682310
dblp:conf/ipccc/LewisAARDQ10
fatcat:5gtpl6dqcndfjfz72hudpoz4je
The Impact of Buffering on Closest Pairs Queries Using R-Trees
[chapter]
2001
Lecture Notes in Computer Science
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2005; you can also visit the original URL.
The file type is application/pdf.
The main objective of this work is to find the most appropriate buffer structure, page replacement policy and buffering scheme for CPQs, where both spatial datasets are indexed with R-trees. ...
In this paper, the most appropriate buffer structure, page replacement policy and buffering scheme for closest pairs queries, where both spatial datasets are stored in R-trees, are investigated. ...
In [6] an extensible and dynamic prioritybased hint mechanism was proposed to design an optimal replacement strategy by exploiting the predictable access pattern of indexing methods. ...
doi:10.1007/3-540-44803-9_5
fatcat:ru4mgjg2qnhy5hy5k7oafa7eza
OS Portal: an economic approach for making an embedded kernel extensible
2003
Journal of Systems and Software
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
One critical design trend of such devices is that they are shifting from static and fixed-function systems to more dynamic and extensible ones, which are capable of running various kinds of applications ...
With the rapid development of embedded system techniques and Internet technologies, network-enabled embedded devices have grown in their popularity. ...
policy, and replace the current policy with the new one. ...
doi:10.1016/s0164-1212(02)00084-5
fatcat:tg4qy6f6srbghlsco4hnaapb2m
Dynamic SEOF: An Adaptable Object Prefetch Policy for Object-oriented Database Systems
2000
Computer journal
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
Unlike existing prefetch policies, dynamic SEOF utilizes the memory and the swap space of clients efficiently without resource exhaustion. ...
In this paper we present a new object prefetch policy, dynamic selective eager object fetch (SEOF), which prefetches objects only from selected candidate pages without using any high-level object semantics ...
How SEOF is incorporated with the page buffer management is potentially our next research topic. ...
doi:10.1093/comjnl/43.6.524
fatcat:rrt54bvhzzb75eymo43vqqzyim
Using Reflection to Support Dynamic Adaptation of System Software: A Case Study Driven Evaluation
[chapter]
2000
Lecture Notes in Computer Science
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2003; you can also visit the original URL.
The file type is application/pdf.
distinct technologies: design patterns, dynamic link libraries, and reflection. ...
In order to evaluate the use of reflection in this context we have implemented a resource manager that can be adapted to use different resource management strategies on behalf of its clients using three ...
buffer manager object to its replacement is to use a copy constructor. ...
doi:10.1007/3-540-45046-7_10
fatcat:p5h5a3tkm5bydjoxlz4jlcszj4
Adaptive Multi-Grained Buffer Management for Database Systems
2021
Future Internet
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2022; you can also visit the original URL.
The file type is application/pdf.
We conduct experiments on various workloads to compare the AMG-Buffer with several existing schemes, including LRU, LIRS, CFLRU, CFDC, and MG-Buffer. ...
The traditional page-grained buffer manager in database systems has a low hit ratio when only a few tuples within a page are frequently accessed. ...
In general, the efficiency of a buffer manager is highly impacted by the buffer replacement policy [1] . ...
doi:10.3390/fi13120303
fatcat:k6ggqvthvfamravaxz2xhxwmea
VDBMS: A testbed facility for research in video database benchmarking
2004
Multimedia Systems
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2005; you can also visit the original URL.
The file type is application/pdf.
, access control models for streaming, and search-based buffer management. ...
We are currently developing component wrappers with well-defined interfaces to facilitate the modification or replacement of components. ...
It has well defined interfaces with the query engine, the buffer manager, and the Extensible Abstract Data Type (E-ADT) interface. ...
doi:10.1007/s00530-003-0129-9
fatcat:lbkayo4w6fdtdoj7nyitf3jn74
OPELL and PM: A Case Study on Porting Shared Memory Programming Models to Accelerators Architectures
[chapter]
2013
Lecture Notes in Computer Science
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2012; you can also visit the original URL.
The file type is application/pdf.
The development of a dynamic framework that loads and manages partitions across function calls to bypass the problem with restrictive memory spaces. 2. ...
The implementation of replacement policies that are useful to reduce the number of DMA calls across partitions. 3. ...
It also applies the replacement policy to the buffers if required. ...
doi:10.1007/978-3-642-36036-7_8
fatcat:zfab4wlweveslmvfr4p4lxfo6u
Reorder the Write Sequence by Virtual Write Buffer to Extend SSD's Lifespan
[chapter]
2011
Lecture Notes in Computer Science
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2018; you can also visit the original URL.
The file type is application/pdf.
First, the DRAM can adopt any existing superior cache replacement policy, it achieves higher hit ratio than traditional write buffers do. ...
Second, the virtual write buffer reorders the write sequence, which hasn't been exploited by traditional write buffers. We compare the virtual write buffer with others by trace-driven simulations. ...
Comparison with Other Buffers We compare the virtual write buffer with BPLRU [4] and PUD-LRU [2] . BPLRU is a classical write buffer policy for SSDs. It has been extensively evaluated. ...
doi:10.1007/978-3-642-24403-2_21
fatcat:sxcgusnd4jfwdbe527kxacxxvq
Adaptive cycle management in soft real-time disk retrieval
2006
Information Systems
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is application/pdf.
We develop pre-buffering policy which makes the adaptive cycle management policy robust against starvation. ...
In this work, we present a novel cycle management policy which dynamically adapts to the varying workload. ...
By replacing Eq. 2 with one of these formulas, we can easily derive the buffer size, cycle length for various pre-buffering policies for disk arrays with coarse grain striping and fine grain striping, ...
doi:10.1016/j.is.2005.03.003
fatcat:mqmmeiozjjbt7bz7x6taa57f4m
Banshee: Bandwidth-Efficient DRAM Caching Via Software/Hardware Cooperation
[article]
2017
arXiv
pre-print
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is application/pdf.
The key ideas are to eliminate the in-package DRAM bandwidth overheads due to costly tag accesses through virtual memory mechanism and to incorporate a bandwidth-aware frequency-based replacement policy ...
Hence, as we show in this paper, these designs are suboptimal for use with in-package DRAM. ...
One solution is to dynamically switch between different replacement policies based on a program's access pattern. ...
arXiv:1704.02677v1
fatcat:uljhy5xcnvdrjnfgi5fj74cgwe
« Previous
Showing results 1 — 15 out of 41,986 results