Efficient Feasibility Analysis for Real-Time Systems with EDF Scheduling
Proceedings of the conference on Design, Automation and Test in Europe - Volume 1
Optimal TDMA time slot and cycle length allocation for hard real-time systems
ASP-DAC '06 Proceedings of the 2006 Asia and South Pacific Design Automation Conference
The Partitioned Multiprocessor Scheduling of Deadline-Constrained Sporadic Task Systems
IEEE Transactions on Computers
Battery discharge aware energy feasibility analysis
CODES+ISSS '06 Proceedings of the 4th international conference on Hardware/software codesign and system synthesis
The partitioned dynamic-priority scheduling of sporadic task systems
Real-Time Systems
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
EDF-schedulability of synchronous periodic task systems is coNP-hard
SODA '10 Proceedings of the twenty-first annual ACM-SIAM symposium on Discrete Algorithms
Algorithms and complexity for periodic real-time scheduling
SODA '10 Proceedings of the twenty-first annual ACM-SIAM symposium on Discrete Algorithms
A scalable approach for the description of dependencies in hard real-time systems
ISoLA'10 Proceedings of the 4th international conference on Leveraging applications of formal methods, verification, and validation - Volume Part II
Assigning sporadic tasks to unrelated parallel machines
ICALP'12 Proceedings of the 39th international colloquium conference on Automata, Languages, and Programming - Volume Part I
Algorithms and complexity for periodic real-time scheduling
ACM Transactions on Algorithms (TALG)
Fast calculation of permissible slowdown factors for hard real-time systems
PATMOS'07 Proceedings of the 17th international conference on Integrated Circuit and System Design: power and timing modeling, optimization and simulation
PDPA: period driven task and cache partitioning algorithm for multi-core systems
Proceedings of the 20th International Conference on Real-Time and Network Systems
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
| Hi-index | 0.01 |
This paper presents a new approach to understand theevent stream model. Additionally a new approximationalgorithm for the feasibility test of the sporadic and thegeneralized multiframe task system scheduled by earliestdeadline first is presented. The new algorithm has polynomialcomplexity to solve the problem of schedulabilityanalysis. The approximation error of the algorithm isbounded. In contrary to earlier work, where the errordepends on the different deadlines of the tasks, the errorof our algorithm depends only on the capacity of the chosenprocessor. It guarantees the acceptances on a processorwith slightly higher capacity than the unknownoptimal processor. While the algorithm is scalable andthe run-time depends on the chosen error, a trade-offbetween running time and error is possible.