Journal of KIISE:Software and Applications (한국정보과학회논문지:소프트웨어및응용)

Korean Institute of Information Scientists and Engineers (한국정보과학회)
권호 표지

A GA-Based Adaptive Task Redistribution Method for Intelligent Distributed Computing

지능형 분산컴퓨팅을 위한 유전알고리즘 기반의 적응적 부하재분배 방법

  • Published : 2004.10.01
Download PDF
⟨ Previous Next ⟩

Abstract

In a sender-initiated load redistribution algorithm, a sender(overloaded processor) continues to send unnecessary request messages for load transfer until a receiver(underloaded processor) is found while the system load is heavy. In a receiver-initiated load redistribution algorithm, a receiver continues to send unnecessary request messages for load acquisition until a sender is found while the system load is light. Therefore, it yields many problems such as low CPU utilization and system throughput because of inefficient inter-processor communications in this environment. This paper presents an approach based on genetic algorithm(GA) for adaptive load sharing in distributed systems. In this scheme, the processors to which the requests are sent off are determined by the proposed GA to decrease unnecessary request messages.

송신자 개시 부하재분배 알고리즘에서는 전체 시스템이 과부하일 때 송신자(과부하 프로세서)가 부하를 이전하기 위해 수신자(저부하 프로세서)를 발견할 때까지 불필요한 이전 요청 메시지를 계속 보내게 된다 반면에, 수신자 개시 부하재분배 알고리즘에서는 전체 시스템이 저부하일 때 수신자가 부하를 이전 받기 위해 송신자를 발견할 때까지 불필요한 이전 요청 메시지를 계속 보내게 된다. 따라서 송신자 개시 부하재분배 알고리즘에서는 수신자로부터, 수신자 개시 알고리즘에서는 송신자로부터 승인 메시지를 받기까지 불필요한 프로세서간 통신으로 인하여 프로세서의 이용률이 저하되고, 타스크의 처리율이 낮아지는 문제점이 발생한다. 이 같은 문제점을 개선하기 위해 본 논문에서는 유전 알고리즘을 기반으로 하는 분산 시스템에서의 적응적 부하재분배 접근 방법을 제안한다. 이 기법에서는 불필요한 요청 메시지를 죽이기 위해 요청 메시지가 전송될 프로세서들이 제안된 유전 알고리즘에 의해 결정된다.

Keywords

References

  1. D.L. Eager, E.D. Lazowska, J. Zahorjan, 'Adaptive Load Sharing in Homogeneous Distributed Systems,' IEEE Transactions on Software Engineering, Vol.12, No.5, pp.662-675, May 1986 https://doi.org/10.1109/TSE.1986.6312961
  2. N.G. Shivaratri, P. Krueger and M. Singhal, 'Load Distributing for Locally Distributed Systems,' IEEE Computer, Vol.25, No.12, pp.33-44, December 1992 https://doi.org/10.1109/2.179115
  3. L.M. Ni, C.W. Xu and T.B. Gendreau, 'A Distributed Drafting Algorithm for Load balancing,' IEEE Transactions on Software Engineering, Vol.SE-11, No. 10, pp. 1153-1161, October 1985 https://doi.org/10.1109/TSE.1985.231863
  4. M. Livny and M. Melman, 'Load balancing in Homogeneous Broadcast Distributed Systems,' Proc. ACM Computer Network Performance Symp, pp.44-55, 1982 https://doi.org/10.1145/800047.801689
  5. Randy Chow, Theodore Johnson, Distributed Operating Systems & Algorithms, ADDISON- WESLEY. 1997
  6. Terence C. Fogarty, Frank Vavak and Phillip Cheng, 'Use of the Genetic Algorithm for Load Balancing of Sugar Beet Presses,' Proc. Sixth International Conference on Genetic Algorithms, pp.617-624, 1995
  7. Garrison W. Greenwood, Christian Lang and Steve Hurley, 'Scheduling Tasks in Real-Time systems Using Evolutionary Strategies,' Proc. Third Workshop on Parallel and Distributed Real-Time Systems, pp.l95-196, 1995 https://doi.org/10.1109/WPDRTS.1995.470487
  8. David B. Fogel and Lawence J. Fogel, 'Using Evolutionary Programming to Schedule Tasks on a Suite of Heterogeneous Computers,' Computers & Operations Research, Vol. 23, No.6, pp.527-534, 1996 https://doi.org/10.1016/0305-0548(95)00057-7
  9. Branco Soucek, Dynamic, Genetic and Chaotic Programming, John wiley & Sons, 1992
  10. J. Grefenstette, 'Optimization of Control Parameters for Genetic Algorithms,' IEEE Transactions on System, Man and Cybernetics, Vol. SMC-16, No.1, January 1986 https://doi.org/10.1109/TSMC.1986.289288
  11. Philip D. Wasserman, Advanced Methods in Neural Computing, Van Nostrand Reinhold, New York, 1993