Skip to main content

Controlled Duplication Scheduling of Real-Time Precedence Tasks on Heterogeneous Multiprocessors

  • Conference paper
  • First Online:
Job Scheduling Strategies for Parallel Processing (JSSPP 2015, JSSPP 2016)

Abstract

Duplication based heuristics have been widely utilized for scheduling communication intensive, precedence constrained tasks on multiple processors. Duplicating the predecessor of a task on the processor to which the task is assigned can result in the minimization of the communication cost. This helps in reducing the schedule length. However, this reduction comes at the cost of extra computing power required to duplicate the tasks. We have tried to address this trade-off in this paper. We propose “controlled” duplication algorithms for scheduling real-time periodic tasks with end-to-end deadlines on heterogeneous multiprocessors. We observe that whether to duplicate tasks or not is decided by the task deadlines. In the case that the deadline can be met without duplication, more schedule holes are created. These holes can be used to schedule other tasks. Simulations show that the proposed algorithms efficiently utilize the holes and improve the success ratio by 15%–50% versus comparable algorithms.

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

Access this chapter

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

Notes

  1. 1.

    (The terms node, job and subtask have been used interchangeably).

References

  1. Ahmad, I., Kwok, Y.K.: On exploiting task duplication in parallel program scheduling. IEEE Trans. Parallel Distrib. Syst. 9, 872–892 (1998)

    Article  Google Scholar 

  2. Auluck, N., Agrawal, D.P.: An integrated scheduling algorithm for precedence constrained hard and soft real-time tasks on heterogeneous multiprocessors. In: Yang, L.T., Guo, M., Gao, G.R., Jha, N.K. (eds.) EUC 2004. LNCS, vol. 3207, pp. 196–206. Springer, Heidelberg (2004). doi:10.1007/978-3-540-30121-9_19

    Chapter  Google Scholar 

  3. Auluck, N., Agrawal, D.: Enhancing the schedulability of Real-Time heterogeneous networks of workstations (NOWs). IEEE Trans. Parallel Distrib. Syst. 20(11), 1586–1599 (2009)

    Article  Google Scholar 

  4. Bajaj, R., Agrawal, D.P.: Improving scheduling of tasks in a heterogeneous environment. IEEE Trans. Parallel Distrib. Syst. 15, 107–118 (2004)

    Article  Google Scholar 

  5. Bansal, S., Kumar, P., Singh, K.: Dealing with heterogeneity through limited duplication for scheduling precedence constrained task graphs. J. Parallel Distrib. Comput. 65, 479–491 (2005)

    Article  MATH  Google Scholar 

  6. Baskiyar, S., Dickinson, C.: Scheduling directed a-cyclic task graphs on a bounded set of heterogeneous processors using task duplication. J. Parallel Distrib. Comput. 65, 911–921 (2005)

    Article  MATH  Google Scholar 

  7. Davare, A., Chong, J., Zhu, Q., Densmore, D.M., Sangiovanni-Vincentelli, A.L.: Classification, customization, and characterization: using MILP for task allocation and scheduling. Technical report UCB/EECS-2006-166, EECS Department, University of California, Berkeley, December 2006

    Google Scholar 

  8. Dave, B., Jha, N.: COFTA: hardware-software co-synthesis of heterogeneous distributed embedded systems for low overhead fault tolerance. IEEE Trans. Comput. 48(4), 417–441 (1999)

    Article  Google Scholar 

  9. Dave, B., Lakshminarayana, G., Jha, N.: COSYN: hardware-software co-synthesis of heterogeneous distributed embedded systems. IEEE Trans. Very Large Scale Integr. VLSI Syst. 7(1), 92–104 (1999)

    Article  Google Scholar 

  10. Dick, R.P., Rhodes, D.L., Wolf, W.: TGFF: task graphs for free (1998)

    Google Scholar 

  11. Garey, M.R., Johnson, D.S.: Computers and Intractability: A Guide to the Theory of NP-Completeness. Series of Books in the Mathematical Sciences (1979). W.H. Freeman, first edn

    Google Scholar 

  12. Kwok, Y.K., Ahmad, I.: Static scheduling algorithms for allocating directed task graphs to multiprocessors. ACM Comput. Surv. 31, 406–471 (1999)

    Article  Google Scholar 

  13. Liu, C., Anderson, J.: Supporting graph-based real-time applications in distributed systems. In: Proceedings - 17th IEEE International Conference on Embedded and Real-Time Computing Systems and Applications, RTCSA 2011, vol. 1, pp. 143–152 (2011)

    Google Scholar 

  14. Liu, C.L., Layland, J.W.: Scheduling algorithms for multiprogramming in a hard-real-time environment. J. ACM (JACM) 20(1), 46–61 (1973)

    Article  MathSciNet  MATH  Google Scholar 

  15. Qin, X., Jiang, H.: A dynamic and reliability-driven scheduling algorithm for parallel real-time jobs executing on heterogeneous clusters. J. Parallel Distrib. Comput. 65(8), 885–900 (2005)

    Article  MATH  Google Scholar 

  16. Ranaweera, S., Agrawal, D.P.: Scheduling of periodic time critical applications for pipelined execution on heterogeneous systems. In: International Conference on Parallel Processing, p. 0131, Los Alamitos, CA, USA (2001)

    Google Scholar 

  17. Singh, J., Auluck, N.: Controlled duplication for scheduling real-time precedence tasks on heterogeneous multiprocessors. In: Student Research Symposium High Performance Computing (HiPC11), Bangalore, India, December 2011

    Google Scholar 

  18. Singh, J., Betha, S., Mangipudi, B., Auluck, N.: Contention aware energy efficient scheduling on heterogeneous multiprocessors. IEEE Trans. Parallel Distrib. Syst. 26(5), 1251–1264 (2015)

    Article  Google Scholar 

  19. Stavrinides, G.L., Karatza, H.D.: Scheduling multiple task graphs in heterogeneous distributed real-time systems by exploiting schedule holes with bin packing techniques. Simul. Model. Pract. Theory 19(1), 540–552 (2011)

    Article  Google Scholar 

  20. Topcuouglu, 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 

  21. Tosun, S.: Energy and reliability-aware task scheduling onto heterogeneous MPSoC architectures. J. Supercomputing 62(1), 1–25 (2011)

    Google Scholar 

  22. Xie, T., Qin, X.: Security-aware resource allocation for real-time parallel jobs on homogeneous and heterogeneous clusters. IEEE Trans. Parallel Distrib. Syst. 19(5), 682–697 (2008)

    Article  Google Scholar 

  23. YuHai, Y., Shengsheng, Y., XueLian, B.: A new dynamic scheduling algorithm for real-time heterogeneous multiprocessor systems. In: Workshop on Intelligent Information Technology Application (IITA 2007), Zhang Jiajie, China, pp. 112–115 (2007)

    Google Scholar 

  24. Zhu, X., Lu, P.: Multi-Dimensional scheduling for real-time tasks on heterogeneous clusters. J. Comput. Sci. Technol. 24(3), 434–446 (2009)

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Jagpreet Singh .

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2017 Springer International Publishing AG

About this paper

Cite this paper

Singh, J., Auluck, N. (2017). Controlled Duplication Scheduling of Real-Time Precedence Tasks on Heterogeneous Multiprocessors. In: Desai, N., Cirne, W. (eds) Job Scheduling Strategies for Parallel Processing. JSSPP JSSPP 2015 2016. Lecture Notes in Computer Science(), vol 10353. Springer, Cham. https://doi.org/10.1007/978-3-319-61756-5_1

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-61756-5_1

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-319-61755-8

  • Online ISBN: 978-3-319-61756-5

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics