FIFO scheduling is often considered to be inappropriate for scheduling workloads that are subject to timing constraints. However, FIFO is implemented in many generalpurpose OSs, a...
We devise the first constant-approximate feasibility test for sporadic multiprocessor real-time scheduling. We give an algorithm that, given a task system and > 0, correctly de...
Vincenzo Bonifaci, Alberto Marchetti-Spaccamela, S...
We investigate the preemptive scheduling of periodic tasks with hard deadlines. We show that, even in the uniprocessor case, no polynomial time algorithm can test the feasibility ...
Vincenzo Bonifaci, Ho-Leung Chan, Alberto Marchett...
An integrated platform which is capable of meeting the requirements of both traditional real-time control processing and multimedia processing has enormous potential for accommoda...
Hiroyuki Kaneko, John A. Stankovic, Subhabrata Sen...
We propose two server implementations for multiplexing aperiodic and recurrent (i.e., periodic, sporadic, or “rate-based”) real-time tasks in fair-scheduled multiprocessor sys...
Anand Srinivasan, Philip Holman, James H. Anderson