Abstract
In many digital control systems, it is required to perform computation in a strictly periodic fashion to provide high control performance. System designers need to assign time slots that are infinitely repeated given a strict period for each task such that the time slots of different tasks do not overlap. While previous work has studied how to decide if a system is schedulable with a certain time slot assignment, it is still an unexplored area of how to select time slots for strictly periodic tasks to make them schedulable. In this paper, we propose an efficient method to solve the above problem. Our method explores the relations among task periods to improve the possibility of finding feasible start time configurations. Finally, we conduct experiments with randomly generated workload to evaluate the performance of the proposed method.
| Original language | English |
|---|---|
| Pages (from-to) | 61-68 |
| Journal | Journal of Systems Architecture |
| Volume | 66-67 |
| DOIs | |
| Publication status | Published - 1 May 2016 |
| Externally published | Yes |
Bibliographical note
Publication details (e.g. title, author(s), publication statuses and dates) are captured on an “AS IS” and “AS AVAILABLE” basis at the time of record harvesting from the data source. Suggestions for further amendments or supplementary information can be sent to [email protected].Research Keywords
- Embedded systems
- Real-time systems
- Schedulability analysis
- Scheduling
- Strictly periodic
Fingerprint
Dive into the research topics of 'Start time configuration for strictly periodic real-time task systems'. Together they form a unique fingerprint.Cite this
- APA
- Author
- BIBTEX
- Harvard
- Standard
- RIS
- Vancouver