Sciweavers

402 search results - page 15 / 81
» Gang EDF Scheduling of Parallel Task Systems
Sort
View
RTS
2011
123views more  RTS 2011»
13 years 2 months ago
Feasibility analysis under fixed priority scheduling with limited preemptions
—Preemptive scheduling often generates a significant runtime overhead that may increase task worst-case execution times up to 40%, with respect to a fully non preemptive executi...
Gang Yao, Giorgio C. Buttazzo, Marko Bertogna
ECRTS
2007
IEEE
14 years 2 months ago
A Hybrid Real-Time Scheduling Approach for Large-Scale Multicore Platforms
We propose a hybrid approach for scheduling real-time tasks on large-scale multicore platforms with hierarchical shared caches. In this approach, a multicore platform is partition...
John M. Calandrino, James H. Anderson, Dan P. Baum...
ANSS
1997
IEEE
13 years 12 months ago
Performance Issues of Task Routing and Task Scheduling with Resequencing in Homogeneous Distributed Systems
An important part of a distributed system design is the workload sharing among the processors. This includes partitioningthe arriving jobs into tasks that can be executed in paral...
Anthony Karageorgos, Helen D. Karatza
IPPS
1997
IEEE
13 years 12 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...