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

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

DOI QR Code

전역 이기종 환경에서의 정적 태스크 스케줄링의 비교 연구

Comparative Study on Static Task Scheduling Algorithms in Global Heterogeneous Environment

  • 김정환 (건국대학교 자연과학대학 컴퓨터.응용과학부)
  • 발행 : 2006.04.01
PDF 다운로드
⟨ 이전 논문 다음 논문 ⟩

초록

DAG(Directed Acyclic Graph) 기반의 스케줄링을 포함한 많은 스케줄링 문제들은 대부분 NP-Complete로 알려져 있으며, 따라서 휴리스틱에 기반한 많은 알고리즘 연구들이 진행되어 왔다. 이 중 HEFT와 CPOP은 이기종 환경에서 효과적인 알고리즘으로 알려져 있다. 본 논문의 이전 연구에서는 이기종 환경이 보다 현실성 있는 전역 네트워크로 구성된 경우에 대해 효과적인 3개의 알고리즘(CPOC, eCPOC, eCPOP)을 제안한 바 있다. 본 논문에서는 이들 총 5개의 알고리즘에서 사용하는 휴리스틱을 체계적으로 분석하고, 다양한 벤치마크를 사용한 실험을 통해 비교 분석하였다. 실험 결과 전역 이기종 환경에서 eCPOC이 가장 우수한 성능을 보여주었고, 또한 제안된 3개의 알고리즘에서 사용하는 휴리스틱들이 전역 이기종 환경에서 효과적임이 확인되었다.

Most scheduling problems including DAG(Directed Acyclic Graph)-based are known to be NP-complete, so many heuristic-based scheduling algorithms have been researched. HEFT and CPOP are such algorithms which have been devised to be effective in heterogeneous environment. We proposed, in the previous research, three scheduling algorithms which are effective in realistic global heterogeneous environment: CPOC, eCPOPC and eCPOP. In this paper, the heuristics which are used in the above five algorithms will be systematically analyzed. Those algorithms will be also studied experimentally using various benchmarks. Experimental results show that the eCPOC generates better schedules than any other algorithms and the heuristics which are used in the proposed algorithms are effective in the global heterogeneous environment.

키워드

참고문헌

  1. Shankar Ramaswamy, Sachin Sapatnekar and Prithviraj Banerjee, 'A Framework for Exploiting Task and Data Parallelism on Distributed Memory Multicomputers,' IEEE Transaction on Parallel and Distributed Systems, Vol.8, No.11, pp.l098-1116, Nov., 1997 https://doi.org/10.1109/71.642945
  2. Henri E. Bal and Matthew Haines, 'Approaches for Integrating Task and Data Parallelism,' IEEE Concurrency, pp.74-84, July-Sept., 1998 https://doi.org/10.1109/4434.708258
  3. C. Boeres and A. Lima, 'Hybrid Task Scheduling: Integrating Static and Dynamic Heuristics,' Proc. of the 15th Syrnp, On Computer Architecture and High Performance Computing (SBAC-PAD '03), 2003 https://doi.org/10.1109/CAHPC.2003.1250339
  4. O. Beaumont, A. Legrand and Y. Robert, 'Scheduling Strategies for Mixed Data and Task Parallelism on Heterogeneous Clusters and Grids,' Proc. of the 11th Euromicro Conf. on Parallel, Distributed and Network-Based Processing (Euro-PDP'03), 2003 https://doi.org/10.1109/EMPDP.2003.1183590
  5. H. El-Rewini and H. H. Ali, 'Task Scheduling in Multiprocessing Systems', IEEE Computer, pp.27-37, Dec., 1995 https://doi.org/10.1109/2.476197
  6. Y. Kwok and I. Ahmad, 'Static Scheduling Algorithms for Allocating Directed Task Graphs,' ACM Computing Surveys, Vol. 31, No. 4, pp. 407-471, Dec., 1999
  7. H. Topcuoglu, S. Hariri and M. Wu, 'Performance-Effective and Low-Complexity Task Scheduling for Heterogeneous Computing,' IEEE Trans. on Parallel and Distributed Systems, Vol. 13, No.3, pp.260-274, March, 2002 https://doi.org/10.1109/71.993206
  8. Junghwan Kim, Jungkyu Rho, Jeong-Ook Lee and Myeong-Cheol Ko, 'CPOC: Effective Static Task Scheduling for Grid Computing,' Lecture Notes in Computer Science, 3726, pp. 477-486, 2005 https://doi.org/10.1007/11557654_56
  9. I. Ahmad and Y. Kwok, 'On Exploiting Task Duplication in Parallel Program Scheduling,' IEEE Trans. on Parallel and Distributed Systems, Vol.9, No.9, pp.872-892, 1998 https://doi.org/10.1109/71.722221
  10. M. Wu and D. D. Gajski, 'Hypertool: A Programming Aid for Message-passing Systems,' IEEE Trans. on Parallel and Distributed Systems, Vol. 1, No.3, pp.330-343, 1990 https://doi.org/10.1109/71.80160
  11. T. Yang and A. Gerasoulis, 'DSC: Scheduling Parallel Tasks on an Unbounded Number of Processors,' IEEE Trans. on Parallel and Distributed Systems, Vol.5, No.9, pp.951-967, 1994 https://doi.org/10.1109/71.308533
  12. Y. Kwok and I. Ahmad, 'Dynamic Critical-path Scheduling: An Effective Technique for Allocating Task Graphs to Multiprocessor,' IEEE Trans. on Parallel and Distributed Systems, Vol.7, No.5, pp.506-521, 1996 https://doi.org/10.1109/71.503776
  13. J. Hwang, Y. Chow, F. D. Anger and C. Lee, 'Scheduling Precedence Graphs in Systems with Interprocessor Communication Times,' SIAM J. Comput., Vol. 18, No.2, pp.244-257, April, 1989 https://doi.org/10.1137/0218016
  14. G. C. Sih and E. A. Lee, 'A Compile-time Scheduling Heuristic for Interconnection-constrained Heterogeneous Processor Architectures,' IEEE Trans. on Parallel and Distributed Systems, Vol. 4, No. 2, pp. 75-87, Feb., 1993 https://doi.org/10.1109/71.207593
  15. H. El-Rewini and H. H. Ali, 'Scheduling Parallel Program Tasks onto Arbitrary Target Machines,' Journal of Parallel and Distributed Computing, Vol.9, No.2, pp.138-153, 1990 https://doi.org/10.1016/0743-7315(90)90042-N
  16. M. B. Doar, 'A Better Model for Generating Test Networks,' IEEE Global Telecommunications Conference, Nov., 1996 https://doi.org/10.1109/GLOCOM.1996.586131
  17. Takao Tobita and Hironori Kasahara, 'A Standard Task Graph Set for Fair Evaluation of Multiprocessor Scheduling Algorithms,' Journal of Scheduling, 5, pp.379-394, 2002 https://doi.org/10.1002/jos.116
  18. http://www.kasahara.elec.waseda.ac.jp/schedule/index.html
  19. Yu-Kwong Kwok, 'Benchmarking and Comparison of the Task Graph Scheduling Algorithms,' Journal of Parallel and Distributed Computing, 59, pp.381-422, 1999 https://doi.org/10.1006/jpdc.1999.1578