Interactive schedulability analysis
ACM Transactions on Embedded Computing Systems (TECS)
A Constant-Approximate Feasibility Test for Multiprocessor Real-Time Scheduling
ESA '08 Proceedings of the 16th annual European symposium on Algorithms
Journal of Embedded Computing - Best Papers of RTS' 2005
Constant-time admission control for deadline monotonic tasks
Proceedings of the Conference on Design, Automation and Test in Europe
EDF-schedulability of synchronous periodic task systems is coNP-hard
SODA '10 Proceedings of the twenty-first annual ACM-SIAM symposium on Discrete Algorithms
WAOA'10 Proceedings of the 8th international conference on Approximation and online algorithms
Sharp utilization thresholds for some realtime scheduling problems
ACM SIGMETRICS Performance Evaluation Review
Efficient location-based decision-supporting content distribution to mobile groups
IEEE/ACM Transactions on Networking (TON)
Lowest priority first based feasibility analysis of real-time systems
Journal of Parallel and Distributed Computing
Approximation scheme for real-time tasks under fixed-priority scheduling with deferred preemption
Proceedings of the 21st International conference on Real-Time Networks and Systems
Bandwidth allocation for fixed-priority-scheduled compositional real-time systems
ACM Transactions on Embedded Computing Systems (TECS)
A new concept for system-level design of runtime reconfigurable real-time systems
ACM SIGBED Review - Special Issue on the 5th Workshop on Adaptive and Reconfigurable Embedded Systems
| Hi-index | 0.00 |
Current feasibility tests for the static-priority scheduling on uniprocessors of periodic task systems run in pseudo-polynomial time. We present a fully polynomial-time approximation scheme (FPTAS) for feasibility analysis in static-priority systems with arbitrary relative deadlines. This test is an approximation with respect to the amount of a processorýs capacity that must be "sacrificed" for the test to become exact. We show that an arbitrary level of accuracy, ?, may be chosen for the approximation scheme, and present a runtime bound that is polynomial in terms of ? and the number of tasks, n.