Abstract
In embedded real-time systems, task priorities are often assigned to meet deadlines. However, in control tasks, a late completion of a task has no catastrophic consequence; rather, it has a quantifiable impact in the control performance achieved by the task.
In this article, we address the problem of determining the optimal assignment of priorities and periods of sampled-data control tasks that run over a shared computation unit. We show that the minimization of the overall cost can be performed efficiently using a branch and bound algorithm that can be further speeded up by allowing for a small degree of suboptimality. Detailed numerical simulations are presented to show the advantages of various branching alternatives, the overall algorithm effectiveness, and its scalability with the number of tasks.
- Eitan Altman and Adam Shwartz. 1989. Optimal priority assignment: A time sharing approach. IEEE Trans. Autom. Control 34, 10, 1098--1102.Google Scholar
Cross Ref
- Amir Aminifar, Enrico Bini, Petru Eles, and Zebo Peng. 2014. Bandwidth-efficient controller — Server co-design with stability guarantees. In Proceedings of the Design, Automation and Test in Europe Conference (DATE'14). Google Scholar
Digital Library
- Amir Aminifar, Soheil Samii, Petru Eles, Zebo Peng, and Anton Cervin. 2012. Designing high-quality embedded control systems with guaranteed stability. In Proceedings of the 33rd IEEE Real-Time Systems Symposium (RTSS'12). Google Scholar
Digital Library
- Karl-Johan Åström and Björn Wittenmark. 1997. Computer-Controlled Systems: Theory and Design 3rd Ed. Prentice Hall.Google Scholar
- Neil Audsley. 1991. Optimal priority assignment and feasibility of static priority tasks with arbitrary start times. Tech. rep. YCS 164, Department of Computer Science, University of York.Google Scholar
- Enrico Bini and Anton Cervin. 2008. Delay-aware period assignment in control systems. In Proceedings of the 29th IEEE Real-Time Systems Symposium (RTSS'08). 291--300. Google Scholar
Digital Library
- Enrico Bini, Thi Huyen Chau Nguyen, Pascal Richard, and Sanjoy K. Baruah. 2009. A response-time bound in fixed-priority scheduling with arbitrary deadlines. IEEE Trans. Comput. 58, 2, 279--286. Google Scholar
Digital Library
- Renu Chipalkatti, James F. Kurose, and Don Towsley. 1989. Scheduling policies for real-time and non-real-time traffic in a statistical multiplexer. In Proceedings of the 8th Annual Joint Conference of the IEEE Computer and Communications Societies (INFOCOM'89). 774--783.Google Scholar
Cross Ref
- Gene Franklin, Abbas Emami-Naeini, and J. Davis Powell. 1994. Feedback Control of Dynamic Systems 3rd Ed. Addison-Wesley Longman. Google Scholar
Digital Library
- Huijun Gao, Weichao Sun, and Peng Shi. 2010. Robust sampled-data control for vehicle active suspension systems. IEEE Trans. Control Syst. Technol. 18, 238--245.Google Scholar
Cross Ref
- Reiner Horst and Hoang Tuy. 1990. Global Optimization: Deterministic Approaches. Springer.Google Scholar
Cross Ref
- Mathai Joseph and Paritosh K. Pandya. 1986. Finding response times in a real-time system. Comput. J. 29, 5, 390--395.Google Scholar
Cross Ref
- Chung-Yao Kao and Anders Rantzer. 2007. Stability analysis of systems with uncertain time-varying delays. Automatica 43, 6, 959--970. Google Scholar
Digital Library
- Ryou Kondo and Katsuhisa Furuta. 1985. Sampled-data optimal control of continuous systems for quadratic criterion function taking account of delayed control action. Int. J. Control 41, 1051--1060.Google Scholar
Cross Ref
- Huibert Kwakernaak and Raphael Sivan. 1972. Linear Optimal Control Systems. John Wiley and Sons. Google Scholar
Digital Library
- Joseph Y.-T. Leung and Jennifer Whitehead. 1982. On the complexity of fixed-priority scheduling of periodic real-time tasks. Perform. Eval. 2, 4, 237--250.Google Scholar
Cross Ref
- Chung Laung Liu and James W. Layland. 1973. Scheduling algorithms for multiprogramming in a hard real-time environment. J. ACM 20, 1, 46--61. Google Scholar
Digital Library
- Giulio M. Mancuso, Enrico Bini, and Gabriele Pannocchia. 2011. Optimal computational resource allocation for control task under fixed priority scheduling. In Proceedings of the 18th IFAC World Congress. Vol. 18. 12599--12604.Google Scholar
Cross Ref
- Philippe Nain and Keith W. Ross. 1986. Optimal priority assignment with hard constraint. IEEE Trans. Autom. Control 31, 10, 883--888.Google Scholar
Cross Ref
- Johan Nilsson, Bo Bernhardsson, and Björn Wittenmark. 1998. Stochastic analysis and control of real-time systems with random time delays. Automatica 34, 1, 57--64. Google Scholar
Digital Library
- R. Gary Parker and Ronald L. Rardin. 1988. Discrete Optimization. Academic Press. Google Scholar
Digital Library
- Danbing Seto, John P. Lehoczky, Lui Sha, and Kang G. Shin. 1996. On task schedulability in real-time control systems. In Proceedings of the 17th IEEE Real-Time Systems Symposium (RTSS'96). 13--21. Google Scholar
Digital Library
- M. Shin and Myoungho Sunwoo. 2007. Optimal period and priority assignment for a networked control system scheduled by a fixed priority scheduling system. Int. J. Automot. Technol. 8, 1, 39--48.Google Scholar
- Martin Stigge, Pontus Ekberg, Nan Guan, and Wang Yi. 2011. The digraph real-time task model. In Proceeding of the 17th IEEE Real-Time and Embedded Technology and Applications Symposium. 71--80. Google Scholar
Digital Library
- Spyros Tzafestas and Alekos Triantafyllakis. 1993. Deterministic scheduling in computing and manufacturing systems: A survey of models and algorithms. Math. Comput. Simul. 35, 5, 97--434. Google Scholar
Digital Library
- Yifan Wu, Giorgio Buttazzo, Enrico Bini, and Anton Cervin. 2010. Parameter selection for real-time controllers in resource-constrained systems. IEEE Trans. Industr. Inf. 6, 4, 610--620.Google Scholar
Cross Ref
- Yang Xu, Karl-Erik Arzén, Enrico Bini, and Anton Cervin. 2014. Response time driven design of control systems. In Proceedings of the 19th IFAC World Congress.Google Scholar
Cross Ref
Index Terms
Optimal Priority Assignment to Control Tasks
Recommendations
Optimal priority assignment for real-time systems: a coevolution-based approach
AbstractIn real-time systems, priorities assigned to real-time tasks determine the order of task executions, by relying on an underlying task scheduling policy. Assigning optimal priority values to tasks is critical to allow the tasks to complete their ...
A review of priority assignment in real-time systems
It is over 40 years since the first seminal work on priority assignment for real-time systems using fixed priority scheduling. Since then, huge progress has been made in the field of real-time scheduling with more complex models and schedulability ...
Semaphore Queue Priority Assignment for Real-Time Multiprocessor Synchronization
Prior work on real-time scheduling with global shared resources in multiprocessor systems assigns as much blocking as possible to the lowest-priority tasks. In this paper, we show that better schedulability can be achieved if global blocking is ...






Comments