Sciweavers

936 search results - page 31 / 188
» Task Graph Scheduling Using Timed Automata
Sort
View
ISPAN
2002
IEEE
14 years 2 months ago
Automatic Processor Lower Bound Formulas for Array Computations
In the directed acyclic graph (dag) model of algorithms, consider the following problem for precedence-constrained multiprocessor schedules for array computations: Given a sequenc...
Peter R. Cappello, Ömer Egecioglu
PDP
2010
IEEE
14 years 3 months ago
DAG Scheduling Using a Lookahead Variant of the Heterogeneous Earliest Finish Time Algorithm
Abstract—Among the numerous DAG scheduling heuristics suitable for heterogeneous systems, the Heterogeneous Earliest Finish Time (HEFT) heuristic is known to give good results in...
Luiz F. Bittencourt, Rizos Sakellariou, Edmundo R....
MICRO
2006
IEEE
132views Hardware» more  MICRO 2006»
14 years 3 months ago
Data-Dependency Graph Transformations for Superblock Scheduling
The superblock is a scheduling region which exposes instruction level parallelism beyond the basic block through speculative execution of instructions. In general, scheduling supe...
Mark Heffernan, Kent D. Wilken, Ghassan Shobaki
PRDC
2006
IEEE
14 years 3 months ago
Fault-Tolerant Partitioning Scheduling Algorithms in Real-Time Multiprocessor Systems
This paper presents the performance analysis of several well-known partitioning scheduling algorithms in real-time and fault-tolerant multiprocessor systems. Both static and dynam...
Hakem Beitollahi, Geert Deconinck
SIGMETRICS
2002
ACM
106views Hardware» more  SIGMETRICS 2002»
13 years 9 months ago
Analysis of methods for scheduling low priority disk drive tasks
This paper analyzes various algorithms for scheduling low priority disk drive tasks. The derived closed form solution is applicable to class of greedy algorithms that include a va...
Eitan Bachmat, Jiri Schindler