182 search results - page 13 / 37 » Benchmarking the Task Graph Scheduling Algorithms |
IPPS
2003
IEEE
15 years 2 months ago
2003
IEEE
In this paper, we consider the problem of scheduling independent identical tasks on heterogeneous processors where communication times and processing times are different. We assum...
109
click to vote
DATE
1997
IEEE
15 years 1 months ago
1997
IEEE
This paper describes new algorithms for systemlevel software synthesis, namely the scheduling and allocation of a set of complex tasks running at multiple rates on a heterogeneous...
113
Voted
PRDC
2006
IEEE
15 years 3 months ago
2006
IEEE
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...
DATE
2009
IEEE
15 years 4 months ago
2009
IEEE
—Scheduling task graphs under hard (end-to-end) timing constraints is an extensively studied NP-hard problem of critical importance for predictable software mapping on Multiproce...
CCGRID
2010
IEEE
14 years 7 months ago
2010
IEEE
Due to the strong increase of processing units available to the end user, expressing parallelism of an algorithm is a major challenge for many researchers. Parallel applications ar...