Sciweavers

936 search results - page 7 / 188
» Task Graph Scheduling Using Timed Automata
Sort
View
IPPS
1997
IEEE
13 years 11 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...
ICPADS
2006
IEEE
14 years 1 months ago
Efficient Compile-Time Task scheduling for Heterogeneous Distributed Computing Systems
Efficient task scheduling is essential for obtaining high performance in heterogeneous distributed computing systems (or HeDCSs). Because of its key importance, several scheduling...
Mohammad I. Daoud, Nawwaf N. Kharma
ICPP
2002
IEEE
14 years 11 days ago
Power Aware Scheduling for AND/OR Graphs in Multi-Processor Real-Time Systems
Power aware computing has become popular recently and many techniques have been proposed to manage the energy consumption for traditional real-time applications. We have previousl...
Dakai Zhu, Nevine AbouGhazaleh, Daniel Mossé...
TACAS
2004
Springer
97views Algorithms» more  TACAS 2004»
14 years 24 days ago
Resource-Optimal Scheduling Using Priced Timed Automata
Jacob Illum Rasmussen, Kim Guldstrand Larsen, K. S...
RTSS
2006
IEEE
14 years 1 months ago
Parallel Real-Time Task Scheduling on Multicore Platforms
We propose a scheduling method for real-time systems implemented on multicore platforms that encourages certain groups of equal-utilization tasks to be scheduled together. This me...
James H. Anderson, John M. Calandrino