Schedulability analysis of periodic and aperiodic tasks with resource constraints |
| |
| Affiliation: | 1. Institute of Solid Mechanics, Beihang University, Beijing 100191, China;2. School of Engineering, Cardiff University, Newport Road 30-36, CF24 ODE, Cardiff, United Kingdom;3. Aircraft and Propulsion Laboratory, Ningbo Institute of Technology, Beihang University, Ningbo 315100, China;1. Department of Economics, Diego Portales University, Santiago, Chile;2. Department of Economics and Finance, Brunel University London, United Kingdom;1. School of Electrical and Information Engineering, Jinan University (Zhuhai Campus), Zhuhai 519070, China;2. National Institute of Applied Sciences and Technology (INSAT), University of Carthage, Tunis 1080, Tunisia;3. Institute of Systems Engineering, Macau University of Science and Technology, Taipa 999078, Macau, China;4. School of Electro-Mechanical Engineering, Xidian University, Xi’an 710071, China;5. Automation and Energy Systems, Saarland University, Saarbrucken 66123, Germany;6. Key Laboratory of Embedded System and Service Computing, Ministry of Education, Tongji University, Shanghai 200092, China;7. Department of Electrical and Computer Engineering, New Jersey Institute of Technology Newark, NJ 07102, USA |
| |
| Abstract: | In this paper, we address the problem of scheduling hybrid task sets consisting of hard periodic and soft aperiodic tasks that may share resources in exclusive mode in a dynamic environment, where tasks are scheduled based on their deadlines. Bounded blocking on exclusive resources is achieved by means of a dynamic resource access protocol which also prevents deadlocks and chained blocking. Aperiodic responsiveness is enhanced by an efficient servicing technique which assigns each aperiodic request a suitable deadline. Feasibility conditions are extended to handle tasks with deadlines different from periods and a reclaiming technique is presented to deal with early completions. |
| |
| Keywords: | |
| 本文献已被 ScienceDirect 等数据库收录！ |
|
