Browse > Article

Efficient Duplication Based Task Scheduling with Communication Cost in Heterogeneous Systems  

Yoon, Wan-Oh (인하대학교 전자공학과 컴퓨터 구조 및 네트워크 연구실)
Baek, Jueng-Kuy (인하대학교 전자공학과 컴퓨터 구조 및 네트워크 연구실)
Shin, Kwang-Sik (인하대학교 전자공학과 컴퓨터 구조 및 네트워크 연구실)
Cheong, Jin-Ha (인하대학교 전자공학과 컴퓨터 구조 및 네트워크 연구실)
Choi, Sang-Bang (인하대학교 전자공학과 컴퓨터 구조 및 네트워크 연구실)
Publication Information
The Journal of Korean Institute of Communications and Information Sciences / v.33, no.3C, 2008 , pp. 219-233 More about this Journal
Abstract
Optimal scheduling of parallel tasks with some precedence relationship, onto a parallel machine is known to be NP-complete. The complexity of the problem increases when task scheduling is to be done in a heterogeneous environment, where the processors in the network may not be identical and take different amounts of time to execute the same task. This paper introduces a Duplication based Task Scheduling with Communication Cost in Heterogeneous Systems (DTSC), which provides optimal results for applications represented by Directed Acyclic Graphs (DAGs), provided a simple set of conditions on task computation and network communication time could be satisfied. Results from an extensive simulation show significant performance improvement from the proposed techniques over the Task duplication-based scheduling Algorithm for Network of Heterogeneous systems(TANH) and General Dynamic Level(GDL) scheduling algorithm.
Keywords
Heterogeneous System; Task Scheduling; Duplication; Heuristic; DAG;
Citations & Related Records
연도 인용수 순위
  • Reference
1 J. D. Ullman, 'NP-Complete Scheduling Problems,' J. Computer and Systems Sciences, vol. 10, pp. 384-393, 1975   DOI   ScienceOn
2 Savina Bansal, Padam Kumar, and Kuldip Singh, 'An Improved Duplication Strategy for Scheduling Precedence Constrained Graphs in Multiprocessor Systems,' IEEE Transactions on Parallel and Distributed Systems, vol. 15, no. 2, Feb 2004
3 M. Wu and D. Gajski, 'Hypertool : A programming Aid for Message Passing Systems,' IEEE Transactions on Parallel and Distributed Systems, vol. 1, pp. 330-343, July 1990   DOI   ScienceOn
4 T. Cassavant and J. A. Kuhl, 'Taxonomy of Scheduling in General Purpose Distributed Memory Systems,' IEEE Trans. Software Eng.,vol. 14, no. 2, pp. 141-154, 1988   DOI   ScienceOn
5 C. I. Park and T. Y. Choe, 'An Optimal Scheduling Algorithm Based on Task Duplication,' IEEE Trans. Computers, vol. 51, no. 4, pp. 444-448, Apr. 2002   DOI   ScienceOn
6 Rashmi Bajaj and Dharma P. Agrawal, 'Improving Scheduling of Tasks in a Heterogeneous Environment,' IEEE Trans. Parallel and Distributed Systems, vol. 15, no. 2, pp. 107-118, Feb. 2004   DOI   ScienceOn
7 Y. Kwok and I. Ahman, '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-521, May 1996   DOI   ScienceOn
8 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, pp. 951-967, Sept 1994   DOI   ScienceOn
9 R. L. Graham, L. E. Lawler, J. K. Lenstra, and A. H. Kan, 'Optimization and Approximation in Deterministic Sequencing and Scheduling: A Survey,' Annals of Discrete Math., pp. 287-326, 1979
10 Haluk Topcuoglu, Salim Hariri, and Min-You Wu, 'Performance-Effective and Low-complexity Task Scheduling for Heterogeneous Computing,' IEEE Transactions on Parallel and Distributed Systems, vol. 13, no. 2, March 2002
11 A. Ranaweera and D. P. Agrawal, 'A Scalable Task Duplication Based Scheduling Algorithm for Heterogeneous Systems,' Proc. Int'l Conf. Parallel Processing, pp. 383-390, Aug. 2000