정보처리학회논문지A (The KIPS Transactions:PartA)

한국정보처리학회 (Korea Information Processing Society)
권호 표지

작업 이주시 보장/예약 기법을 이용한 프로세서 쓰레싱 빈도 감소

Reducing the frequency of processor thrashing using guarantee/reservation in process migration

  • 이준연 (동명정보대학교 멀티미디어공학과) ;
  • 임재현 (공주대학교 영상정보공학부)
  • 발행 : 2001.06.01
PDF 다운로드
⟨ 이전 논문 다음 논문 ⟩

초록

In a dynamic load distribution policies, each node gathers the current system sates information before making a decision on load balancing. Load balancing policies based on this strategy can suffer from processor thrashing. In this paper, we propose a new algorithm which attempts to decrease the frequency of the processor thrashing, the algorithm is based on the integration of three components. The first, the algorithm of which determine the size of jobs be transferred. The second, negotiation protocol with obtains a mutual agreement between a sender and a receiver on the transferring job size. And the third, a symmetrically-initiated location policy. The algorithm proposed in this paper used Siman IV as simulation tool to prove the improvement of performance. I analyzed the result of simulation, and compared with related works. The mean response time shows that there are no difference with existing policy, but appear a outstanding improvement in high load. The thrashing coefficient that shows the average response time, CPU overhead and the thrashing ratio at both the receiving and sending node has been used in the analysis. A significant improvement in the average response time and the CPU overhead ratio was detected using our algorithm when an overhead occurred in the system over other algorithm. The thrashing coefficient differed in the sending node and the receiving node of the system. Using our algorithm, the thrashing coefficient at the sending node showed more improvement when there was an overhead in the system, proving to be more useful. Therefore, it can be concluded that the thrashing ratio can be reduce by properly setting the maximum and minimum value of the system’s threshold queue.

키워드

참고문헌

  1. Marvin M. Theimer and Keith A. Lantz. 'Finding ldle Machine in a Workstation-Based Distributed systems,' IEEE Transactions on Software Engineering, Vol.15, No.11, November 1989
  2. L. M. Ni, C. W. Xu, and T. B. Gendreau. 'Load Balancing form a UNIX Shell,' In Proceedings, the 13th Conference on Local Computer Networks, October 1988
  3. Matt Bishop, Mark Valence, and Leonard F. Wisniewki, 'Process Migration for Heterogeneous Distributed Systems,' Technical Report TR95-264, Dartmouth College, Aug. 1995
  4. D. L. Eager and E. D. Lazowska. 'Adaptive Load Sharing in Homogenous Disributed Systems,' IEEE Transactions on Software Engineering, Vol.SE-12, No.5, May 1986
  5. C. Jacqmot and E. Milgrom. 'A Systematic Approach to Load Distribution Strategies for Distributed Systems,' In Decentralized and Distributed Systems, Sep. 1993
  6. Andrew Murray Bond, 'Adaptive Task Allocation in a Distributed Workstation Environment,' PhD.thesis Victoria University of Wellington, 1993
  7. S. Zhou. 'A Trace Driven Simulation Study of Dynamic Load Balancing,' IEEE Transactions on Software Engineering, Vol. 14, No.9, pp.1327-1341, Sep. 1988 https://doi.org/10.1109/32.6176
  8. Ishfaq Ahmad, Arif Ghafoor, and Kishan Mehrotra. 'Performance Prediction of Distributed Load Balancing on Multi-computer Systems,' In Proceedings, Supercomputing '91, pp.830-839, 1991
  9. O.Kremien and J. Kramer. 'Methodical Analysis of Adaptive Load Sharing Algorithms,' IEEE Transactions on Parallel and Distributed Systems, Vol.6, pp.747-760, Nov. 1992 https://doi.org/10.1109/71.180629
  10. N. G. Shivaratri and P. Krueger. 'Two Adaptive Location Policies for Global Scheduling Algorithms,' In Proceedings, The 10th International Conference on Distributed Computing Systems, pp.502-509, May 1990 https://doi.org/10.1109/ICDCS.1990.89320
  11. Chin Lu and Sau Ming Lau. 'A Performance Study on Load Balancing Algorrithms with Process Migration,' In Proceedings, IEEE TENCON 1994, pp.357-364, Singarpore, Aug. 1994
  12. Thomas Kunz. 'The Influence of Different Workload Descriptions on a Heuristic Load Balancing Scheme,' Technical Report TI-6/91, Institute for Theoretische Informatik, Fachbereich Infomatik, Technische Hochschule Darmstadt, DEC. 1991
  13. S. Zhou, X. Zheng, J. Wang, P. Delisle, 'Utopia : a Load Sharing Facility for Large, Heterogeneous Distributed Computer Systems,' Software Pratice and Experience, Vol.23, No.12, pp.1305-1336, Dec. 1993 https://doi.org/10.1002/spe.4380231203
  14. N. G. Shivaratri, P. Krueger, and M. Singhan, 'IEEE Computer,Load Distributing for Locally Distributed Systems,' IEEE Computer, pp.33-44, Dec. 1992 https://doi.org/10.1109/2.179115
  15. K. Benmohammed Mahieddine and P. M. Dew. 'A Periodie Symmetrically-Initiated Load Balancing Algorithm for Distributed Systems,' SIGOPS, Vol.28, No.1, pp.66-77, Jan. 1994 https://doi.org/10.1145/164853.164875
  16. Chin L. U. and Sau Ming L. A. U.. 'An Adaptive Load Balancing Algorithm for Heterogeneous Distributed Systems with Multiple task classes,' Proceedings of 16th Distributed Computing Systems, May.1996 https://doi.org/10.1109/ICDCS.1996.508014
  17. Jun-Yeon Lee, Young Chan Kim. 'Synchronization algorithm of migrating service object,' Proceedings of the High Performance Computing Conference, pp.1407-1413, Sep. 1998
  18. 이준연, 김대현, 김영찬. '클라이언트/서버 응용의 연산 부하 측정을 위한 시뮬레이터', 정보과학회논문지(C), Vol.5, No.2, pp.185-195, 1999