103 search results - page 1 / 21 » A spatial path scheduling algorithm for EDGE architectures |
ASPLOS
2006
ACM
13 years 10 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...
GIS
2010
ACM
13 years 2 months ago
2010
ACM
The problem of point-to-point shortest path computation in spatial networks is extensively studied with many approaches proposed to speed-up the computation. Most of the existing ...
DAC
1993
ACM
13 years 8 months ago
1993
ACM
— We consider the resource-constrained scheduling of loops with interiteration dependencies. A loop is modeled as a data flow graph (DFG), where edges are labeled with the numbe...
SBACPAD
2003
IEEE
13 years 9 months ago
2003
IEEE
— Scheduling by Edge Reversal (SER) is a fully distributed scheduling mechanism based on the manipulation of acyclic orientations of a graph. This work uses SER to perform constr...
VLSID
2000
IEEE
13 years 8 months ago
2000
IEEE
The technique presented here achieves simultaneous optimization of schedule time and data path component cost within a structured data path architecture, using a genetic algorithm...