Tianyi Wang
ABSTRACT
It is well known that a harmonic task set, i.e., task periods are integer multiples of each other, can better utilize a processor to achieve high system utilization. However, the current definition of harmonic task set is limited only to tasks with deadlines equal to their periods. In this paper, we extend the concept of "harmonic task set" to tasks with constrained deadlines, i.e., deadlines less than or equal to their periods. We show that a harmonic task set with constrained deadlines has a better schedulability than the non-harmonic one with the same task utilization. We employ this characteristic for task partitioning on multi-core platform, and our extensive experimental results show that, by taking the task harmonic relationship into consideration, our partitioning approach can greatly improve the schedulability of real-time tasks on multi-core platforms.
- B. Andersson and J. Jonsson. The utilization bounds of partitioned and pfair static-priority scheduling on multiprocessors are 50%. In Euromicro Conference on Real-Time Systems, pages 33--33. IEEE Computer Society, 2003.Google Scholar
Cross Ref
- E. Bini and G. C. Buttazzo. Measuring the performance of schedulability tests. Real-Time Syst., 30(1-2):129--154, May 2005. Google ScholarDigital Library
- E. Bini and G. C. Buttazzo. Measuring the performance of schedulability tests. Real-Time Systems, 30(1-2):129--154, 2005. Google ScholarDigital Library
- I. M. Bomze, M. Budinich, P. M. Pardalos, and M. Pelillo. The maximum clique problem. In Handbook of combinatorial optimization, pages 1--74. Springer, 1999.Google ScholarCross Ref
- V. Bonifaci, A. Marchetti-Spaccamela, N. Megow, and A. Wiese. Polynomial-time exact schedulability tests for harmonic real-time tasks. In Real-Time Systems Symposium, pages 236--245. IEEE, 2013. Google ScholarDigital Library
- J. Carpenter, S. Funk, P. Holman, A. Srinivasan, J. Anderson, and S. Baruah. A categorization of real-time multiprocessor scheduling problems and algorithms. Handbook on Scheduling Algorithms, Methods, and Models, pages, pages 30--1, 2004.Google Scholar
- E. G. Coffman Jr, M. R. Garey, and D. S. Johnson. Approximation algorithms for bin packing: a survey. In Approximation algorithms for NP-hard problems, pages 46--93. PWS Publishing Co., 1996. Google ScholarDigital Library
- R. I. Davis and A. Burns. A survey of hard real-time scheduling for multiprocessor systems. ACM Computing Surveys (CSUR), 43(4):35, 2011. Google ScholarDigital Library
- M. Fan and G. Quan. Harmonic-aware multi-core scheduling for fixed-priority real-time systems. Parallel and Distributed Systems, IEEE Transactions on, 25(6):1476--1488, June 2014. Google ScholarDigital Library
- C.-C. Han and H. ying Tyan. A better polynomial-time schedulability test for real-time fixed-priority scheduling algorithms. In Real-Time Systems Symposium, pages 36--45, Dec 1997. Google ScholarDigital Library
- T.-W. Kuo and A. K. Mok. Load adjustment in adaptive real-time systems. In Real-Time Systems Symposium, pages 160--170. IEEE, 1991.Google ScholarCross Ref
- C. Liu, J. J. Chen, L. He, and Y. Gu. Analysis techniques for supporting harmonic real-time tasks with suspensions. In 26th Euromicro Conference on Real-Time Systems, pages 201--210, July 2014. Google ScholarDigital Library
- M. Nasri, G. Fohler, and M. Kargahi. A framework to construct customized harmonic periods for real-time systems. In 26th Euromicro Conference on Real-Time Systems (ECRTS), pages 211--220. IEEE, 2014. Google ScholarDigital Library
- T. Wang, L. Niu, S. Ren, and G. Quan. Multi-core fixed-priority scheduling of real-time tasks with statistical deadline guarantee. In Design, Automation & Test in Europe Conference & Exhibition, pages 1335--1340. EDA Consortium, 2015. Google ScholarDigital Library
- On harmonic fixed-priority scheduling of periodic real-time tasks with constrained deadlines
Recommendations
Workload-Aware Harmonic Partitioned Scheduling of Periodic Real-Time Tasks with Constrained Deadlines
DAC '19: Proceedings of the 56th Annual Design Automation Conference 2019Multiprocessor platforms have been widely applied in safety-critical domains to accommodate the increasing computation requirement of modern real-time applications. In this paper, we present a workload-aware harmonic partitioned multiprocessor ...
Preference-oriented fixed-priority scheduling for periodic real-time tasks
A preference priority assignment (PPA) scheme that explicitly incorporates the ASAP and ALAP execution preferences of periodic real-time tasks is proposed.An online dual-queue based preference-oriented fixed- priority (POFP) scheduler is proposed 4, ...
Comments