Abstract
The uncertainty due to performance variations of IC chips and resource sharing on multi-core platforms have significantly degraded the predictability of real-time systems. Traditional deterministic approaches based on the worst-case assumptions become extremely pessimistic and thus unpractical. In this article, we address the problem of scheduling a set of fixed-priority periodic real-time tasks on multi-core platforms in a probabilistic manner. Specifically, we consider task execution time as a probabilistic distribution and study how to schedule these tasks on multi-core platforms with guaranteed Quality of Service (QoS) requirements in terms of deadline-missing probabilities. Moreover, it is a well-known fact that the relationship among task periods, if exploited appropriately, can significantly improve the processor utilization. To this end, we present a novel approach to partition real-time tasks that can take both task execution time distributions and their period relationships into consideration. From our extensive experiment results, our proposed methods can greatly improve the schedulability of real-time tasks when compared with existing approaches.
- ARINC. 2008. An avionics standard for safe, partitioned systems. In Wind River Systems/IEEE Seminar.Google Scholar
- A. Atlas and A. Bestavros. 1998. Statistical rate monotonic scheduling. In Proceedings of the 19th IEEE Real-Time Systems Symposium. 123--132. DOI:http://dx.doi.org/10.1109/REAL.1998.739737 Google Scholar
Cross Ref
- P. Axer and R. Ernst. 2013. Stochastic response-time guarantee for non-preemptive, fixed-priority scheduling under errors. In Proceedings of the 2013 50th ACM/EDAC/IEEE Design Automation Conference (DAC’13). 1--7. Google Scholar
Digital Library
- Enrico Bini, Giorgio Buttazzo, and Giuseppe Buttazzo. 2001. A hyperbolic bound for the rate monotonic algorithm. In Proceedings of the 13th Euromicro Conference on Real-Time Systems (ECRTS’01). IEEE Computer Society, Washington, D.C., 59--. http://dl.acm.org/citation.cfm?id=871910.871919 Google Scholar
Cross Ref
- Enrico Bini and Giorgio C. Buttazzo. 2005. Measuring the performance of schedulability tests. Real-Time Syst. 30, 1--2 (May 2005), 129--154. DOI:http://dx.doi.org/10.1007/s11241-005-0507-9 Google Scholar
Digital Library
- Vincenzo Bonifaci, Alberto Marchetti-Spaccamela, Nicole Megow, and Andreas Wiese. 2013. Polynomial-time exact schedulability tests for harmonic real-time tasks. In Proceedings of the 34th IEEE Real-Time Systems Symposium (RTSS’13). IEEE, 236--245. Google Scholar
Digital Library
- Romulo Silva de Oliveira and Joni da Silva Fraga. 2000. Fixed priority scheduling of tasks with arbitrary precedence constraints in distributed hard real-time systems. J. Syst. Archit. 46, 11 (2000), 991--1004. DOI:http://dx.doi.org/10.1016/S1383-7621(00)00004-7 Google Scholar
Cross Ref
- S. Edgar and A. Burns. 2001. Statistical analysis of WCET for scheduling. In Proceedings of the 22nd IEEE Real-Time Systems Symposium (RTSS’01). 215--224. DOI:http://dx.doi.org/10.1109/REAL.2001.990614 Google Scholar
Cross Ref
- Ming Fan, Qiushi Han, Shuo Liu, Shaolei Ren, Gang Quan, and Shangping Ren. 2015. Enhanced fixed-priority real-time scheduling on multi-core platforms by exploiting task period relationship. J. Syst. Softw. 99 (2015), 85--96. Google Scholar
Digital Library
- Ming Fan and Gang Quan. 2012. Harmonic semi-partitioned scheduling for fixed-priority real-time tasks on multi-core platform. In Proceedings of the Design, Automation Test in Europe Conference Exhibition (DATE’12). 503--508. DOI:http://dx.doi.org/10.1109/DATE.2012.6176521 Google Scholar
Cross Ref
- Ming Fan and Gang Quan. 2014. Harmonic-aware multi-core scheduling for fixed-priority real-time systems. IEEE Trans. Parallel Distrib. Syst. 25, 6 (June 2014), 1476--1488. DOI:http://dx.doi.org/10.1109/TPDS.2013.71 Google Scholar
Digital Library
- Michael R. Garey and David S. Johnson. 1990. Computers and Intractability; A Guide to the Theory of NP-Completeness. W. H. Freeman 8 Co., New York, NY.Google Scholar
- Nan Guan, Martin Stigge, Wang Yi, and Ge Yu. 2012. Parametric utilization bounds for fixed-priority multiprocessor scheduling. In Proceedings of the 2012 IEEE 26th International Parallel 8 Distributed Processing Symposium (IPDPS’12). IEEE, 261--272. Google Scholar
Digital Library
- Ching-Chih Han, Kwei-Jay Lin, and Chao-Ju Hou. 1996. Distance-constrained scheduling and its applications to real-time systems. IEEE Trans. Comput. 45, 7 (July 1996), 814--826. DOI:http://dx.doi.org/10.1109/12.508320 Google Scholar
Digital Library
- Ching-Chih Han and Hung-ying Tyan. 1997. A better polynomial-time schedulability test for real-time fixed-priority scheduling algorithms. In Proceedings of the 18th IEEE Real-Time Systems Symposium. IEEE, 36--45. Google Scholar
Cross Ref
- D. Johnson, A. Demers, J. Ullman, M. Garey, and R. Graham. 1974. Worst-case performance bounds for simple one-dimensional packing algorithms. SIAM J. Comput. 3, 4 (1974), 299--325. DOI:http://dx.doi.org/10.1137/0203025 Google Scholar
Digital Library
- Arvind Kandhalu, Karthik Lakshmanan, Junsung Kim, and Ragunathan Rajkumar. 2012. pCOMPATS: Period-compatible task allocation and splitting on multi-core processors. In Proceedings of the 2012 IEEE 18th Real-Time and Embedded Technology and Applications Symposium (RTAS’12). IEEE, 307--316. Google Scholar
Digital Library
- Kanghee Kim, J. L. Diaz, L. Lo Bello, J. M. Lopez, Chang-Gun Lee, and Sang-Lyul Min. 2005. An exact stochastic analysis of priority-driven periodic real-time systems and its approximations. IEEE Trans. Comput. 54, 11 (Nov 2005), 1460--1466. DOI:http://dx.doi.org/10.1109/TC.2005.174 Google Scholar
Digital Library
- Tei-Wei Kuo and A. K. Mok. 1991. Load adjustment in adaptive real-time systems. In Proceedings of the 1991 12th Real-Time Systems Symposium. 160--170. DOI:http://dx.doi.org/10.1109/REAL.1991.160369 Google Scholar
Cross Ref
- Sylvain Lauzac, Rami Melhem, and Daniel Mossé. 1998. An efficient RMS admission control and its application to multiprocessor scheduling. In Proceedings of the 1st Merged International Parallel Processing Symposium and Symposium on Parallel and Distributed Processing. IEEE, 511--518. Google Scholar
Cross Ref
- Sylvain Lauzac, Rami Melhem, and Daniel Mossé. 2003. An improved rate-monotonic admission control and its applications. IEEE Trans. Comput. 52, 3 (March 2003), 337--350. DOI:http://dx.doi.org/10.1109/TC.2003.1183948 Google Scholar
Digital Library
- J. P. Lehoczky. 1990. Fixed priority scheduling of periodic task sets with arbitrary deadlines. In Proceedings of the 1990 11th Real-Time Systems Symposium. 201--209. DOI:http://dx.doi.org/10.1109/REAL.1990.128748 Google Scholar
Cross Ref
- J. Lehoczky, Lui Sha, and Y. Ding. 1989. The rate monotonic scheduling algorithm: Exact characterization and average case behavior. In Proceedings of the 1989 Real-Time Systems Symposium. 166--171. DOI:http://dx.doi.org/10.1109/REAL.1989.63567 Google Scholar
Cross Ref
- Kenli Li, Xiaoyong Tang, and Keqin Li. 2014. Energy-efficient stochastic task scheduling on heterogeneous computing systems. IEEE Transactions on Parallel and Distributed Systems 25, 11 (2014), 2867--2876. Google Scholar
Cross Ref
- Kenli Li, Xiaoyong Tang, and Bharadwaj Veeravalli. 2015. Scheduling precedence constrained stochastic tasks on heterogeneous cluster systems. IEEE Transactions on Computers 64, 1 (2015), 191--204. Google Scholar
Cross Ref
- C. L. Liu and James W. Layland. 1973. Scheduling algorithms for multiprogramming in a hard-real-time environment. J. ACM 20, 1 (Jan. 1973), 46--61. DOI:http://dx.doi.org/10.1145/321738.321743 Google Scholar
Digital Library
- Wan-Chen Lu, Hsin-Wen Wei, and Kwei-Jay Lin. 2006. Rate monotonic schedulability conditions using relative period ratios. In Proceedings of the 12th IEEE International Conference on Embedded and Real-Time Computing Systems and Applications. 3--9. DOI:http://dx.doi.org/10.1109/RTCSA.2006.54 Google Scholar
Digital Library
- Yue Lu, T. Nolte, I. Bate, and L. Cucu-Grosjean. 2012. A statistical response-time analysis of real-time embedded systems. In Proceedings of the 2012 IEEE 33rd Real-Time Systems Symposium (RTSS’12). 351--362. DOI:http://dx.doi.org/10.1109/RTSS.2012.85 Google Scholar
Digital Library
- Mohamed Marouf and Yves Sorel. 2011. Scheduling non-preemptive hard real-time tasks with strict periods. In Proceedings of the 2011 IEEE 16th Conference on Emerging Technologies Factory Automation (ETFA’11). IEEE, 1--8.Google Scholar
Cross Ref
- Dorin Maxim, Olivier Buffet, Luca Santinelli, Liliana Cucu-Grosjean, and Robert I. Davis. 2011. Optimal priority assignment algorithms for probabilistic real-time systems. In RTNS. Citeseer, 129--138.Google Scholar
- Dorin Maxim and L. Cucu-Grosjean. 2013. Response time analysis for fixed-priority tasks with multiple probabilistic parameters. In Proceedings of the 2013 IEEE 34th Real-Time Systems Symposiu (RTSS’13). 224--235. DOI:http://dx.doi.org/10.1109/RTSS.2013.30 Google Scholar
Digital Library
- Dorin Maxim, Mike Houston, Luca Santinelli, Guillem Bernat, Robert I. Davis, and Liliana Cucu-Grosjean. 2012. Re-sampling for statistical timing analysis of real-time systems. In Proceedings of the 20th International Conference on Real-Time and Network Systems (RTNS’12). ACM, New York, NY, 111--120. DOI:http://dx.doi.org/10.1145/2392987.2393001 Google Scholar
Digital Library
- Mitra Nasri, Gerhard Fohler, and Mehdi Kargahi. 2014. A framework to construct customized harmonic periods for real-time systems. In Proceedings of the 2014 26th Euromicro Conference on Real-Time Systems (ECRTS’14). IEEE, 211--220. Google Scholar
Digital Library
- S. Nassif, K. Bernstein, D. J. Frank, A. Gattiker, W. Haensch, B. L. Ji, E. Nowak, D. Pearson, and N. J. Rohrer. 2007. High performance CMOS variability in the 65nm regime and beyond. In Proceedings of the IEEE International Electron Devices Meeting (IEDM’07). 569--571. DOI:http://dx.doi.org/10.1109/IEDM.2007.4419002 Google Scholar
Cross Ref
- L. Sha, R. Rajkumar, and J. P. Lehoczky. 1990. Priority inheritance protocols: An approach to real-time synchronization. IEEE Trans. Comput. 39, 9 (Sep 1990), 1175--1185. DOI:http://dx.doi.org/10.1109/12.57058 Google Scholar
Digital Library
- T.-S. Tia, Z. Deng, M. Shankar, M. Storch, J. Sun, L.-C. Wu, and J. W S. Liu. 1995. Probabilistic performance guarantee for real-time tasks with varying computation times. In Proceedings of the Real-Time Technology and Applications Symposium, 1995. Proceedings. 164--173. DOI:http://dx.doi.org/10.1109/RTTAS.1995.516213 Google Scholar
Cross Ref
- Tianyi Wang, Qiushi Han, Shi Sha, Wujie Wen, Gang Quan, and Meikang Qiu. 2016. On harmonic fixed-priority scheduling of periodic real-time tasks with constrained deadlines. In Proceedings of the 53rd Annual Design Automation Conference. ACM, 131. Google Scholar
Digital Library
- Tianyi Wang, Linwei Niu, Shaolei Ren, and Gang Quan. 2015. Multi-core fixed-priority scheduling of real-time tasks with statistical deadline guarantee. In Proceedings of the 2015 Design, Automation 8 Test in Europe Conference 8 Exhibition. EDA Consortium, 1335--1340. Google Scholar
Cross Ref
Index Terms
(auto-classified)Harmonicity-Aware Task Partitioning for Fixed Priority Scheduling of Probabilistic Real-Time Tasks on Multi-Core Platforms
Recommendations
Multi-core fixed-priority scheduling of real-time tasks with statistical deadline guarantee
DATE '15: Proceedings of the 2015 Design, Automation & Test in Europe Conference & ExhibitionThe rising performance variance of IC chips and increased resource sharing in multi-core platforms have significantly degraded the predictability of real-time systems. The traditional deterministic approaches can be extremely pessimistic, if not ...
Enhanced fixed-priority real-time scheduling on multi-core platforms by exploiting task period relationship
HighlightsThe utilization bound of task sets increases as task periods are closer to harmonic.We present two scheduling algorithms for real-time tasks on multi-core platforms.We take the period relationship among tasks into consideration.We formally ...
parMERASA -- Multi-core Execution of Parallelised Hard Real-Time Applications Supporting Analysability
DSD '13: Proceedings of the 2013 Euromicro Conference on Digital System DesignEngineers who design hard real-time embedded systems express a need for several times the performance available today while keeping safety as major criterion. A breakthrough in performance is expected by parallelizing hard real-time applications and ...






Comments