Abstract | ||
---|---|---|
In this paper, we propose a jumper insertion algorithm under timing and antenna ratio constraints. Differently from the existing works which assume the jumpers to be placed above the highest layer of a routing tree, our work allows the jumpers to be placed on any routing layer. Furthermore, our algorithm is aware of the delay caused by the jumpers. Experimental results show that, by allowing the jumpers to be placed on any layer, the number of vias added by the jumpers can be reduced by 50%. The experiments also show that our timing-aware jumper insertion algorithm is better at satisfying the timing constraints.
|
Year | DOI | Venue |
---|---|---|
2011 | 10.1109/ICCAD.2011.6105344 | ICCAD |
Keywords | Field | DocType |
highest layer,routing tree,jumper insertion algorithm,antenna ratio,timing,antenna ratio constraint,timing constraint,timing constraints,routing layer,antennas,timing-aware jumper insertion algorithm,existing work,satisfiability,memristor,resistive ram | Memristor,Computer science,Algorithm,Real-time computing,Electronic engineering,Jumper,Resistive random-access memory | Conference |
ISSN | ISBN | Citations |
1092-3152 E-ISBN : 978-1-4577-1398-9 | 978-1-4577-1398-9 | 1 |
PageRank | References | Authors |
0.35 | 6 | 2 |
Name | Order | Citations | PageRank |
---|---|---|---|
Xin Gao | 1 | 191 | 35.12 |
Luca Macchiarulo | 2 | 240 | 19.08 |