Repository logo
Communities & Collections
Research Outputs
Fundings & Projects
People
Statistics
New user? Click here to register.Have you forgotten your password?
  1. Home
  2. KMITL
  3. Publication
  4. An Interconnect Topology Optimization by Tree Transformation
Loading...
Thumbnail Image

An Interconnect Topology Optimization by Tree Transformation

Author(s)
Arungsrisangchai, Itthichai
Tsukiyama, Shuji
Shirakawa, Isao
Date Issued
January 1, 2002
Type
Article
DOI
10.5104/jiep.5.342
Abstract
Since the interconnect delay has become the dominating factor in circuit performance, and the demands for a better delay-minimization router are very high. In this paper, we propose an algorithm for finding an interconnect tree of a net that minimizes a weighted sum τ of delays to all sinks, where the weight assigned to a sink represents a criticality of the delay to the sink. The algorithm starts from a Steiner tree and repeats a tree transformation while the change of τ is monitored. Experimental results are also shown, which demonstrates the effectiveness of the algorithm, especially for MCM and PCB routing. © 2002, The Japan Institute of Electronics Packaging. All rights reserved.
Citation
Journal of the Japan Institute of Electronics Packaging, 5(4), 342-348, 2002
Subjects

Criticality of a Dela...

Delay-Minimization Ro...

Elmore Delays

Interconnect Delay

Tree Transformation

Metrics
Get Involved!
  • Source Code
  • Documentation
  • Slack Channel
Make it your own

DSpace-CRIS can be extensively configured to meet your needs. Decide which information need to be collected and available with fine-grained security. Start updating the theme to match your Institution's web identity.

Need professional help?

The original creators of DSpace-CRIS at 4Science can take your project to the next level, get in touch!

Built with DSpace-CRIS software - Extension maintained and optimized by 4Science

  • Accessibility settings
  • Privacy policy
  • End User Agreement
  • Send Feedback