Semi-detailed bus routing with variation reduction

Proceedings of the International Symposium on Physical Design

Volumn , Issue , 2007, Pages 143-150

  Mo, Fan ^a   Brayton, Robert K ^b  

^a Synplicity Inc   (United States)

^b UNIVERSITY OF CALIFORNIA   (United States)

Author keywords

Bus; Routing; Variation

Indexed keywords

ALGORITHMS; BUSBARS; NETWORK ROUTING; OPTIMIZATION;

BUS ROUTING ALGORITHMS; DELAY DIFFERENCES; WIRE LENGTH;

INTERCONNECTION NETWORKS;

EID: 34748845819     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1231996.1232025     Document Type: Conference Paper

References (9)

1. H.Xiang, X.Tang and M.D.F. Wong, "Bus-Driven Floorplanning", Int. Conf. Computer Aided Design, 2003, pages 66-73.
2. F.Rafiq, M.Chrzanowska-Jeske, H.Yang and N.Sherwani, "Integrated Floorplanning with Buffer/Channel Insertion for BusBased Microprocessor Designs", ISPD 2002, pages 56-61.
3. J.H.Y.Law and E.F.Y.Young, "Multi-Bend Bus Driven Floorplanning", Int. Symp. Physical Design, 2005, pages 113-120.
4. M. Lavin and L. Liebmann, "CAD Computation for Manufacturability: Can We Save VLSI Technology from Itself?", Int. Conf. Computer-Aided Design, 2002, pages 424-431.
5. S. Iwata, et al., "Performance Evaluation of a Microprocessor with On-Chip DRAM and High Bandwidth Internal Bus", IEEE Custom Integrated Circuits Conf., May 1996, pages 269-272.
6. J.L. Ganley and J.P. Cohoon, "Routing a Multi-Terminal Critical Net: Steiner Tree Construction in the Presence of Obstacles", Int. Symp. Circuits and Systems, 1994, pages 113-116.
7. J. Cong, A.B. Kahng and K.S. Leung, "Efficient Algorithms for the Minimum Shortest Path Steiner Arborescence Problem with Applications to VLSI Physical Design", IEEE Trans. CAC of IC and Systems, vol. 17, no. 1, Jan 1998, pages 24-39.
8. E.N. Gilbert, H.O. Pollak, "Steiner Minimal Trees", SIAM J. Appl. Math. 16, 1968, pages 1-29.
9. G. Persky and L. V. Tran, "Topological Routing of Multi-Bit Data Buses", Design Automation Conf., 1984, pages 679-682.