Advertisement

High-Performance Real-Time Scheduling

  • Guoqi Xie
  • Gang Zeng
  • Renfa Li
  • Keqin Li
Chapter

Abstract

This chapter presents a multiple parallel applications scheduling optimization with respect to high performance and timing constraint. We first present the fairness and the whole priority scheduling algorithms from high performance and timing constraint perspectives, respectively. Thereafter, we mix these two algorithms to present the partial priority scheduling algorithm, which can satisfy the deadlines of more high-priority applications and reduce the overall schedule length of the system. The partial priority scheduling algorithm is implemented by preferentially scheduling the partial tasks of high-priority applications, and then fairly scheduling their remaining tasks with all the tasks of low-priority applications. Further, each application has different criticality levels (e.g., severity), and missing the deadlines of certain high-criticality functions may cause fatal injuries to people. Therefore, we present the multiple heterogeneous earliest finish time (F_MHEFT) algorithm for a multiple parallel applications with the mixed-criticality on heterogeneous distributed embedded systems. Next, we propose a novel algorithm called the deadline-span of multiple heterogeneous earliest finish time (D_MHEFT), which is a scheduling algorithm for multiple mixed-criticality applications. The F_MHEFT algorithm aims at improving the performance of systems, while the D_MHEFT algorithm tries to meet the deadlines of more high-criticality functions by sacrificing a certain performance. At the end of this chapter, different experiments will be presented and their results demonstrate that the partial priority scheduling algorithm achieves the significant optimization, and the D_MHEFT algorithm can significantly reduce the deadline miss ratio (DMR) while keeping satisfactory performance over existing methods.

