Sciweavers

711 search results - page 10 / 143
» Optimal placement by branch-and-price
Sort
View
ICCD
2004
IEEE
119views Hardware» more  ICCD 2004»
14 years 4 months ago
I/O Clustering in Design Cost and Performance Optimization for Flip-Chip Design
I/O placement has always been a concern in modern IC design. Due to flip-chip technology, I/O can be placed throughout the whole chip without long wires from the periphery of the...
Hung-Ming Chen, I-Min Liu, Martin D. F. Wong, Muzh...
COMCOM
2008
85views more  COMCOM 2008»
13 years 7 months ago
Efficient placement of proxies for hierarchical reliable multicast
The primary focus of this paper is the design of efficient algorithm for the calculation of solution to the placement of proxies for performance optimization in hierarchical relia...
Liansheng Tan, Li Jin, Yi Pan
ESTIMEDIA
2008
Springer
13 years 9 months ago
A framework for memory-aware multimedia application mapping on chip-multiprocessors
The relentless increase in multimedia embedded system application requirements as well as improvements in IC design technology have motivated the deployment of chip multiprocessor ...
Luis Angel D. Bathen, Nikil D. Dutt, Sudeep Pasric...
ISPD
1997
ACM
104views Hardware» more  ISPD 1997»
13 years 12 months ago
Timing driven placement in interaction with netlist transformations
In this paper, we present a new approach that performs timing driven placement for standard cell circuits in interaction with netlist transformations. As netlist transformations a...
Guenter Stenz, Bernhard M. Riess, Bernhard Rohflei...
DAC
2000
ACM
14 years 8 months ago
Can recursive bisection alone produce routable placements?
This work focuses on congestion-driven placement of standard cells into rows in the fixed-die context. We summarize the stateof-the-art after two decades of research in recursive ...
Andrew E. Caldwell, Andrew B. Kahng, Igor L. Marko...