Sciweavers

130 search results - page 12 / 26
» Algorithms and Complexity for Periodic Real-Time Scheduling
Sort
View
DATE
2004
IEEE
135views Hardware» more  DATE 2004»
14 years 9 days ago
Quasi-Static Scheduling for Real-Time Systems with Hard and Soft Tasks
This report addresses the problem of scheduling for real-time systems that include both hard and soft tasks. In order to capture the relative importance of soft tasks and how the ...
Luis Alejandro Cortés, Petru Eles, Zebo Pen...
RTCSA
2006
IEEE
14 years 2 months ago
Computing the Minimum EDF Feasible Deadline in Periodic Systems
In most real-time applications, deadlines are artifices that need to be enforced to meet different performance requirements. For example, in periodic task sets, jitter requiremen...
Hoai Hoang, Giorgio C. Buttazzo, Magnus Jonsson, S...
RTCSA
2008
IEEE
14 years 3 months ago
Impact of Cache Partitioning on Multi-tasking Real Time Embedded Systems
Cache partitioning techniques have been proposed in the past as a solution for the cache interference problem. Due to qualitative differences with general purpose platforms, real-...
Bach Duy Bui, Marco Caccamo, Lui Sha, Joseph Marti...
RTAS
2007
IEEE
14 years 2 months ago
Real-Time Task Replication for Fault Tolerance in Identical Multiprocessor Systems
Multiprocessor platforms have been widely adopted in both embedded and server systems. In addition to the performance improvement, multiprocessor systems could have the flexibili...
Jian-Jia Chen, Chuan-Yue Yang, Tei-Wei Kuo, Shau-Y...
RTAS
1995
IEEE
14 years 3 days ago
A feasibility decision algorithm for rate monotonic scheduling of periodic real-time tasks
The rate monotonic scheduling algorithm is a commonly used task scheduling algorithm for periodic realtime task systems. This paper discusses feasibility decision for a given real...
Yoshifumi Manabe, Shigemi Aoyagi