Dynamic File Migration And Mathematical model in Distributed Computer Systems

분산 시스템에서 동적 파일 이전과 수학적 모델

  • 문원식 (평택대학교 컴퓨터학과)
  • Received : 2014.08.07
  • Accepted : 2014.08.25
  • Published : 2014.09.30


Many researches have been conducted to achieve improvement in distributed system that connects multiple computer systems via communication lines. Among others, the load balancing and file migration are considered to have significant impact on the performance of distributed system. The dynamic file migration algorithm common in distributed processing system involved complex calculations of decision function necessary for file migration and required migration of control messages for the performance of decision function. However, the performance of this decision function puts significant computational strain on computer. As one single network is shared by all computers, more computers connected to network means migration of more control messages from file migration, causing the network to trigger bottleneck in distributed processing system. Therefore, it has become imperative to carry out the research that aims to reduce the number of control messages that will be migrated. In this study, the learning automata was used for file migration which would requires only the file reference-related information to determine whether file migration has been made or determine the time and site of file migration, depending on the file conditions, thus reflecting the status of current system well and eliminating the message transfer and additional calculation overhead for file migration. Moreover, mathematical model for file migration was described in order to verify the proposed model. The results from mathematical model and simulation model suggest that the proposed model is well-suited to the distributed system.



  1. K. Hwang and 1. Xu, "Mapping Partitioned Program Modules onto Multicomputer Nodes Using Simulated Annealing," Proceeding of the 2002's IEEE Int. Conf. on Parallel Processing, Vol. II, Aug. 2002, pp. 292-293.
  2. F. C. H. Lin and R. M. Keller, "The Gradient Model Load Balancing Method," IEEE Trans. on Software Eng. Vol. SE-28, No. 1, January 2002, pp. 32-38.
  3. L. M. Ni, C. W. Xu, and T. B. Gendreau, "A Distributed Drafting Algorithm for Load Balancing," IEEE Trans. on Software Eng., Vol. SE-26, No. 10, Oct. 2000, pp. 1153-1161.
  4. B. Gavish, O. R. Liu Sheng, "Dynamic File Migration in Distributed Computer Systems," Commun. ACM, Feb. 2005, Vol. 48, No. 2, pp. 177-189.
  5. M. Schaar, K. Efe, L. Delcambre and S. Koppolu, "Heuristic Algorithms for Adaptive Load Sharing in Local Networks," Proceedings of The First International Conference on Systems Integration, IEEE Computer Society Press 2005.
  6. M. Schaar, K. Efe, L. Delcambre, and L. N. Bhuyan, "Load Balancing with Network Cooperation," Proceedings of the 2006 IEEE Int. Conf. on Distributed Computing Systems, 2006, pp. 328-335.
  7. K. S. Narendra and M. A. L. Thathachar, "Learning automata - A survey," IEEE Trans. Syst., Man, Cybern., Vol. SMC-19, No. 4, Jul. 1989, pp. 323-334.
  8. B. 1. Oommen, D. C. Y. Ma, "Deterministic Learning Automata Solutions to the Equipartitioning Problem," IEEE Trans.compo, Vol. 52, No. 1, Jan. 2003, pp. 2-13.
  9. B. J. Oommen and E. R. Hansen, "List Organizing Strategies Using Stochastic Move-to-Front and Stochastic Move-to-Rear Operations," Siam J. Comput., Vol. 31, 2002, pp. 705-716.
  10. M. H. MacDougal, "Simulating Computer Systems: Techniques and Tools," The MIT Press, Combridge, MA, 2002.
  11. B. Nelson, Y. P. Cheng, "How and Why SCSI is Better than IPI for NFS," Proc. USENIX Winter 2007 Technical Conference, 2007, pp. 253-270.
  12. 이동영, 서희석, 이을석, "분산 환경에서 SysLog 기반의 방화벽 통합로그관리시스템 개발," 디지털산업정보학회 논문지, 7권, 4호, 2011.
  13. 양환석, "프로토콜 기반 분산 침입탐지시스템 설계 및 구현," 디지털산업정보학회 논문지, 8권, 1호, 2012.