Sciweavers

2274 search results - page 3 / 455
» Real-Time Scheduling in Distributed Systems
Sort
View
IPPS
1997
IEEE
15 years 1 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...
ISORC
2000
IEEE
15 years 1 months ago
A Distributed Real-Time Java System Based on CSP
CSP is a fundamental concept for developing software for distributed real-time systems. The CSP paradigm constitutes a natural addition to Object Orientation and offers higherorde...
Gerald H. Hilderink, Andry W. P. Bakkers, Jan F. B...
RTSS
1999
IEEE
15 years 1 months ago
Exploiting Precedence Relations in the Schedulability Analysis of Distributed Real-Time Systems
In this paper we present improved techniques for the schedulability analysis of tasks with precedence relations in multiprocessor and distributed systems, scheduled under a preemp...
José C. Palencia Gutiérrez, Michael ...
AINA
2008
IEEE
15 years 4 months ago
LRTG: Scheduling Distributed Real-Time Tasks in Unreliable and Untrustworthy Systems
We consider scheduling distributed real-time tasks in unreliable (e.g., those with arbitrary node and network failures) and untrustworthy systems (e.g., those with Byzantine node ...
Kai Han, Binoy Ravindran, E. Douglas Jensen
RTCSA
1999
IEEE
15 years 1 months ago
Scheduling Fault-Tolerant Distributed Hard Real-Time Tasks Independently of the Replication Strategies
Replication is a well-know fault-tolerance technique, and several replication strategies exist (e.g. active, passive, and semi-active replication). To be used in hard real-time sy...
Pascal Chevochot, Isabelle Puaut