Optimal and Near-Optimal Scheduling Algorithms for Batched Processing in Linear Storage
- 1 November 1979
- journal article
- Published by Society for Industrial & Applied Mathematics (SIAM) in SIAM Journal on Computing
- Vol. 8 (4) , 479-498
- https://doi.org/10.1137/0208039
Abstract
No abstract availableKeywords
This publication has 9 references indexed in Scilit:
- Dynamic Placement of Records in Linear StorageJournal of the ACM, 1978
- Batched searching of sequential and tree structured filesACM Transactions on Database Systems, 1976
- Near-optimal heuristics for an assignment problem in mass storageInternational Journal of Parallel Programming, 1975
- Near-Optimal Solutions to a 2-Dimensional Placement ProblemSIAM Journal on Computing, 1975
- On the Optimality of the Probability Ranking Scheme in Storage ApplicationsJournal of the ACM, 1973
- Placement of Records on a Secondary Storage Device to Minimize Access TimeJournal of the ACM, 1973
- Minimizing expected travel time on geometrical patterns by optimal probability rearrangementsInformation and Control, 1972
- An n log n Algorithm to Distribute n Records Optimally in a Sequential Access FilePublished by Springer Nature ,1972
- Discrete Dynamic ProgrammingThe Annals of Mathematical Statistics, 1962