Critical-Task Anticipation Scheduling Algorithm for Heterogeneous and Grid Computing

  • Ching-Hsien Hsu
  • Ming-Yuan Own
  • Kuan-Ching Li
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 4186)


The problem of scheduling a weighted directed acyclic graph (DAG) to a set of heterogeneous processors to minimize the completion time has been recently studied. The NP-completeness of the problem has instigated researchers to propose different heuristic algorithms. In this paper, we present an efficient Critical-task Anticipation (CA) scheduling algorithm for heterogeneous computing systems. The CA scheduling algorithm introduces a new task prioritizing scheme that based on urgency and importance of tasks to obtain better schedule length compared to the Heterogeneous Earliest Finish Time algorithm. To evaluate the performance of the proposed algorithm, we have developed a simulator that contains a parametric graph generator for generating weighted directed acyclic graphs with various characteristics. We have implemented the CA algorithm along with the HEFT scheduling algorithm on the simulator. The CA algorithm is shown to be effective in terms of speedup and easy to implement.


Schedule Algorithm Directed Acyclic Graph Finish Time Critical Score Schedule Length 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    Bajaj, R., Agrawal, D.P.: Improving Scheduling of Tasks in a Heterogeneous Environment. IEEE Transactions on Parallel and Distributed Systems 15(2), 107–118 (2004)CrossRefGoogle Scholar
  2. 2.
    Behrooz, S., Wang, M., Pathak, G.: Analysis and Evaluation of Heuristic Methods for Static Task Scheduling. Journal Parallel and Distributed Computing 10, 222–232 (1990)CrossRefGoogle Scholar
  3. 3.
    Gerasoulis, A., Yang, T.: On the Granularity and Clustering of Directed Acyclic Task Graphs. IEEE Transactions on Parallel and Distributed Systems 4(6), 686–701 (1993)CrossRefGoogle Scholar
  4. 4.
    Hagras, T., Janecek, J.: A High Performance, Low Complexity Algorithm for Compile-Time Task Scheduling in Heterogeneous Systems. In: IEEE Proc. IPDPS (2004)Google Scholar
  5. 5.
    Iverson, M., Ozguner, F., Follen, G.: Parallelizing Existing Applications in a Distributed Heterogeneous Environment. In: Proc. Heterogeneous Computing Workshop, pp. 93–100 (1995)Google Scholar
  6. 6.
    Kwok, Y., Ahmed, I.: Benchmarking the Task Graph Scheduling Algorithms. In: Proc. IPPS/SPDP (1998)Google Scholar
  7. 7.
    Liou, J., Palis, M.A.: A Comparison of General Approaches to Multiprocessor Scheduling. In: Proc. Int’l. Parallel Processing Symposium, pp. 152–156 (1997)Google Scholar
  8. 8.
    Pande, S.S., Agrawal, D.P., Mauney, J.: A Scalable Scheduling Method for Functional Parallelism on Distributed Memory Multiprocessors. IEEE Transactions on Parallel and Distributed Systems 6(4), 388–399 (1995)CrossRefGoogle Scholar
  9. 9.
    Park, C.I., Choe, T.Y.: An Optimal Scheduling Algorithm Based on Task Duplication. IEEE Transactions on Computers 51(4), 444–448 (2002)CrossRefGoogle Scholar
  10. 10.
    Radulescu, A., van Gemund, A.: Fast and effective task scheduling in heterogeneous systems. In: Heterogeneous Computing Workshop 2000, pp. 229–238 (May 2000)Google Scholar
  11. 11.
    Ranaweera, S., Agrawal, D.P.: A Task Duplication Based Scheduling Algorithm for Heterogeneous Systems. In: IEEE Proceedings of IPDPS, pp. 445–450 (2000)Google Scholar
  12. 12.
    Rewini, H., Lewis, T.G.: Scheduling Parallel Program Tasks onto Arbitrary Target Machines. Journal of Parallel and Distributed Computing 9, 138–153 (1990)CrossRefGoogle Scholar
  13. 13.
    Sih, G.C., Lee, E.A.: A Compile Time Scheduling Heuristic for Interconnection - Constrained Heterogeneous Processors Architectures. IEEE Transactions on Parallel and Distributed Systems 4(2), 175–187 (1992)CrossRefGoogle Scholar
  14. 14.
    Topcuoglu, H., Hariri, S., Min-You, W.: Performance-Effective and Low-Complexity Task Scheduling for Heterogeneous Computing. IEEE Transactions on Parallel and Distributed Systems 13(3), 260–274 (2002)CrossRefGoogle Scholar
  15. 15.
    Wu, M., Gajski, D.: Hypertool: A Programming Aid for Message-Passing System. IEEE Trans. Parallel and Distributed Systems 1(3), 330–343 (1990)CrossRefGoogle Scholar
  16. 16.
    Yang, T., Gerasoulis, A.: DSC:Scheduling Parallel Tasks on an Unbounded Number of Processors. IEEE Tran. on Parallel and Distributed Systems 5(9), 951–967 (1994)CrossRefGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2006

Authors and Affiliations

  • Ching-Hsien Hsu
    • 1
  • Ming-Yuan Own
    • 1
  • Kuan-Ching Li
    • 2
  1. 1.Dept. of Computer Science and Information Engr. Chung Hua UniversityTaiwan
  2. 2.Dept. of Computer Science and Information Engr. Providence UniversityTaiwan

Personalised recommendations