References

  1. 6.
    Abrishami, S., Naghibzadeh, M., Epema, D.H.: Cost-driven scheduling of grid workflows using partial critical paths. IEEE Trans. Parallel Distrib. Syst. 23(8), 1400–1414 (2012)CrossRefGoogle Scholar
  2. 7.
    Abrishami, S., Naghibzadeh, M., Epema, D.H.: Deadline-constrained workflow scheduling algorithms for infrastructure as a service clouds. Futur. Gener. Comput. Syst. 29(1), 158–169 (2013)CrossRefGoogle Scholar
  3. 8.
    Anderson, J., Baruah, S., Brandenburg, B.B.: Multicore operating-system support for mixed criticality. In: Proceedings of the Workshop on Mixed Criticality: Roadmap to Evolving UAV Certification. Citeseer (2009)Google Scholar
  4. 9.
    Arabnejad, H., Barbosa, J.: Fairness resource sharing for dynamic workflow scheduling on heterogeneous systems. In: 2012 IEEE 10th International Symposium on Parallel and Distributed Processing with Applications, pp. 633–639. IEEE (2012)Google Scholar
  5. 18.
    Baruah, S., Bonifaci, V., D’Angelo, G., Li, H., Marchetti-Spaccamela, A., Van Der Ster, S., Stougie, L.: The preemptive uniprocessor scheduling of mixed-criticality implicit-deadline sporadic task systems. In: Proceedings of the 2012 24th Euromicro Conference on Real-Time Systems (ECRTS), pp. 145–154. IEEE (2012)Google Scholar
  6. 62.
    Guan, N., Ekberg, P., Stigge, M., Yi, W.: Effective and efficient scheduling of certifiable mixed-criticality sporadic task systems. In: Proceedings of the 2011 32nd IEEE Real-Time Systems Symposium (RTSS), pp. 13–23. IEEE (2011)Google Scholar
  7. 68.
    Hönig, U., Schiffmann, W.: A meta-algorithm for scheduling multiple dags in homogeneous system environments. In: Proceedings of the 8th IASTED International Conference on Parallel and Distributed Computing and Systems, pp. 147–152 (2006)Google Scholar
  8. 70.
    Hu, M., Luo, J., Wang, Y., Veeravalli, B.: Scheduling periodic task graphs for safety-critical time-triggered avionic systems. IEEE Trans. Aerosp. Electron. Syst. 51, 2294–2304 (2015)CrossRefGoogle Scholar
  9. 72.
    ISO, I.: 26262–road vehicles-functional safety. ISO Standard (2011)Google Scholar
  10. 105.
    Manolache, S., Eles, P., Peng, Z.: Task mapping and priority assignment for soft real-time applications under deadline miss ratio constraints. ACM Trans. Embed. Comput. Syst. (TECS) 7(2), 421–434 (2008)CrossRefGoogle Scholar
  11. 106.
    Mao, M., Humphrey, M.: Auto-scaling to minimize cost and meet application deadlines in cloud workflows. In: Proceedings of the 2011 International Conference for High Performance Computing, Networking, Storage and Analysis, p. 49. ACM (2011)Google Scholar
  12. 110.
    Mollison, M.S., Erickson, J.P., Anderson, J.H., Baruah, S.K., Scoredos, J.A.: Mixed-criticality real-time scheduling for multicore systems. In: Computer and Information Technology (CIT), 2010 IEEE 10th International Conference on, pp. 1864–1871. IEEE (2010)Google Scholar
  13. 122.
    Pop, P., Eles, P., Peng, Z.: Analysis and optimisation of heterogeneous real-time embedded systems. IEE Proc. Comput. Digit. Techniques 152(2), 130–147 (2005)CrossRefGoogle Scholar
  14. 132.
    Selicean, D.T., Pop, P.: Design optimization of mixed-criticality real-time applications on cost-constrained partitioned architectures. In: Real-Time Systems Symposium (RTSS), 2011 IEEE 32nd, pp. 24–33. IEEE (2011)Google Scholar
  15. 141.
    Tămaş-Selicean, D., Pop, P.: Optimization of time-partitions for mixed-criticality real-time distributed embedded systems. In: Object/Component/Service-Oriented Real-Time Distributed Computing Workshops (ISORCW), 2011 14th IEEE International Symposium on, pp. 1–10. IEEE (2011)Google Scholar
  16. 143.
    Tămaş-Selicean, D., Pop, P.: Design optimization of mixed-criticality real-time embedded systems. ACM Trans. Embed. Comput. S. 14(3), 1–29 (2015)CrossRefGoogle Scholar
  17. 144.
    Tămaş-Selicean, D., Pop, P., Steiner, W.: Design optimization of ttethernet-based distributed real-time systems. Real-Time Syst. 51(1), 1–35 (2015)CrossRefGoogle Scholar
  18. 152.
    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)CrossRefGoogle Scholar
  19. 156.
    Vestal, S.: Preemptive scheduling of multi-criticality systems with varying degrees of execution time assurance. In: Proceedings of the 28th IEEE International Real-Time Systems Symposium, pp. 239–243. IEEE (2007)Google Scholar
  20. 157.
    Wang, W., Wu, Q., Tan, Y., Wu, F.: Maximize throughput scheduling and cost-fairness optimization for multiple dags with deadline constraint. In: International Conference on Algorithms and Architectures for Parallel Processing, pp. 621–634. Springer (2015)Google Scholar
  21. 163.
    Xie, G., Li, R., Li, K.: Heterogeneity-driven end-to-end synchronized scheduling for precedence constrained tasks and messages on networked embedded systems. J. Parallel Distrib. Comput. 83, 1–12 (2015)CrossRefGoogle Scholar
  22. 169.
    Xie, G., Zeng, G., Liu, L., Li, R., Li, K.: High performance real-time scheduling of multiple mixed-criticality functions in heterogeneous distributed embedded systems. J. Syst. Archit. 70, 3–14 (2016)CrossRefGoogle Scholar
  23. 185.
    Zhao, H., Sakellariou, R.: Scheduling multiple DAGs onto heterogeneous systems. In: Parallel and Distributed Processing Symposium, 2006. IPDPS 2006. 20th International, pp. 159–172. IEEE (2006)Google Scholar

Copyright information

© Springer Nature Singapore Pte Ltd. 2019

Authors and Affiliations

  • Guoqi Xie
    • 1
  • Gang Zeng
    • 2
  • Renfa Li
    • 3
  • Keqin Li
    • 4
  1. 1.College of Computer Science and Electronic EngineeringHunan UniversityChangshaChina
  2. 2.Graduate School of EngineeringNagoya UniversityNagoyaJapan
  3. 3.Key Laboratory for Embedded and Cyber-Physical Systems of Hunan ProvinceHunan UniversityChangshaChina
  4. 4.Department of Computer ScienceState University of New YorkNew PaltzUSA

Personalised recommendations