Journal of KIISE:Computer Systems and Theory (한국정보과학회논문지:시스템및이론)

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

A Novel Processor Allocation Policy for List Scheduling in Distributed Heterogeneous Computing System

분산 이기종 시스템에서 리스트 스케줄링 알고리즘을 위한 새로운 프로세서 할당 정책

  • Received : 2009.12.07
  • Accepted : 2009.12.30
  • Published : 2010.04.15
Download PDF
⟨ Previous Next ⟩

Abstract

The performance of Distributed Heterogeneous Computing System depends on the algorithm which schedules input DAG graph. Among various scheduling algorithms, list scheduling algorithm provides superior performance with low complexity. List scheduling consists of task prioritizing phase and processor allocation phase, but most studies only focus on task prioritizing phase. In this paper, we propose LIP policy which has the same complexity with traditional allocation policies but has superior performance. The performance of LIP has been observed by applying them to task prioritizing phase of traditional list scheduling algorithms, HCPT, HEFT, GCA, and PETS. The results show that LIP has better performance than insertion-based policy and non-insertion-based policy, which are traditional processor allocation policies.

분산 이기종 시스템의 성능은 DAG로 주어지는 입력 그래프를 스케줄링 하는 알고리즘의 성능에 좌우된다. 많은 스케줄링 알고리즘 중에 리스트 스케줄링 알고리즘은 낮은 복잡도를 가지면서 우수한 성능을 보이고 있다. 리스트 스케줄링은 태스크 우선순위 결정 단계와 프로세서 할당 단계로 이루어져 있으나 대부분의 연구들은 태스크 우선순위 결정 단계만을 연구하고 있다. 본 논문에서는 기존의 할당 정책과 동일한 복잡도를 가지면서 성능이 향상된 새로운 프로세서 할당 정책인 LIP 정책을 제안한다. 기존의 리스트 스케줄링 알고리즘인 HEFT, HCPT, GCA, PETS의 태스크 우선순위 결정 정책에 본 논문에서 제안한 LIP 정책을 적용하여 실험한 결과 기존의 프로세서 할당 정책인 삽입 정책과 비 삽입 정책보다 성능 향상이 있는 것을 확인할 수 있었다.

Keywords

References

  1. J. G. Webster, "Heterogeneous distributed computing," Encyclopedia of Electrical and Electronics Engineering, vol.8, pp.679-690, 1999.
  2. T. Braun, H. J. Siegel, N. Beck, L. L. Boloni, M. Maheswaran, A. I. Reuther, J. P. Robertson, M. D. Theys, B. Yao, D. Hengsen, and R. F. Freund, "A Comparison Study of Static Mapping Heuristics for a Classes of Meta-Tasks on Heterogeneous Computing Systems," Proc, Heterogeneous Computing Workshop, pp.15-29, 1999.
  3. Oliver Sinnen, "Task Scheduling For Parallel Systems," Wiley, pp.7-35, 2007.
  4. D.Feitelson, L. Rudolph, U. Schwiegelshohm, K. Sevcik, P. Wong, "Theory and practice in parallel job scheduling," JSSPP, pp.1-34, 1997.
  5. Y. Kwok, I. Ahmed, "Benchmarking the task graph scheduling a algorithm," Proc. IPPS/SPDP, 1998.
  6. T. Hagras and J. Janecek, "A Simple Scheduling Heuristic for Heterogeneous Computing. Environments," IEEE Proceedings of Second International Symposium on Parallel and. Distributed Computing (ISPDC'03), pp.104-110, October 2003.
  7. W. Yoon, J. Yoon, C. Lee, H. Gim, S. Choi, "An Efficient List Scheduling Algorithm in Distributed Heterogeneous Computing System," Journal of IEEK : CI, vol.46, no.3, May. 2009. (in Korea)
  8. H. Togcuglou, S, Hariri and M. Y. Wu, "Performance Effective and Low-Complexity Task Scheduling for Heterogeneous Computing," IEEE Trans. On Parallel and Distributed Systems, vol.13, no.3, Feb. 2002.
  9. Ching-Hsien Hsu, Chih-Wei Hsieh and Chao-Tung Yang, "A Generalized Critical Task Anticipation Technique for DAG Scheduling," ICA3PP, LNCS 4494, pp.493-505, 2007.
  10. Michael A. Iverson, F. Ozgunner and Gregory J. Follen, "Parallelizing Existing Applications in a Distributed Heterogeneous Environment," Proceeding Heterogeneous Computing Workshop, pp.93-100, 1995.
  11. E. Ilavarasan and P. Thambidurai, "Low Complexity Performance Effective Task Scheduling Algorithm for Heterogeneous Computing Environments," Journal of Computer Sciences, 3(2), pp.94-103, 2007. https://doi.org/10.3844/jcssp.2007.94.103
  12. E. Ilavarasan, P. Thambidurai and R. Mahilmannan, "High Performance Task Scheduling Algorithm for Heterogeneous Computing System," LNCS 3718, pp.193-203, 2005.
  13. Takao Tobita and Hironory kasahara, "A Standdard 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
  14. http://www.kasahara.elec.waseda.ac.jp.
  15. M. Cosnard, M. Marrakchi, Y. Robert, and D. Trystram, "Parallel Gaussian Elimination on an MIMD Computer," Parallel Computing, vol.6, pp.275-295, 1988. https://doi.org/10.1016/0167-8191(88)90070-1
  16. Y. Chung and S. Ranka, "Applications and Performance Analysis of a Compile-Time Optimization Approach for List Scheduling Algorithms on Distributed Memory Multiprocessors," Proc, Supercomputing, pp.512-521, Nov. 1992.