Abstract
Traditional hard real-time scheduling algorithms require the use of the worst-case execution times to guarantee that deadlines will be met. Unfortunately, many algorithms with parameters derived from sensing the physical world suffer large variations in execution time, leading to pessimistic overall utilization, such as visual recognition tasks. In this article, we present ZS-QRAM, a scheduling approach that enables the use of flexible execution times and application-derived utility to tasks in order to maximize total system utility. In particular, we provide a detailed description of the algorithm, the formal proofs for its temporal protection, and a detailed, evaluation. Our evaluation uses the Utility Degradation Resilience (UDR) showing that ZS-QRAM is able to obtain 4× as much UDR as ZSRM, a previous overbooking approach, and almost 2× as much UDR as Rate-Monotonic with Period Transformation (RM/TP). We then evaluate a Linux kernel module implementation of our scheduler on an Unmanned Air Vehicle (UAV) platform. We show that, by using our approach, we are able to keep the tasks that render the most utility by degrading lower-utility ones even in the presence of highly dynamic execution times.
- S. Baruah, H. Li, and L. Stougie. 2010. Towards the design of certifiable mixed-criticality systems. In Proceedings of the IEEE Real-Time Technology and Applications Symposium (RTAS'10). 13--22. Google Scholar
Digital Library
- S. Baruah and S. Vestal. 2008. Schedulability analysis of sporadic tasks with multiple criticality specifications. In Proceedings of the Euromicro Conference on Real-Time Systems (ECRTS'08). 147--155. Google Scholar
Digital Library
- G. Buttazzo, G. Lipari, and L. Abeni. 1998. Elastic task model for adaptive rate control. In Proceedings of the IEEE 19th Real-Time Systems Symposium (RTSS'98). 286. Google Scholar
Digital Library
- G. Buttazzo, M. Spuri, and F. Sensini. 1995. Value vs deadline scheduling in overload conditions. In Proceedings of the 16th IEEE Real-Time Systems Symposium (RTSS'95). 90. Google Scholar
Digital Library
- S. Cho, S.-K. Lee, A. Han, and K.-J. Lin. 2002. Efficient real-time scheduling algorithms for multiprocessor systems. IEICE Trans. Comm. E85-B, 2859--2867.Google Scholar
- M. Cirinei and T. Baker. 2007. EDZL scheduling analysis. In Proceedings of the Euromicro Conference on Real-Time Systems (ECRTS'08). 9--18. Google Scholar
Digital Library
- D. De Niz, K. Lakshmanan, and R. Rajkumar. 2009. On the scheduling of mixed-criticality real-time task sets. In Proceedings of the 30th IEEE Real-Time Systems Symposium (RTSS'09). 291--300. Google Scholar
Digital Library
- D. De Niz, L. Wrage, N. Storer, A. Rowe, and R. Rajkumar. 2012. On resource overbooking in an unmanned aerial vehicle. In Proceedings of the 3rd IEEE/ACM International Conference on Cyber-Physical Systems (ICCPS'12). 97--106. Google Scholar
Digital Library
- DRONE-RK. 2013. Drone-rk. http://www.drone-rk.org/.Google Scholar
- H.-M. Huan, C. Gill, and C. Lu. 2012. Implementation and evaluation of mixed-criticality scheduling approaches for periodic tasks. In Proceedings of the IEEE Real-Time Technology and Applications Symposium (RTAS'12). 22--32. Google Scholar
Digital Library
- M. Joseph and P. Padya. 1986. Finding response times in a real-time system. The Comput. J. 29, 5, 390--395.Google Scholar
Cross Ref
- S. Kato, R. Rajkumar, and Y. Ishikawa. 2009. A loadable real-time scheduler suite for multicore platforms. http://ertl.jp/~shinpei/papers/techrep09.pdf.Google Scholar
- K. Lakshmanan, D. De Niz, R. Rajkumar, and G. Moreno. 2010. Resource allocation in distributed mixed-criticality cyber-physical systems. In Proceedings of the 30th IEEE International Conference on Distributed Computing Systems (ICDCS'10). 169--178. Google Scholar
Digital Library
- C. L. Liu and J. W. Layland. 1973. Scheduling algorithms for multiprogramming in a hard-real-time environment. J. ACM 20, 1, 46--61. Google Scholar
Digital Library
- P. Mejia-Alvarez, R. Melhem, and D. Mosse. 2000. An incremental approach to scheduling during overloads in real-time systems. In Proceedings of the 21st IEEE Real-Time Systems Symposium (RTSS'00). 283--293. Google Scholar
Digital Library
- S. Oikawa and R. Rajkumar. 1999. Portable rk: A portable resource kernel for guaranteed and enforced timing behavior. In Proceedings of the 5th IEEE Real-Time Technology and Applications Symposium (RTAS'99). 111. Google Scholar
Digital Library
- Parrot. 2011. Parrot ar drone. http://ardrone.parrot.com/.Google Scholar
- R. Rajkumar, C. Lee, J. Lehoczky, and D. Siewiorek. 1997. A resource allocation model for qos management. In Proceedings of the 18th IEEE Real-Time Systems Symposium (RTSS'97). 298. Google Scholar
Digital Library
- C.-S. Shih, P. Ganti, and L. Sha. 2004. Schedulability and fairness for computation tasks in surveillance radar systems. In Proceedings of the 10th IEEE Real-Time Technology and Applications Symposium (RTAS'04).Google Scholar
- S. Vestal. 2007. Preemptive scheduling of multi-criticality systems with varying degrees of execution time assurance. In Proceedings of the 28th IEEE International Real-Time Systems Symposium (RTSS'07). 239--243. Google Scholar
Digital Library
- ZS-QRAM. 2013. ZS-QRAM documentation. http://andrew.cmu.edu/dionisio/projects.html.Google Scholar
Index Terms
Utility-Based Resource Overbooking for Cyber-Physical Systems
Recommendations
Adaptive data-aware utility-based scheduling in resource-constrained systems
This paper addresses the problem of the dynamic scheduling of data-intensive multiprocessor jobs. Each job requires some number of CPUs and some amount of data that needs to be downloaded into a local storage. The completion of each job brings some ...
A Utility Accrual Scheduling Algorithm for Real-Time Activities with Mutual Exclusion Resource Constraints
This paper presents a uni-processor real-time scheduling algorithm called the Generic Utility Scheduling algorithm (which we will refer to simply as GUS). GUS solves a previously open real-time scheduling problem—scheduling application activities that ...
Optimizing Expected Time Utility in Cyber-Physical Systems Schedulers
RTSS '10: Proceedings of the 2010 31st IEEE Real-Time Systems SymposiumClassical scheduling abstractions such as deadlines and priorities do not readily capture the complex timing semantics found in many real-time cyber-physical systems. Time utility functions provide a necessarily richer description of timing semantics, ...






Comments