Sciweavers

506 search results - page 5 / 102
» State-Dependent Deadline Scheduling
Sort
View
JCSS
2007
63views more  JCSS 2007»
13 years 7 months ago
Holistic analysis of asynchronous real-time transactions with earliest deadline scheduling
In distributed real-time systems, an application is often modeled as a set of real-time transactions, where each transaction is a chain of precedence-constrained tasks. Each task ...
Rodolfo Pellizzoni, Giuseppe Lipari
RTS
2002
111views more  RTS 2002»
13 years 7 months ago
Robust Adaptive Metrics for Deadline Assignment in Distributed Hard Real-Time Systems
Distributed real-time applications usually consist of several component tasks and must be completed by its end-to-end (E-T-E) deadline. As long as the E-T-E deadline of an applicat...
Jan Jonsson, Kang G. Shin
ICC
2007
IEEE
14 years 1 months ago
Wireless Packet Scheduling With Soft Deadlines
— We address the problem of scheduling multiple traffic streams associated with target profiles on a shared wireless link, arising in real-time applications with soft/flexible...
Aditya Dua, Nicholas Bambos
RTSS
1998
IEEE
13 years 11 months ago
Deadline-Modification-SCAN with Maximum-Scannable-Groups for Multimedia Real-Time Disk Scheduling
suitable disk layout and network transmission schedule to minimize allocated resources (buffer size, bandwidth, ..., etc.) with maximum resource utilization. In this paper, the rea...
Ray-I Chang, Wei Kuan Shih, Ruei-Chuan Chang
RTS
2010
103views more  RTS 2010»
13 years 5 months ago
LRE-TL: an optimal multiprocessor algorithm for sporadic task sets with unconstrained deadlines
This article presents a detailed discussion of LRE-TL (Local Remaining Execution - TL-plane), an algorithm that schedules hard real-time periodic and sporadic task sets with uncon...
Shelby Funk