182 search results - page 17 / 37 » Benchmarking the Task Graph Scheduling Algorithms |
62
Voted
DAC
2009
ACM
15 years 10 months ago
2009
ACM
For a number of years, dataflow concepts have provided designers of digital signal processing systems with environments capable of expressing high-level software architectures as ...
SBACPAD
2005
IEEE
15 years 3 months ago
2005
IEEE
The Data-Flow Graph (DFG) of a parallel application is frequently used to take scheduling decisions, based on the information that it models (dependencies among the tasks and volu...
79
Voted
ICCAD
1994
IEEE
15 years 1 months ago
1994
IEEE
Identifying mutual exclusiveness between operators during behavioral synthesis is important in order to reduce the required number of control steps or hardware resources. To impro...
68
Voted
ASPLOS
2006
ACM
15 years 3 months ago
2006
ACM
Growing on-chip wire delays are motivating architectural features that expose on-chip communication to the compiler. EDGE architectures are one example of communication-exposed mi...
IEEEPACT
1998
IEEE
15 years 1 months ago
1998
IEEE
Compile-time scheduling is one approach to extract parallelism which has proved effective when the execution behavior is predictable. Unfortunately, the performance of most priori...