Optimal reorganization of distributed space disk files
Communications of the ACM
Optimum data base reorganization points
Communications of the ACM
Comparative Models of the File Assignment Problem
ACM Computing Surveys (CSUR)
On table arrangements, scrabble freaks, and jumbled pattern matching
FUN'10 Proceedings of the 5th international conference on Fun with algorithms
A nonlinear minimax allocation problem with multiple knapsack constraints
Operations Research Letters
| Hi-index | 48.22 |
A computer system uses several serial files. The files reside on a direct-access storage device in which storage space is limited. Records are added to the files either by jobs in batch processing mode, or by on-line transactions. Each transaction (or job) generates a demand vector which designates the space required in each file for record addition. Whenever one file runs out of space, the system must be reorganized. This paper considers several criteria for best allocating storage space to the files.