This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
A Distributed Algorithm for Performance Improvement Through File Replication, File Migration, and Process Migration
November 1989 (vol. 15 no. 11)
pp. 1459-1470

The author presents a distributed algorithm that considers the number of read and write accesses to files for every process type, the number of processes and their demands on system resources, the utilization of bottlenecks on all machines, and file sizes. Performance improvement obtained with the algorithm is discussed and proved. A number of experiments executed in a distributed system in order to predict the impact on performance of various algorithm strategies are examined. The experiments show changes in system performance due to file and process placement, file replication, and file and process migration.

[1] S. H. Bokhari, "A shortest tree algorithm for optimal assignments across space and time in a distributed processor system,"IEEE Trans. Software Eng., vol. SE-7, no. 6, pp. 583-589, Nov. 1981.
[2] W. W. Chu, "Multiple file allocation in a multiple computer system,"IEEE Trans. Comput., vol. C-18, no. 10, pp. 885-889, Oct. 1969.
[3] L. W. Dowdy, and D. V. Foster, "Comparative models of the file ss-signment problem,"ACM Comput. Surveys, vol. 14, no. 2, pp. 287-313, June 1982.
[4] D. L. Eager, E. Lazowska, and J. Zahorjan, "A comparison of receiver-initiated and sender-initiated adaptive loading,"Perform. Eval., vol. 6, 1986.
[5] A. Hac and T. J. Johnson, "A study of dynamic load balancing in a distributed system," G. Serazzi, Ed. Amsterdam, The Netherlands: inProc. ACM SIGCOMM Symp. Communications, Architectures and Protocols, Stowe, VT, Aug. 1986, pp. 348-356.
[6] A. Hac and T. J. Johnson, "A study of dynamic load balancing in a distributed system," G. Serazzi, Ed. Amsterdam, The Netherlands: inProc. ACM SIGCOMM Symp. Communications, Architectures and Protocols, Stowe, VT, Aug. 1986, pp. 348-356.
[7] R. M. Klein,Portable Distributed UNIX User Guide, AT&T Information Systems, Oct. 1984.
[8] L. J. Laning and M. Leonard, "File allocation in a distributed computer communication network,"IEEE Trans. Comput., vol. C-32, no. 3, pp. 232-244, Mar. 1983.
[9] M. Satyanarayanan, "A study of file sizes and functional lifetimes," inProc. Eighth Symp. Operating Systems Principles, Dec. 1981, pp. 96-108.
[10] J. B. Sinclair, "Efficient computation of optimal assignments for distributed tasks,"J. Parallel Distributed Comput., vol. 4, pp. 342-362, 1987.
[11] Y.-T. Wang and R. J. T. Morris, "Load sharing in distributed systems,"IEEE Trans. Comput., vol. C-34, no. 3, pp. 204-217, Mar. 1985.

Index Terms:
distributed algorithm; performance improvement; file replication; file migration; process migration; read and write accesses; system resources; bottlenecks; file sizes; distributed system; distributed processing; programming theory; system recovery
Citation:
A. Hac, "A Distributed Algorithm for Performance Improvement Through File Replication, File Migration, and Process Migration," IEEE Transactions on Software Engineering, vol. 15, no. 11, pp. 1459-1470, Nov. 1989, doi:10.1109/32.41337
Usage of this product signifies your acceptance of the Terms of Use.