A Heuristic Task Scheduling Algorithm in Workstation Networks

워크스테이션 네트웍에서의 휴리스틱 태스크 스케줄링 알고리즘

  • 강오한 (안동대학교 컴퓨터공학교육과)
  • Published : 2000.12.01

Abstract

본 논문에서는 워크스테이션 네트웍(Network of Workstation) 환경에서 태스크 스케줄링 문제를 해결하기 위하여 태스크 중복을 기반으로 하는 휴리스틱 스케줄링 알고리즘을 제안한다. 제안된 알고리즘에서는 NoW에서 통신할 때 발생되는 충돌을 방지하기 위하여 네트웍 통신 자원을 우선 할당하고, 스케줄링 길이를 단축하고 병렬처리 시간을 줄이기 위한 중복 테스크를 선택할 때 휴리스틱을 사용한다. 제안된 알고리즘은 태스크 그래프를 입력으로 받아 NoW 환경의 워크스테이션으로 스케줄링하며, 태스크 그래프에서 노드수가 V일 때 최악의 경우 알고리즘의 시간 복잡도는 O($V^2$)이다. 제안한 알고리즘을 실제 응용 프로그램의 태스크 그래프에 적용하였다. 시뮬레이션을 통하여 제안된 알고리즈이 스케줄링 길이와 알고리즘에서 요구하는 워크스테이션의 수 관점에서 성능이 향상되었음을 보여준다.

Keywords

References

  1. H. EI-Rewini, H.H. Ali, and T. Lewis, 'Task Scheduling in Multiprocessing Systems,' IEEE Computer, Vol. 28, No. 12, pp, 27-37, 1995 https://doi.org/10.1109/2.476197
  2. S. Darbha and D. P. Agrawal, 'Optimal Scheduling Algorithm for Distributed Memory Machines,' IEEE Transactions on Parallel and Distributed Systems, Vol. 9, No.1, pp. 87-95, 1998. https://doi.org/10.1109/71.655248
  3. M. R Gray and D. S. Johnson, 'Computers and Interactability: A Guide to Theory of NP-Completeness,' W.H. Freeman and Company, 1979.
  4. A. Gereasoulis and T. Yang, 'A Comparison of Clustering Heuristics for Scheduling Directed Acyclic Graphs on Multiprocessors,' Journal of Parallel and Distributed Computing, Vol. 16, pp. 276-291, 1992. https://doi.org/10.1016/0743-7315(92)90012-C
  5. C. L. McCreary, A. A. Khan, J. J. Thompson, and M. E. McArdle, 'A Comparison of Heuristics for Scheduling DAGs on Multiprocessor,' Proceedings of Eighth International Conference on parallel Processing, pp. 461-451, 1994. https://doi.org/10.1109/IPPS.1994.288264
  6. Y-K. Kwok and I. Ahmad, 'Dynamic Critical-Path Scheduling: An Effective Technique for Allocation Task Graphs to Multiprocessors,' IEEE Transactions on Parallel and Distributed Systems, Vol. 7, No.5, pp. 506-520, 1996 https://doi.org/10.1109/71.503776
  7. T. Yang and A. Gerasoulis, 'DSC: Scheduling Parallel Tasks on an Unbounded Number of Processors,' IEEE Transactions on Parallel and Distributed Systems, Vol. 5, No.9, 1994 https://doi.org/10.1109/71.308533
  8. I. Ahamd and Y.K. Kwok, 'A New Approach to Scheduling Parallel Program using Task Duplication,' Proceedings of International Conference on Parallel Processing, Vol. II, pp. 46-51, 1994. https://doi.org/10.1109/ICPP.1994.37
  9. H. Chen, B. Shirazi, and J. Marquis, 'Performance Evaluation of a Novel Scheduling Method: Linear Clustering with Task Duplication,' Proceedings of International Conference on Parallel and Distributed Systems, pp. 270-275, 1993.
  10. S. Darbha and D.P. Agrawal, 'A Task Duplication Based Scalable Scheduling Algorithm for Distributed Memory Systems,' Journal of Parallel and Distributed Computing, Vol. 46, pp. 15-26, 1997 https://doi.org/10.1006/jpdc.1997.1376
  11. G. L. Park, B. Shirazi, and J. Marquis, 'DFRN: A New Approach for Duplication Based Scheduling for Distributed Memory Multiprocessor Systems,' Proceedings of Parallel Processing Symposium, pp. 157-166, 1997. https://doi.org/10.1109/IPPS.1997.580875
  12. B. Shi, H-B. Chen, and J. marquis, 'Comparative Study of Task Duplication Static Scheduling versus Clustering and Nonclustering Techniques,' Concurrency: Practice and Experiences, Vol. 7, No.5. pp. 371-389, 1995
  13. D.E. Culler et. al., 'Parallel Computing on the Berkeley NOW,' 9th Joint Symposium on Parallel Processing, Japan 1997.
  14. W. M. Lin, Q. Gu, and W. Xie, 'DCP-NOW: A DCP-based Task Scheduling Technique for Networks of Workstations,' PDPTA'98 International Conference, pp. 1034-1040, 1998.
  15. X. Du and X. Zhang, 'Coordinating Parallel Processes on Networks of Workstations,' Journal of Parallel and Distributed Computing, Vol. 46, pp. 125-135, 1997. https://doi.org/10.1006/jpdc.1997.1378
  16. J.P. Kitajma and B. Plateau, 'Building Synthetic Parallel Programs: The Project (ALPES),' Proceedings of the IFIP WG 10.3 Workshop on Programming Environments for Parallel Computing, pp. 161-170, 1992.