Abstract Different cost models of allocation and rearrangement of a set { F 1 , F 2 … F n } of files are investigated in the paper. It is assumed that the distribution p 1 ( t ) of the reference string ξ( t ) depends on the user's activity. For large values of n a limiting process is used and a continuous rearrangement model is introduced, in which the integral formulas can be handled simpler than those summation formulas in the discrete case. Some open problems could be solved by the help of this treatment. The connection with order statistical treatment is found and used for a simple user activity model. The formulas can be used to approximate the average head movement, in case of different distributions, in optimal deterministic file allocation problems. Deterministic and stochastic strategies of allocation and rearrangement are studied and compared.
[1]
F. Riesz.
Sur Une Inégalité Intégarale
,
1930
.
[2]
Chak-Kuen Wong,et al.
Minimizing Expected Head Movement in One-Dimensional and Two-Dimensional Mass Storage Systems
,
1980,
CSUR.
[3]
M. Arató,et al.
Dynamic placement of records and the classical occupancy problem
,
1981
.
[4]
M. Arató,et al.
A note on optimal performance of page storage
,
1976,
Acta Cybernetica.
[5]
Erhan Çinlar,et al.
Introduction to stochastic processes
,
1974
.
[6]
Chak-Kuen Wong,et al.
Dynamic Placement of Records in Linear Storage
,
1978,
JACM.