- Author:
- Brinkley Sprunt
This thesis develops the Sporadic Server (SS) algorithm for scheduling aperiodic tasks in real-time systems. The SS algorithm is an extension of the rate monotonic algorithm which was designed to schedule periodic tasks. This thesis demonstrates that the SS algorithm is able to guarantee deadlines for hard-deadline aperiodic tasks and provide good responsiveness for soft-deadline aperiodic tasks while avoiding the schedulability penalty and implementation complexity of previous aperiodic service algorithms. It is also proven that the aperiodic servers created by the SS algorithm can be treated as equivalently-sized periodic tasks when assessing schedulability. This allows all the scheduling theories developed for the rate monotonic algorithm to be used to schedule aperiodic tasks. For scheduling aperiodic and periodic tasks that share data, this thesis defines the interactions and schedulability impact of using the SS algorithm with the priority inheritance protocols. For scheduling hard-deadline tasks with short deadlines, an extension of the rate monotonic algorithm and analysis is developed. To predict performance of the SS algorithm, this thesis develops models and equations that allow the use of standard queueing theory models to predict the average response time of soft-deadline aperiodic tasks serviced with a high-priority sporadic server. Implementation methods are also developed to support the SS algorithm in Ada and on the Futurebus+.
Cited By
- Zhang F, Liu Z, Wu Q, Wang S and Ma D (2023). Efficient schedulability analysis of hierarchical EDF scheduling with resource sharing, Journal of Systems Architecture: the EUROMICRO Journal, 135:C, Online publication date: 1-Feb-2023.
Yan Y and Ziarek L (2018). Application validation on RTDroid, ACM SIGBED Review, 15:4, (7-14), Online publication date: 20-Aug-2018.- Pop F, Dobre C, Cristea V, Bessis N, Xhafa F and Barolli L (2015). Deadline scheduling for aperiodic tasks in inter-Cloud environments, The Journal of Supercomputing, 71:5, (1754-1765), Online publication date: 1-May-2015.
- Clemente J, Resano J and Mozos D (2014). An approach to manage reconfigurations and reduce area cost in hard real-time reconfigurable systems, ACM Transactions on Embedded Computing Systems, 13:4, (1-24), Online publication date: 5-Dec-2014.
- Nejati S, Di Alesio S, Sabetzadeh M and Briand L Modeling and analysis of CPU usage in safety-critical embedded systems to support stress testing Proceedings of the 15th international conference on Model Driven Engineering Languages and Systems, (759-775)
- Wang W, Mishra P and Gordon-Ross A (2012). Dynamic Cache Reconfiguration for Soft Real-Time Systems, ACM Transactions on Embedded Computing Systems (TECS), 11:2, (1-31), Online publication date: 1-Jul-2012.
- Leyva-del-Foyo L, Mejia-Alvarez P and de Niz D (2012). Integrated Task and Interrupt Management for Real-Time Systems, ACM Transactions on Embedded Computing Systems (TECS), 11:2, (1-31), Online publication date: 1-Jul-2012.
- An K Resource management and fault tolerance principles for supporting distributed real-time and embedded systems in the cloud Proceedings of the 9th Middleware Doctoral Symposium of the 13th ACM/IFIP/USENIX International Middleware Conference, (1-6)
- Xi S, Wilson J, Lu C and Gill C RT-Xen Proceedings of the ninth ACM international conference on Embedded software, (39-48)
- Mezzetti E, Panunzio M and Vardanega T (2010). Temporal isolation with the ravenscar profile and Ada 2005, ACM SIGAda Ada Letters, 30:1, (45-55), Online publication date: 27-May-2010.
- Papazoglou P, Karras D and Papademetriou R (2008). On a new generation of event scheduling algorithms and evaluation techniques for efficient simulation modelling of large scale cellular networks bandwidth management based on multitasking theory, WSEAS TRANSACTIONS on COMMUNICATIONS, 7:10, (1024-1034), Online publication date: 1-Oct-2008.
- Papazoglou P, Karras D and Papademetriou R Concurrent events scheduling for efficient simulation modelling of large scale cellular networks based on multitasking real time scheduling techniques and analysis Proceedings of the 12th WSEAS international conference on Communications, (347-355)
- Kuo T, Chang L, Liu Y and Lin K (2003). Efficient Online Schedulability Tests for Real-Time Systems, IEEE Transactions on Software Engineering, 29:8, (734-751), Online publication date: 1-Aug-2003.
- Baker-Harvey M ETI resource distributor Proceedings of the third symposium on Operating systems design and implementation, (131-144)
- Sha L, Sathaye S and Strosnider J (1997). Analysis of Dual-Link Networks for Real-Time Applications, IEEE Transactions on Computers, 46:1, (1-13), Online publication date: 1-Jan-1997.
- Sathaye S, Katcher D and Strosnider J (1995). Fixed Priority Scheduling with Limited Priority Levels, IEEE Transactions on Computers, 44:9, (1140-1144), Online publication date: 1-Sep-1995.
- Katcher D, Arakawa H and Strosnider J (2019). Engineering and Analysis of Fixed Priority Schedulers, IEEE Transactions on Software Engineering, 19:9, (920-934), Online publication date: 1-Sep-1993.
- Arakawa H, Katcher D, Strosnider J and Tokuda H Modeling and validation of the real-time Mach scheduler Proceedings of the 1993 ACM SIGMETRICS conference on Measurement and modeling of computer systems, (195-206)
- Arakawa H, Katcher D, Strosnider J and Tokuda H (1993). Modeling and validation of the real-time Mach scheduler, ACM SIGMETRICS Performance Evaluation Review, 21:1, (195-206), Online publication date: 1-Jun-1993.
Recommendations
A non-preemptive scheduling algorithm for soft real-time systems
Real-time systems are often designed using preemptive scheduling and worst-case execution time estimates to guarantee the execution of high priority tasks. There is, however, an interest in exploring non-preemptive scheduling models for real-time ...