Sciweavers

34 search results - page 5 / 7
» A Constant-Approximate Feasibility Test for Multiprocessor R...
Sort
View
ECRTS
2007
IEEE
14 years 3 days ago
The Global Feasibility and Schedulability of General Task Models on Multiprocessor Platforms
Feasibility analysis determines (prior to system execution-time) whether a specified collection of hard-realtime jobs executed on a processing platform can meet all deadlines. In...
Nathan Fisher, Sanjoy K. Baruah
ECRTS
1998
IEEE
13 years 10 months ago
Using exact feasibility tests for allocating real-time tasks in multiprocessor systems
This paper introduces improvements in partitioning schemes for multiprocessor real-time systems which allow higher processor utilization and enhanced schedulability by using exact...
Sergio Saez, Joan Vila i Carbó, Alfons Cres...
PARELEC
2002
IEEE
13 years 10 months ago
Real-Time Scheduling in Distributed Systems
In this paper, we investigate the worst case performance of Earliest Due Date algorithm when applied to packet scheduling in distributed systems. We assume that the processing ele...
Nguyen Duc Thai
ECRTS
2004
IEEE
13 years 9 months ago
An Event Stream Driven Approximation for the Analysis of Real-Time Systems
This paper presents a new approach to understand the event stream model. Additionally a new approximation algorithm for the feasibility test of the sporadic and the generalized mu...
Karsten Albers, Frank Slomka
RTAS
2005
IEEE
13 years 11 months ago
Energy-Aware Task Allocation for Rate Monotonic Scheduling
We consider the problem of energy minimization for periodic preemptive hard real-time tasks that are scheduled on an identical multiprocessor platform with dynamic voltage scaling...
Tarek A. AlEnawy, Hakan Aydin