Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

24

SODA
2010
ACM

favoriteEmaildiscussreport

151views Algorithms» more SODA 2010»

EDF-schedulability of synchronous periodic task systems is coNP-hard

14 years 8 months ago

EDF-schedulability of synchronous periodic task systems is coNP-hard

Download infoscience.epfl.ch

Friedrich Eisenbrand, Thomas Rothvoß

Real-time Traffic

Discrete Algorithms | SODA 2010 | Synchronous Periodic Task |

claim paper

Related Content

» Enhanced EDF Scheduling Algorithms for Orchestrating NetworkWide Active Measurements

» Reliable mode changes in realtime systems with fixed priority or EDF scheduling

» Efficient Synchronization under Global EDF Scheduling on Multiprocessors

» Dynamic voltage scaling of periodic and aperiodic tasks in prioritydriven systems

» PowerAware Scheduling of Mixed Task Sets in PriorityDriven Systems

» Tardiness Bounds for Global EDF with Deadlines Different from Periods

» ReliabilityAware Energy Management for Periodic RealTime Tasks

» FaultTolerant EarliestDeadlineFirst Scheduling Algorithm

» A Dynamic Voltage Scaling Algorithm for Sporadic Tasks

» Dynamic Response Time Optimization for SDF Graphs

Post Info
More Details (n/a)

Added	01 Mar 2010
Updated	02 Mar 2010
Type	Conference
Year	2010
Where	SODA
Authors	Friedrich Eisenbrand, Thomas Rothvoß

Comments (0)