Sciweavers

457 search results - page 1 / 92
» Decay-Usage Scheduling in Multiprocessors
Sort
View
TOCS
1998
79views more  TOCS 1998»
13 years 4 months ago
Decay-Usage Scheduling in Multiprocessors
Dick H. J. Epema
IPPS
1997
IEEE
13 years 9 months ago
Fault-Tolerant Deadline-Monotonic Algorithm for Scheduling Hard-Real-Time Tasks
This paper presents a new fault-tolerant scheduling algorithm for multiprocessor hard-real-time systems. The so called partitioning method is used to schedule a set of tasks in a ...
Alan A. Bertossi, Andrea Fusiello, Luigi V. Mancin...
ECRTS
2006
IEEE
13 years 10 months ago
The Feasibility Analysis of Multiprocessor Real-Time Systems
The multiprocessor scheduling of collections of real-time jobs is considered. Sufficient tests are derived for determining whether a given collection of jobs can be scheduled to m...
Sanjoy K. Baruah, Nathan Fisher
ECRTS
2009
IEEE
13 years 2 months ago
Supporting Pipelines in Soft Real-Time Multiprocessor Systems
In work on multiprocessor real-time systems, processing pipelines have received little attention. In this paper, soft real-time periodic task systems are considered that include s...
Cong Liu, James H. Anderson
ECRTS
2007
IEEE
13 years 11 months ago
Tardiness Bounds for FIFO Scheduling on Multiprocessors
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...
Hennadiy Leontyev, James H. Anderson