Scheduling and Analysis of Global EDF for Multi-core Real-time Systems with Cache Partitioning

被引:0
作者
Lin Y.-H. [1 ]
Yan J. [1 ]
Wang K.-K. [1 ]
Deng Q.-X. [1 ]
机构
[1] School of Computer Science and Engineering, Northeastern University, Shenyang
来源
Dongbei Daxue Xuebao/Journal of Northeastern University | 2021年 / 42卷 / 12期
关键词
Cache partition; Earliest deadline first; Multi-core; Real-time embedded systems; Resource management;
D O I
10.12068/j.issn.1005-3026.2021.12.001
中图分类号
学科分类号
摘要
Multi-core real-time systems are significantly challenging to analyze due to the unpredictability from extensive contention over shared caches. Therefore, an efficient method, cache partitioning, is introduced into modern multi-core platforms to avoid cache access from co-executing cores, by which the timing predictability are improved. However, the cache space isolation technique may result in unbounded blocking because of the insufficient number of cache partitions. Unfortunately, the existing scheduling and analysis techniques cannot be applied to this situation. gEDFca, a cache-aware preemptive global earliest deadline first(EDF)scheduling algorithm was proposed for multi-core systems. And its analysis method was presented based on linear programming. Besides, a novel optimization algorithm was introduced for further improving schedulability. Evaluations using generation tasks show the proposed analysis method is highly efficient. It also shows that the optimization algorithm yields a significant improvement in schedulability. © 2021, Editorial Department of Journal of Northeastern University. All right reserved.
引用
收藏
页码:1673 / 1680
页数:7
相关论文
共 12 条
  • [1] Xu M, Phan L, Choi H, Et al., Analysis and implementation of global preemptive fixed-priority scheduling with dynamic cache allocation, IEEE Real-Time and Embedded Technology and Applications Symposium, pp. 1-12, (2016)
  • [2] Guan N, Stigge M, Yi W, Et al., Cache-aware scheduling and analysis for multicores, Proceedings of the 7th ACM International Conference on Embedded Software, pp. 245-254, (2009)
  • [3] Kessler R, Hill M., Page placement algorithms for large real-indexed caches, ACM Transactions on Computer Systems, 10, 4, pp. 338-359, (1992)
  • [4] Mancuso R, Dudko R, Betti E, Et al., Real-time cache management framework for multi-core architectures, IEEE Real-Time and Embedded Technology and Applications Symposium, pp. 45-54, (2013)
  • [5] Xu M, Phan L, Choi H, Et al., Holistic resource allocation for multicore real-time systems, IEEE Real-Time and Embedded Technology and Applications Symposium, pp. 345-356, (2019)
  • [6] Ward B C, Herman J L, Kenna C J, Et al., Making shared caches more predictable on multicore platforms, Euromicro Conference on Real-Time Systems, pp. 157-167, (2013)
  • [7] Xu M, Phan L, Choi H, Et al., vCAT: Dynamic cache management using CAT virtualization, IEEE Real-Time and Embedded Technology and Applications Symposium, pp. 211-222, (2017)
  • [8] Bertogna M, Cirinei M., Response-time analysis for globally scheduled symmetric multiprocessor platforms, IEEE Real-Time Systems Symposium, pp. 149-160, (2007)
  • [9] Baruah S, Fisher N., Global deadline-monotonic scheduling of arbitrary-deadline sporadic task systems, Proceedings of the 11th International Conference on Principles of Distributed Systems, pp. 204-216, (2007)
  • [10] Sun Y, Lipari G., Response time analysis with limited carry-in for global earliest deadline first scheduling, IEEE Real-Time Systems Symposium, pp. 130-140, (2015)