The generalized Banach match-box problem: Application in disc storage management
A computer system manages disc storage of finite capacity c blocks. This storage must be divided among N files in such a way that the expected number of disc accesses accomplished until the necessary reorganization is maximized. Each access to the disc appends a record of a fixed length to the ith file with probability pi (i=1,h., N). The reorganization is needed when the chosen file has run out of space. It is shown that the above problem is a generalization of Banach's match-box problem known from the probability theory. A detailed separate analysis for the N=2 case and for the multivariate case is performed and some approximate results for large c are given.
AMS (MOS) subject classifications (1980)60C05 68B15
Key wordsSerial file system De Moivre-Laplace theorem probabilistic criterion optimal allocation
Unable to display preview. Download preview PDF.
- 1.Mendelson, H., Pliskin, J. S., and Yechiali, U.: ‘A Stochastic Allocation Problem’, Operations Res. 28 (1980), 687–693.Google Scholar
- 2.Mendelson, H., Pliskin, J. S., and Yechiali, U.: ‘Optimal Storage Allocation for Serial Files’, Comm. ACM 22 (1979), 124–130.Google Scholar
- 3.Feller, W.: An Introduction to Probability Theory and Its Applications, Vol. 1, Wiley, New York, 1971.Google Scholar
- 4.Wiederhold, G.: Database Design, McGraw-Hill, New York, 1977.Google Scholar
- 5.Weingarten, A.: ‘The Analytic Design of Real-Time-Disk Systems’, Proc. IFIP Congress 1968, Amsterdam 1969, pp. 860–867.Google Scholar
- 6.Yue, P. C. and Wong, C. K.: ‘On the Optimality of the Probability Ranking Scheme in Storage Applications’, J. ACM 20 (1973), 624–633.Google Scholar
- 7.Teorey, T. J. and Pinkerton, T. B.: ‘A Comparative Analysis of Disc Scheduling Policies’, Comm. ACM 5 (1972), 177–184.Google Scholar
- 8.Wong, C. K.: ‘Minimizing Expected Head Movement in One-dimensional and Two-dimensional Mass Storage Systems’, Comput. Surv. 12 (1980), 167–178.Google Scholar