Sciweavers

69 search results - page 10 / 14
» Mixed-Criticality Scheduling of Sporadic Task Systems
Sort
View
RTAS
2011
IEEE
13 years 2 months ago
A Lookup-Table Driven Approach to Partitioned Scheduling
The partitioned preemptive EDF scheduling of implicitdeadline sporadic task systems on an identical multiprocessor platform is considered. Lookup tables, at any selected degree of...
Bipasa Chattopadhyay, Sanjoy K. Baruah
ECRTS
2005
IEEE
14 years 4 months ago
Improved Schedulability Analysis of EDF on Multiprocessor Platforms
Multiprocessor hardware platforms are now being considered for embedded systems, due to their high computational power and little additional cost when compared to single processor...
Marko Bertogna, Michele Cirinei, Giuseppe Lipari
RTSS
1999
IEEE
14 years 3 months ago
A Framework for Scheduler Synthesis
In this paper we present a framework integrating speci cation and scheduler generation for real-time systems. In a rst step, the system, which can include arbitrarily designed tas...
Karine Altisen, Gregor Gößler, Amir Pnu...
OPODIS
2010
13 years 8 months ago
Tardiness Bounds for Global EDF with Deadlines Different from Periods
The Earliest Deadline First (EDF) scheduling algorithm is known to be suboptimal for meeting all deadlines under global scheduling on multiprocessor platforms. However, EDF is an a...
Jeremy Erickson, Nan Guan, Sanjoy K. Baruah
ESA
2008
Springer
153views Algorithms» more  ESA 2008»
14 years 16 days ago
A Constant-Approximate Feasibility Test for Multiprocessor Real-Time Scheduling
We devise the first constant-approximate feasibility test for sporadic multiprocessor real-time scheduling. We give an algorithm that, given a task system and > 0, correctly de...
Vincenzo Bonifaci, Alberto Marchetti-Spaccamela, S...