Optimal placement of high-probability randomly retrieved blocks on CLV optical discs
ACM Transactions on Information Systems (TOIS)
A stochastic approach for clustering in object bases
SIGMOD '91 Proceedings of the 1991 ACM SIGMOD international conference on Management of data
Management of disk space with REBATE
CIKM '94 Proceedings of the third international conference on Information and knowledge management
ACM Transactions on Computer Systems (TOCS)
Power optimization in disk-based real-time application specific systems
Proceedings of the 1996 IEEE/ACM international conference on Computer-aided design
Dynamic Placement of Records in Linear Storage
Journal of the ACM (JACM)
Minimizing Expected Head Movement in One-Dimensional and Two-Dimensional Mass Storage Systems
ACM Computing Surveys (CSUR)
Dynamic Statistical Control of Manufacturing Test
IEEE Design & Test
A placement strategy of multimedia objects in multimedia information systems
Journal of Systems and Software
Optimizing Random Retrievals from CLV format Optical Disks
VLDB '91 Proceedings of the 17th International Conference on Very Large Data Bases
A two-carousel storage location problem
Computers and Operations Research
Computers and Operations Research
Improving the performance of log-structured file systems with adaptive block rearrangement
Proceedings of the 2007 ACM symposium on Applied computing
Analysis of set-up time models: A metric perspective
Theoretical Computer Science
A rigorous analysis for set-up time models – a metric perspective
COCOON'06 Proceedings of the 12th annual international conference on Computing and Combinatorics
Research: Object model for hypermedia applications
Computer Communications
| Hi-index | 0.01 |
The problem considered is how to place records on a secondary storage device to minimize average retrieval time, based on a knowledge of the probability for accessing the records. Theorems are presented for two limiting cases. A numerical example for an intermediate case is also given.