Mostrar registro simples

dc.contributor.authorHentschke, Renato Fernandespt_BR
dc.contributor.authorNarasimhan, Jaganathanpt_BR
dc.contributor.authorJohann, Marcelo de Oliveirapt_BR
dc.contributor.authorReis, Ricardo Augusto da Luzpt_BR
dc.date.accessioned2011-01-29T06:00:44Zpt_BR
dc.date.issued2009pt_BR
dc.identifier.issn1063-8210pt_BR
dc.identifier.urihttp://hdl.handle.net/10183/27623pt_BR
dc.description.abstractIn this paper, we address the problem of generating good topologies of rectilinear Steiner trees using path search algorithms. Various techniques have been applied in order to achieve acceptable run times on a Maze Router that builds Steiner trees. A biasing technique proposed for wire length improvement, produces trees that are within 2% from optimal topologies in average. By introducing a sharing factor and a path-length factor we show how to trade-off wire length for delay. Experimental results show that our algorithm generates topologies with better delay compared to state of the art heuristics for Steiner trees, such as AHHK (from 26% to 40%) and P-Trees (from 1% to 30% and from 6% to 21% in the presence of blockages) while keeping the properties of a routing algorithm. An important motivation for this work lies in the fact that it can be used for estimation in the early stages as well as for actual routing, thereby improving the convergence and timing closure of the design significantly.We also provide some valuable theoretical background and insights on delay optimization and on how it relates to our maze router implementation.en
dc.format.mimetypeapplication/pdfpt_BR
dc.language.isoengpt_BR
dc.relation.ispartofIEEE transactions on very large scale integration (VLSI) systems. New York. Vol. 17, no 8 (Aug. 2009), p. 1073-1086pt_BR
dc.rightsOpen Accessen
dc.subjectMicroeletrônicapt_BR
dc.subjectDelayen
dc.subjectMaze searchen
dc.subjectVlsipt_BR
dc.subjectRoutingen
dc.subjectSteiner treesen
dc.titleMaze routing steiner trees with delay versus wire length tradeoffpt_BR
dc.typeArtigo de periódicopt_BR
dc.identifier.nrb000715665pt_BR
dc.type.originEstrangeiropt_BR


Thumbnail
   

Este item está licenciado na Creative Commons License

Mostrar registro simples