4 search results - page 1 / 1 » Datapath routing based on a decongestion metric |
ISPD
2000
ACM
13 years 9 months ago
2000
ACM
For a four-layer datapath routing environment, we present an algorithm that considers all the nets simultaneously. Routing probabilities are calculated for potential routing regio...
ISCAS
1995
IEEE
13 years 8 months ago
1995
IEEE
We present a novel technique for datapath allocation, which incorporates interconnection area and delay estimates based on dynamic oorplanning. In this approach, datapath area is ...
IWAN
2004
Springer
13 years 10 months ago
2004
Springer
Active and programmable network technologies strive to support completely new forms of data-path processing capabilities inside the network. This in conjunction with the ability to...
DAC
2010
ACM
13 years 6 months ago
2010
ACM
This work proposes a new problem of identifying large and tangled logic structures in a synthesized netlist. Large groups of cells that are highly interconnected to each other can...