Skip to main content
SpringerLink
Log in

Minimal Start Time Heuristics for Scheduling Workflows in Heterogeneous Computing Systems

  • Conference paper
  • First Online:
Distributed Computing and Internet Technology (ICDCIT 2016)

Part of the book series: Lecture Notes in Computer Science ((LNISA,volume 9581))

Abstract

Heterogeneous computing systems require efficient task-to-processor mapping for attaining high performance. Scheduling workflows on heterogeneous environments is shown to be NP-Complete. Several heuristics were developed to attain minimum schedule lengths. However, these algorithms employ level-wise approach of scheduling tasks. This indirectly assigns higher priority to the tasks at lower levels than those at higher levels. Further, the start time of tasks at higher levels is constrained by the completion times of tasks at lower levels. The present work proposes a novel heuristic based global scheduling algorithm namely Minimal Start Time (MST) algorithm for workflows. The proposed approach focuses on minimizing the start times of tasks which are dependent on the tasks at lower levels to generate shorter span schedules. The primary merit of this scheme is due to the elimination of level constraints whenever there are no dependency constraints. The performance of MST algorithm is evaluated in terms of normalized makespan, speedup, efficiency and improvement of 5–20 % in 80 % of the cases is achieved in comparison to the earlier work.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

References

  1. Arabnejad, H., Barbosa, J.M.: List scheduling algorithm for heterogeneous systems by an optimistic cost table. IEEE Trans. Parallel Distrib. Syst. 25(3), 682–694 (2014)

    Article  Google Scholar 

  2. Topcuoglu, H., Hariri, S., Wu, M.Y.: Performance effective and low complexity task scheduling for heterogeneous computing. IEEE Trans. Parallel Distrib. Syst. 13(3), 260–274 (2002)

    Article  Google Scholar 

  3. Gary, M.R., Johnson, D.S.: Computers and Intractability: a Guide to the Theory of NP-Completeness. W.H. Freeman and Co., San Francisco (1979)

    Google Scholar 

  4. Illavarasan, E., Thambidurai, P.: Low complexity performance effective task scheduling algorithm for heterogeneous computing environments. J. Comput. Sci. 3(2), 94–103 (2007)

    Article  Google Scholar 

  5. Daoud, M.I., Kharma, N.: A high performance algorithm for static task scheduling in heterogeneous distributed computing systems. J. Parallel Distrib. Comput. 68, 399–409 (2008)

    Article  MATH  Google Scholar 

  6. Falzon, G., Li, M.: Enhancing list scheduling heuristics for dependent job scheduling in grid computing environments. J. Super Comput. 59(1), 104–130 (2012)

    Article  Google Scholar 

  7. Kruatrachue, B., Lewis, T.: Grain size determination for parallel processing. IEEE Softw. 5(1), 23–32 (1988)

    Article  Google Scholar 

  8. Xu, Y., Li, K., He, L., Truong, T.K.: A DAG scheduling scheme on heterogeneous computing systems using double molecular structure-based chemical reaction optimization. J. Parallel Distrib. Comput. 73, 1306–1322 (2013)

    Article  Google Scholar 

  9. Khan, M.A.: Scheduling for heterogeneous systems using constrained critical paths. J. Parallel Comput. 38, 175–193 (2012)

    Article  Google Scholar 

  10. Chung, Y., Ranka, S.: Application and performance analysis of a compile time optimization approach for list scheduling algorithms on distributed memory multiprocessors. In: Super Computing, pp. 512–52 (1992)

    Google Scholar 

  11. Wu, M., Dajski, D.: Hypertool: a programming aid for message passing system. IEEE Trans. Parallel Distrib. Syst. 1(3), 951–967 (1994)

    Google Scholar 

  12. Kim, S.J., Browne, J.C.: A general approach to mapping of parallel computation upon multiprocessor architectures. In: International Conference on Parallel Processing, pp. 1–8. Pennsylvania State University, University Park (1988)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of CSE, Pragati Engineering College, Surampalem, India

    D. Sirisha

  2. Department of CSE, JNTUH, Hyderabad, India

    G. VijayaKumari

Authors
  1. D. Sirisha
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. G. VijayaKumari
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to D. Sirisha .

Editor information

Editors and Affiliations

  1. Microsoft Research, Redmond, Washington, USA

    Nikolaj Bjørner

  2. Indian Institute of Technology Delhi, New Delhi, India

    Sanjiva Prasad

  3. IBM Thomas J. Watson Research Center, Yorktown Heights, New York, USA

    Laxmi Parida

Rights and permissions

Reprints and permissions

Copyright information

© 2016 Springer International Publishing Switzerland

About this paper

Cite this paper

Sirisha, D., VijayaKumari, G. (2016). Minimal Start Time Heuristics for Scheduling Workflows in Heterogeneous Computing Systems. In: Bjørner, N., Prasad, S., Parida, L. (eds) Distributed Computing and Internet Technology. ICDCIT 2016. Lecture Notes in Computer Science(), vol 9581. Springer, Cham. https://doi.org/10.1007/978-3-319-28034-9_27

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-28034-9_27

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-319-28033-2

  • Online ISBN: 978-3-319-28034-9

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation