Skip to main content
SpringerLink
Log in

Scheduling Stochastic Tasks with Precedence Constrain on Cluster Systems with Heterogenous Communication Architecture

  • Conference paper
  • First Online:
Algorithms and Architectures for Parallel Processing (ICA3PP 2015)

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 9532))

Abstract

Scheduling precedence constrained stochastic tasks on heterogenous cluster systems is an important issue which impact the performance of clusters significantly. Different with deterministic tasks, stochastic task model assumes that the workload of task and quantity of data transmission between tasks are stochastic variables, which is more realistic than other task models. Scheduling model and algorithms of precedence constrained stochastic tasks attract a large number of researchers’ attention recently. An algorithm SDLS (Stochastic Dynamic Level Scheduling) has been proved performing well in scheduling stochastic tasks on heterogenous clusters. However, the assumption about communication time between tasks in SDLS is much simpler than its assumptions about task computing time, which makes it cannot depict the communication cost among heterogenous links well. In this paper, it is assumed that the quantity of data communication between tasks is a stochastic variable of normal distribution, instead of assuming communication time among heterogenous links a same stochastic variable immediately. Moreover, a modified scheduling model and algorithm SDLS-HC (Stochastic Dynamic Level Scheduling on Heterogenous Communication links) are proposed. Work in this paper focus on considering much more detailed communication cost in task scheduling based on SDLS. Evaluation on many random generated tasks experiments demonstrates that SDLS-HC achieves better performance than SDLS on cluster systems with heterogenous links.

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 84.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 109.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. Ullman, J.D.: NP-complete scheduling problems. J. Comput. Syst. Sci. 10, 384–393 (1975)

    Article  MathSciNet  MATH  Google Scholar 

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

    Article  Google Scholar 

  3. Kwok, Y.-K., Ahmad, L.: Dynamic critical-path scheduling: an effective technique for allocating task graphs to multiprocessors. IEEE Trans. Parallel Distrib. Syst. 7, 506–521 (1996)

    Article  Google Scholar 

  4. Yang, T., Gerasoulis, A.: DSC: scheduling parallel tasks on an unbounded number of processors. IEEE Trans. Parallel Distrib. Syst. 5, 951–967 (1994)

    Article  Google Scholar 

  5. Liu, Z., Qin, T., Qu, W., Liu, W.: DAG cluster scheduling algorithm for grid computing. In: IEEE 14th International Conference on Computational Science and Engineering (CSE), pp. 632–636 (2011)

    Google Scholar 

  6. Sih, G.C., Lee, E.: A compile-time scheduling heuristic for interconnection-constrained heterogeneous processor architectures. IEEE Trans. Parallel Distrib. Syst. 4, 175–187 (1993)

    Article  Google Scholar 

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

    Article  Google Scholar 

  8. Bozdağ, D., Özgüner, F., Catalyurek, U.V.: Compaction of schedules and a two-stage approach for duplication-based dag scheduling. IEEE Trans. Parallel Distrib. Syst. 20, 857–871 (2009)

    Article  Google Scholar 

  9. Ranaweera, S., Agrawal, D.P.: A task duplication based scheduling algorithm for heterogeneous systems. In: Proceedings of 14th International Parallel and Distributed Processing Symposium, IPDPS 2000, pp. 445–450 (2000)

    Google Scholar 

  10. Cirou, B., Jeannot, E.: Triplet: a clustering scheduling algorithm for heterogeneous systems. In: 2001. International Conference on Parallel Processing Workshops, pp. 231–236 (2001)

    Google Scholar 

  11. Shroff, P., Watson, D.W., Flann, N.S., Freund, R.F.: Genetic simulated annealing for scheduling data-dependent tasks in heterogeneous environments. In: 5th Heterogeneous Computing Workshop (HCW 1996), pp. 98–117 (1996)

    Google Scholar 

  12. Singh, H.K., Youssef, A.: Mapping and scheduling heterogeneous task graphs using genetic algorithms. George Washington University (1995)

    Google Scholar 

  13. Wang, L., Siegel, H.J., Roychowdhury, V.P., Maciejewski, A.A.: Task matching and scheduling in heterogeneous computing environments using a genetic-algorithm-based approach. J. Parallel Distrib. Comput. 47, 8–22 (1997)

    Article  Google Scholar 

  14. Wong, Y.W., Goh, R.S.M., Kuo, S.-H., Low, M.Y.H.: A tabu search for the heterogeneous dag scheduling problem. In: 2009 15th International Conference on Parallel and Distributed Systems (ICPADS), pp. 663–670 (2009)

    Google Scholar 

  15. Fidanova, S.: Simulated annealing for grid scheduling problem. In: IEEE John Vincent Atanasoff 2006 International Symposium on Modern Computing, JVA 2006, pp. 41–45 (2006)

    Google Scholar 

  16. Li, K., Tang, X., Veeravalli, B., Li, K.: Scheduling precedence constrained stochastic tasks on heterogeneous cluster systems. IEEE Trans. Comput. 64, 191–204 (2015)

    Article  MathSciNet  MATH  Google Scholar 

  17. Canon, L.-C., Jeannot, E.: Precise evaluation of the efficiency and the robustness of stochastic DAG schedules (2009)

    Google Scholar 

  18. Tang, X., Li, K., Liao, G., Fang, K., Wu, F.: A stochastic scheduling algorithm for precedence constrained tasks on Grid. Future Gener. Comput. Syst. 27, 1083–1091 (2011)

    Article  Google Scholar 

  19. Möhring, R.H., Schulz, A.S., Uetz, M.: Approximation in stochastic scheduling: the power of LP-based priority policies. J. ACM (JACM) 46, 924–942 (1999)

    Article  MathSciNet  MATH  Google Scholar 

  20. Scharbrodt, M., Schickinger, T., Steger, A.: A new average case analysis for completion time scheduling. J. ACM (JACM) 53, 121–146 (2006)

    Article  MathSciNet  MATH  Google Scholar 

  21. Hagstrom, J.N.: Comput. Complex. PERT Probl. Networks 18, 139–147 (1988)

    Article  MathSciNet  Google Scholar 

  22. Dong, F., Luo, J., Song, A., Jin, J.: Resource load based stochastic DAGs scheduling mechanism for grid environment. In: 2010 12th IEEE International Conference on High Performance Computing and Communications (HPCC), pp. 197–204 (2010)

    Google Scholar 

  23. Canon, L.-C., Jeannot, E.: Evaluation and optimization of the robustness of dag schedules in heterogeneous environments. IEEE Trans. Parallel Distrib. Syst. 21, 532–546 (2010)

    Article  Google Scholar 

  24. Beaumont, O., Bonichon, N., Eyraud-Dubois, L.: Scheduling divisibleworkloads on heterogeneous platforms under bounded multi-port model. In: IEEE International Symposium on Parallel and Distributed Processing, IPDPS 2008, pp. 1–7 (2008)

    Google Scholar 

  25. Beaumont, O., Bonichon, N., Eyraud-Dubois, L., Uznanski, P., Agrawal, S.K.: Broadcasting on large scale heterogeneous platforms under the bounded multi-port model. IEEE Trans. Parallel Distrib. Syst. 25, 2520–2528 (2014)

    Article  Google Scholar 

  26. Clark, C.E.: The greatest of a finite set of random variables. Oper. Res. 9, 145–162 (1961)

    Article  MathSciNet  MATH  Google Scholar 

  27. Letić, D., Jevtić, V.: The distribution of time for Clark’s flow and risk assessment for the activities of pert network structure. Yugoslav J. Oper. Res. 19, 195–207 (2009)

    Article  MathSciNet  MATH  Google Scholar 

  28. Sarin, S.C., Nagarajan, B., Liao, L.: Stochastic scheduling: expectation-variance analysis of a schedule, Cambridge University Press (2010)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. College of Computer and Control Engineering, Nankai University, Tianjin, 300353, China

    Qun Liao, Shuangshuang Jiang, Qiaoxiang Hei, Tao Li & Yulu Yang

