A Mahmood et al 1994 Distrib. Syst. Engng. 1 354 doi:10.1088/0967-1846/1/6/004
A Mahmood, H U Khan and H A Fatmi
Show affiliationsAn algorithm to dynamically reallocate the database files in a computer network is presented. The proposed algorithm uses the best fit approach to allocate and delete beneficial file copies. A key problem of economical estimation of future access and update pattern is discussed and an algorithm based on the Gabor-Kolmogorov learning process is presented to estimate the access and the update patterns. A distributed candidate selection algorithm is presented to reduce the number of files and nodes in reallocation. The simulation results are presented to demonstrate both accuracy and efficiency of the proposed algorithms.
07.05.Bx Computer systems: hardware, operating systems, computer languages, and utilities
07.05.Kf Data analysis: algorithms and implementation; data management
84.40.Ua Telecommunications: signal transmission and processing; communication satellites
Issue 6 (December 1994)
A Mahmood et al 1994 Distrib. Syst. Engng. 1 354
Patrick Mayor et al 2005 New J. Phys. 7 28
1996 Meas. Sci. Technol. 7
P W Martin 2003 Metrologia 40
Andrew Wallard 2003 Metrologia 40
P W Martin 2003 Metrologia 40
Martí Orta Martínez et al 2007 Environ. Res. Lett. 2 045006
S B Ota 1988 J. Phys. C: Solid State Phys. 21 1441
C P Pearman et al 2002 J. Phys. B: At. Mol. Opt. Phys. 35 5141
Oleg Morozov 2002 J. Phys. A: Math. Gen. 35 2965