Perimeter-Degree: A Priori Metric for Directly Measuring and Homogenizing Interconnection Complexity in Multilevel Placement (2003)
Cached
Download Links
- [www.cs.ucla.edu]
- [www-users.cs.umn.edu]
- [www-users.cs.umn.edu]
- DBLP
Other Repositories/Bibliography
| Venue: | in Multilevel Placement”, SLIP 2003 |
| Citations: | 11 - 2 self |
BibTeX
@INPROCEEDINGS{Selvakkumaran03perimeter-degree:a,
author = {Selvakkumaran and Navaratnasothie Selvakkumaran and Phiroze N. Parakh and George Karypis},
title = {Perimeter-Degree: A Priori Metric for Directly Measuring and Homogenizing Interconnection Complexity in Multilevel Placement},
booktitle = {in Multilevel Placement”, SLIP 2003},
year = {2003},
pages = {53--59},
publisher = {ACM}
}
Bookmark
 |
 |
 |
 |
 |
 |
OpenURL
Abstract
In this paper, we describe an accurate metric (perimeter-degree) for measuring interconnection complexity and effective use of it for controlling congestion in a multilevel framework. Perimeter-degree is useful for uniformly spreading interconnection density. In modern designs interconnects consume significant area and power. By making interconnect spread homogeneous, it is possible to improve routability as well as power dissipation distribution.
