Advertisement

Real-Time Scheduling for Periodic Tasks in Homogeneous Multi-core System with Minimum Execution Time

  • Ying LiEmail author
  • Jianwei Niu
  • Jiong Zhang
  • Mohammed Atiquzzaman
  • Xiang Long
Conference paper
Part of the Lecture Notes of the Institute for Computer Sciences, Social Informatics and Telecommunications Engineering book series (LNICST, volume 201)

Abstract

Scheduling of tasks in multicore parallel architectures is challenging due to the execution time being a nondeterministic value. We propose a task-affinity real-time scheduling heuristics algorithm (TARTSH) for periodic and independent tasks in a homogeneous multicore system based on a Parallel Execution Time Graph (PETG) to minimize the execution time. The main contributions of the paper include: construction of a Task Affinity Sequence through real experiment, finding the best parallel execution pairs and scheduling sequence based on task affinity, providing an efficient method to distinguish memory-intensive and memory-unintensive task. For experimental evaluation of our algorithm, a homogeneous multicore platform called NewBeehive with private L1 Cache and sharable L2 Cache has been designed. Theoretical and experimental analysis indicates that it is better to allocate the memory-intensive task and memory-unintensive task for execution in parallel. The experimental results demonstrate that our algorithm can find the optimal solution among all the possible combinations. The Maximum improvement of our algorithm is 15.6%).

Keywords

Task affinity Real-time scheduling Periodic tasks Homogeneous multicore system Beehive 

Notes

Acknowledgments

This work was supported by the National Natural Science Foundation of China (61572060, 61190125, 61472024), 973 Program (2013CB035503), and CERNET Innovation Project 2015 (NGII20151004).

References

  1. 1.
    Bastoni, A., Brandenburg, B.B., Anderson, J.H.: An empirical comparison of global, partitioned, and clustered multiprocessor EDF schedulers. In: Proceedings of the 31st IEEE Real-Time Systems Symposium (RTSS), pp. 14–24 (2010)Google Scholar
  2. 2.
    Liu, J.W.S.: Real-Time System. Pearson Education (2002)Google Scholar
  3. 3.
    Liu, C.L., Layland, J.W.: Scheduling algorithms for multiprogramming in a hard real time environment. J. ACM 20(1), 46–61 (1973)MathSciNetCrossRefzbMATHGoogle Scholar
  4. 4.
    Davari, S., Dhall, S.K.: An online algorithm for real-time tasks allocation. In: IEEE Real-time Systems Symposium, pp. 194–200 (l 986)Google Scholar
  5. 5.
    Baruah, S.K., Li, H., Stougie, L.: Towards the design of certifiable mixed-criticality systems. In: The Real-Time and Embedded Technology and Applications Symposium (RTAS), pp. 13–22 (2010)Google Scholar
  6. 6.
    Lauzac, S., Melhem, R., Mosse, D.: Comparison of global and partitioning schemes for scheduling rate monotonic tasks on a multiprocessor. In: 10th Euromicro Workshop on Real Time Systems, pp. 188–195, June 1998Google Scholar
  7. 7.
    Davis, R.I., Burns, A.: A survey of hard real-time scheduling for multiprocessor systems. ACM Comput. Surv. 4, 1–44 (2011)CrossRefzbMATHGoogle Scholar
  8. 8.
    Mok, A.K.: Fundamental design problems of distributed systems for the hard real-time environment. Ph.D. Dissertation, MIT (1983)Google Scholar
  9. 9.
    Lakshmanan, K., de Niz, D., Rajkumar, R., Moreno, G.: Resource allocation in distributed mixed-criticality cyber-physical systems. In: The 30th International Conference on Distributed Computing Systems (ICDCS), pp. 169–178 (2010)Google Scholar
  10. 10.
    De Niz, D., Lakshmanan, K., Rajkumar, R.: On the scheduling of mixed-criticality real-time task sets. In: The 30th Real-Time Systems Symposium (RTSS), pp. 291–300 (2009)Google Scholar
  11. 11.
    Guan, N., Ekberg, P., Stigge, M., Yi, W.: Effective and efficient scheduling of certifiable mixed-criticality sporadic task systems. In: The 32rd Real-Time Systems Symposium (RTSS), pp. 13–23 (2011)Google Scholar
  12. 12.
    Burchard, A., Liebeherr, J., Oh, Y.F., Son, S.H.: New strategies for assigning real-time tasks to multiprocessor systems. IEEE Trans. on Comput. 44(12), 1429–1442 (1995)MathSciNetCrossRefzbMATHGoogle Scholar
  13. 13.
    Han, C.C., Tyan, H.: A better polynomial-time schedulability test for real-time fixed-priority scheduling algorithms. In: The 18th IEEE Real-Time Systems Symposium, San Francisco, pp. 36–45 (1997)Google Scholar
  14. 14.
    Lu, J., Das, A., et al.: Dynamic helper threaded prefetching on the sun ultra SPARC CMP processor. In: The 38th Microarchitecture, pp. 93–104, October 2005Google Scholar
  15. 15.
    Kim, S., Chandra, D., Solihin, Y.: Fair cache sharing and partitioning in a chip multiprocessor architecture. In: 13th International Conference on Parallel Architecture and Compilation Techniques, Los Alamitos, CA, pp. 111–122 (2004)Google Scholar
  16. 16.
    Fedorova, A.: Operating System Scheduling for Chip Multithreaded Processors. Ph.D. thesis, Harvard University (2006)Google Scholar
  17. 17.
    Benhai, Z., Jianzhong, Q., Shukuan, L.: Dynamic shared cache allocation algorithm for multicore professor. J. Northeast. Univ. 32(1), 44–47 (2011)Google Scholar
  18. 18.
    Shao, J., Davis, T.: A burst scheduling access reordering mechanism. In: 13th International Symposium on High Performance Computer Architecture, pp. 285–294 (2007)Google Scholar
  19. 19.
    Stigge, M., Ekberg, P., Guan, N., et al.: On the tractability of digraph-based task models. In: 23rd Euromicro Conference on Real-Time Systems (ECRTS), Porto, Portugal, pp. 162–171 (2011)Google Scholar

Copyright information

© ICST Institute for Computer Sciences, Social Informatics and Telecommunications Engineering 2017

Authors and Affiliations

  • Ying Li
    • 1
    Email author
  • Jianwei Niu
    • 1
  • Jiong Zhang
    • 1
  • Mohammed Atiquzzaman
    • 2
  • Xiang Long
    • 1
  1. 1.State Key Laboratory of Software Development Environment, School of Computer Science and EngineeringBeihang UniversityBeijingChina
  2. 2.School of Computer ScienceUniversity of OklahomaNormanUSA

Personalised recommendations