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 ...
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...
— 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...
suitable disk layout and network transmission schedule to minimize allocated resources (buffer size, bandwidth, ..., etc.) with maximum resource utilization. In this paper, the rea...
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...