Heuristics: intelligent search strategies for computer problem solving
Heuristics: intelligent search strategies for computer problem solving
Optimal prepaging and font caching
ACM Transactions on Programming Languages and Systems (TOPLAS)
Use of graph-theoretic models for optimal relational database accesses to perform join
ACM Transactions on Database Systems (TODS)
An analysis of optimum caching
Journal of Algorithms
An introduction to database systems: vol. I (4th ed.)
An introduction to database systems: vol. I (4th ed.)
Optimal memory management strategies for query processing
Optimal memory management strategies for query processing
Scale and performance in a distributed file system
ACM Transactions on Computer Systems (TOCS)
Dynamic multipaging in even less space
ACM SIGMOD Record
Measurement and analysis of locality phases in file referencing behaviour
SIGMETRICS '86/PERFORMANCE '86 Proceedings of the 1986 ACM SIGMETRICS joint international conference on Computer performance modelling, measurement and evaluation
The Grid File: An Adaptable, Symmetric Multikey File Structure
ACM Transactions on Database Systems (TODS)
A caching file system for a programmer's workstation
Proceedings of the tenth ACM symposium on Operating systems principles
Data Structures for Range Searching
ACM Computing Surveys (CSUR)
Characteristics of program localities
Communications of the ACM
MIN—an optimal variable-space page replacement algorithm
Communications of the ACM
Improving locality by critical working sets
Communications of the ACM
Properties of the working-set model
Communications of the ACM
The working set model for program behavior
Communications of the ACM
A new way to compute the product and join of relations
SIGMOD '80 Proceedings of the 1980 ACM SIGMOD international conference on Management of data
A measure of program locality and its application
SIGMETRICS '84 Proceedings of the 1984 ACM SIGMETRICS conference on Measurement and modeling of computer systems
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
Formalized methodology for data reuse exploration in hierarchical memory mappings
ISLPED '97 Proceedings of the 1997 international symposium on Low power electronics and design
Power and Speed-Efficient Code Transformation of Video Compression Algorithms for RISC Processors
Journal of VLSI Signal Processing Systems - Special issue on multimedia signal processing
An Optimal Resource Scheduler for Continuous Display of Structured Video Objects
IEEE Transactions on Knowledge and Data Engineering
A page fault equation for modeling the effect of memory size
Performance Evaluation
| Hi-index | 14.98 |
A memory-management model based on describing reference behavior in terms of locality-set sequences is proposed. Specialized for fixed-size buffers, this model is used to define the PSETMIN and SETMIN strategies which are proven to minimize the number of page faults in the presence and absence of prepaging, respectively. In contrast to MIN, they are also realizable for certain computations. The methodology for obtaining the locality-set sequence of a computation in advance is illustrated for relational database management systems with multiattribute-index catalogs, and the concomitant performance gains are discussed. In general, for applications that maintain their own organized collections of data, optimal locality-set management of individual computations provides an alternative to the widely used general-purpose strategies based on heuristics.