Authors
  1. Qun Liao
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Shuangshuang Jiang
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Qiaoxiang Hei
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. Tao Li
    View author publications

    You can also search for this author in PubMed Google Scholar

  5. Yulu Yang
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Yulu Yang .

Editor information

Editors and Affiliations

  1. Central South University, Changsha, China

    Guojin Wang

  2. Sch of Information Technologies, Sydney University, Sydney, New South Wales, Australia

    Albert Zomaya

  3. Department of Information and Commu, University of Murcia, Murcia, Murcia, Spain

    Gregorio Martinez

  4. Changsha, China

    Kenli Li

Rights and permissions

Reprints and permissions

Copyright information

© 2015 Springer International Publishing Switzerland

About this paper

Cite this paper

Liao, Q., Jiang, S., Hei, Q., Li, T., Yang, Y. (2015). Scheduling Stochastic Tasks with Precedence Constrain on Cluster Systems with Heterogenous Communication Architecture. In: Wang, G., Zomaya, A., Martinez, G., Li, K. (eds) Algorithms and Architectures for Parallel Processing. ICA3PP 2015. Lecture Notes in Computer Science(), vol 9532. Springer, Cham. https://doi.org/10.1007/978-3-319-27161-3_8

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-27161-3_8

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-319-27160-6

  • Online ISBN: 978-3-319-27161-3

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation