Scheduling Directed A-Cyclic Task Graphs on Heterogeneous Processors Using Task Duplication

  • Sanjeev Baskiyar
  • Christopher Dickinson
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 2913)


In distributed computing, the schedule by which tasks are assigned to processors is critical to minimizing the finish time of the application. However, the problem of discovering the schedule that gives the minimum finish time is NP-Complete. By combining several innovative techniques, such as insertion-based scheduling and multiple task duplication, this paper presents a new heuristic called the Heterogeneous N-predecessor Decisive Path (HNDP), for statically scheduling directed a-cyclic weighted task graphs (DAGs) on a set of heterogeneous processors to minimize makespan. We compare the performance of HNDP, under a range of input conditions, with two of the best existing heuristics namely HEFT and STDS. We show that HNDP outperforms the two heuristics in finish time and the number of processors employed over a wide range of parameters.


Finish Time Task Graph List Schedule Exit Node Heterogeneous Earliest Finish Time 
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.
    Adam, T.L., et al.: A Comparison of List Schedules for Parallel Processing Systems. Communications of ACM 17(12), 685–690 (1974)zbMATHCrossRefMathSciNetGoogle Scholar
  2. 2.
    Baskiyar, S.: Scheduling DAGs on Message Passing m-Processors Systems. IEICE Transactions on Information and Systems E-83-D(7). Oxford University Press (2000)Google Scholar
  3. 3.
    Baskiyar, S.: Scheduling Task In-Trees on Distributed Memory Systems. IEICE Transactions on Information and Systems E 84-D(6), 685–691 (2001)Google Scholar
  4. 4.
    Beaumont, O., Boudet, V., Robert, Y.: A Realistic Model and an Efficient Heuristic for Scheduling with Heterogeneous Processors. In: Proc. IPDPS (2002)Google Scholar
  5. 5.
    Chiang, C., Lee, C., Chang, M.: A Dynamic Grouping Scheduling for Heterogeneous Internet-Centric Metacomputing System. ICPADS, 77–82 (2001)Google Scholar
  6. 6.
    Chan, W.Y., Li, C.K.: Scheduling Tasks in DAG to Heterogeneous Processors System. In: Proc. 6th Euromicro Workshop on Parallel and Distributed Processing (January 1998)Google Scholar
  7. 7.
    Dickinson, C.: Scheduling Directed A-cyclic Task Graphs on a Bounded Set of Heterogeneous Processors Using Task Duplication. MSSwE Project Report. CSSE Dept. Auburn University (2003)Google Scholar
  8. 8.
    Dogan, A., Ozguner, F.: Stochastic Scheduling of a Meta-task in Heterogeneous Distributed Computing. In: ICPP Workshop on Scheduling and Resource Management for Cluster Computing (2001)Google Scholar
  9. 9.
    Kwok, Y., Ahmad, I.: Benchmarking the Task Graph Scheduling Algorithms. In: Proc. IPDPS (1998)Google Scholar
  10. 10.
    Kwok, Y., Ahmad, I., Gu, J.: FAST: A Low-Complexity Algorithm for Efficient Scheduling of DAGs on Parallel Processors. In: Proc. ICPP (1997)Google Scholar
  11. 11.
    Maheswaran, M., Siegel, H.J.: A Dynamic Matching and Scheduling Algorithm for Heterogenous Computing Systems. In: Proc. 7th HCW, pp. 57–69. IEEE Press, Los Alamitos (1998)Google Scholar
  12. 12.
    Oh, H., Ha, S.: A Static Scheduling Heuristic for Heterogeneous Processors. In: Euro-Par., vol. 2, pp. 573–577 (1996)Google Scholar
  13. 13.
    Park, G., Shirazi, B., Marquis, J., Choo, H.: Decisive Path Scheduling: A New List Scheduling Method. In: Proc. ICPP (1997)Google Scholar
  14. 14.
    Radulescu, A., van Gemund, A.J.C.: Fast and Effective Task Scheduling in Heterogeneous Systems. In: Proc. HCW, pp. 229–238 (2000)Google Scholar
  15. 15.
    Ranaweera, S., Agrawal, D.P.: A Scalable Task Duplication Based Algorithm for Heterogeneous Systems. In: Proc. International Conference on Parallel Processing, pp. 383–390 (2000)Google Scholar
  16. 16.
    Ranaweera, S., Agrawal, D.P.: A Task Duplication Based Algorithm for Heterogeneous Systems. In: Proc. IPDPS, pp. 445–450 (2000)Google Scholar
  17. 17.
    Topcuoglu, H., Hariri, S., Wu, M.-Y.: Task Scheduling Algorithms for Heterogeneous Processors. In: Proc HCW, pp. 3–14 (1999)Google Scholar
  18. 18.
    Topcuoglu, H., Hariri, S., Wu, M.-Y.: Performance-Effective and Low-Complexity Task Scheduling for Heterogeneous Computing Parallel and Distributed Systems. IEEE Transactions on Parallel and Distributed Systems 13(3) (2002)Google Scholar
  19. 19.
    Sarkar, V.: Partitioning and Scheduling Parallel Programs for Multiprocessors. The MIT Press, Cambridge (1989)zbMATHGoogle Scholar
  20. 20.
    Yang, T., Gerasoulis, A.: DSC: Scheduling Parallel Tasks on an Unbounded Number of Processors. IEEE TPDS 5(9) (1994)Google Scholar
  21. 21.
    Sih, G., Lee, E.: A Compile Time Scheduling Heuristic for Interconnection Constrained Heterogeneous Processor Architectures. IEEE TPDS 4(2), 175–187 (1993)Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2003

Authors and Affiliations

  • Sanjeev Baskiyar
    • 1
  • Christopher Dickinson
    • 1
  1. 1.Department of Computer Science and Software EngineeringAuburn UniversityAuburn

Personalised recommendations