Sciweavers

192 search results - page 22 / 39
» Preemptive Scheduling with Rejection
Sort
View
ECRTS
2010
IEEE
13 years 11 months ago
Preemption Points Placement for Sporadic Task Sets
Abstract--Limited preemption scheduling has been introduced as a viable alternative to non-preemptive and fullypreemptive scheduling when reduced blocking times need to coexist wit...
Marko Bertogna, Giorgio C. Buttazzo, Mauro Marinon...
DATE
2008
IEEE
95views Hardware» more  DATE 2008»
14 years 4 months ago
Improvements in Polynomial-Time Feasibility Testing for EDF
This paper presents two fully polynomial-time sufficient feasibility tests for EDF when considering periodic tasks with arbitrary deadlines and preemptive scheduling on uniproces...
Alejandro Masrur, Sebastian Drossler, Georg Farber
CODES
2000
IEEE
14 years 2 months ago
Performance estimation for embedded systems with data and control dependencies
In this paper we present an approach to performance estimation for hard real-time systems. We consider architectures consisting of multiple processors. The scheduling policy is ba...
Paul Pop, Petru Eles, Zebo Peng
APLAS
2009
ACM
14 years 1 months ago
On Stratified Regions
Type and effect systems are a tool to analyse statically the behaviour of programs with effects. We present a proof based on the so called reducibility candidates that a suitable ...
Roberto M. Amadio
FPL
2009
Springer
142views Hardware» more  FPL 2009»
14 years 1 months ago
Cooperative multithreading in dynamically reconfigurable systems
Preemptive multitasking, a popular technique for timesharing of computational resources in software-based systems, faces considerable difficulties when applied to partially reconf...
Enno Lübbers, Marco Platzner