Repositório Digital

A- A A+

Maze routing steiner trees with delay versus wire length tradeoff

.

Maze routing steiner trees with delay versus wire length tradeoff

Mostrar registro completo

Estatísticas

Título Maze routing steiner trees with delay versus wire length tradeoff
Autor Hentschke, Renato Fernandes
Narasimhan, Jaganathan
Johann, Marcelo de Oliveira
Reis, Ricardo Augusto da Luz
Abstract 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.
Contido em IEEE transactions on very large scale integration (VLSI) systems. New York. Vol. 17, no 8 (Aug. 2009), p. 1073-1086
Assunto Microeletronica
Vlsi
[en] Delay
[en] Maze search
[en] Routing
[en] Steiner trees
Origem Estrangeiro
Tipo Artigo de periódico
URI http://hdl.handle.net/10183/27623
Arquivos Descrição Formato
000715665.pdf (1.157Mb) Texto completo Adobe PDF Visualizar/abrir

Este item está licenciado na Creative Commons License

Este item aparece na(s) seguinte(s) coleção(ões)


Mostrar registro completo

Percorrer



  • O autor é titular dos direitos autorais dos documentos disponíveis neste repositório e é vedada, nos termos da lei, a comercialização de qualquer espécie sem sua autorização prévia.
    Projeto gráfico elaborado pelo Caixola - Clube de Criação Fabico/UFRGS Powered by DSpace software, Version 1.8.1.