Sensitivity analysis of complex embedded real-time systems
Real-Time Systems
Leakage-Aware Energy Efficient Scheduling for Fixed-Priority Tasks with Preemption Thresholds
ADMA '08 Proceedings of the 4th international conference on Advanced Data Mining and Applications
Robust priority assignment for messages on Controller Area Network (CAN)
Real-Time Systems
Proceedings of the 7th International Workshop on Java Technologies for Real-Time and Embedded Systems
NPC'07 Proceedings of the 2007 IFIP international conference on Network and parallel computing
Asynchronous event handling and safety critical Java
Proceedings of the 8th International Workshop on Java Technologies for Real-Time and Embedded Systems
Dual ceiling protocol for real-time synchronization under preemption threshold scheduling
Journal of Computer and System Sciences
Reducing stack with intra-task threshold priorities in real-time systems
EMSOFT '10 Proceedings of the tenth ACM international conference on Embedded software
Asynchronous event handling and Safety Critical Java
Concurrency and Computation: Practice & Experience
Robustness analysis for battery-supported cyber-physical systems
ACM Transactions on Embedded Computing Systems (TECS)
PT-AMC: integrating preemption thresholds into mixed-criticality scheduling
Proceedings of the Conference on Design, Automation and Test in Europe
Proceedings of the 21st International conference on Real-Time Networks and Systems
Best-case response times and jitter analysis of real-time tasks with arbitrary deadlines
Proceedings of the 21st International conference on Real-Time Networks and Systems
Hi-index | 0.00 |
This paper introduces and shows how to schedule two novel scheduling abstractions that overcome limitations of existing work on preemption threshold scheduling. The abstractions are task clusters, groups of tasks that are mutually non-preemptible by design, and task barriers, which partition the task set into subsets that must be mapped to different threads. Barriers prevent the preemption threshold logic that runs multiple design-time tasks in the same runtime thread from violating architectural constraints, e.g. by merging an interrupt handler and a user-level thread.We show that the preemption threshold logic for mapping tasks to as few threads as possible can rule out the schedules with the highest critical scaling factors 驴 these schedules are the least likely to miss deadlines under timing faults. We have developed a framework for robust CPU scheduling and three novel algorithms: an optimal algorithm for maximizing the critical scaling factor of a task set under restricted conditions, a more generally applicable heuristic that finds schedules with approximately maximal critical scaling factors, and a heuristic search that jointly maximizes the critical scaling factor of computed schedules and minimizes the number of threads required to run a task set. We demonstrate that our techniques for robust scheduling are applicable in a wide variety of situations where staticpriority scheduling is used.