Sciweavers

15 search results - page 1 / 3
» Faster Optimal Single-Row Placement with Fixed Ordering
Sort
View
JCC
2006
69views more  JCC 2006»
13 years 4 months ago
Dramatic performance enhancements for the FASTER optimization algorithm
: FASTER is a combinatorial optimization algorithm useful for finding low-energy side-chain configurations in side-chain placement and protein design calculations. We present two s...
Benjamin D. Allen, Stephen L. Mayo
ISLPED
2010
ACM
181views Hardware» more  ISLPED 2010»
13 years 3 months ago
Exploiting power budgeting in thermal-aware dynamic placement for reconfigurable systems
 In this paper, a novel thermal-aware dynamic placement planner for reconfigurable systems is presented, which targets transient temperature reduction. Rather than solving time-...
Shahin Golshan, Eli Bozorgzadeh, Benjamin Carri&oa...
DAC
2000
ACM
14 years 5 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...
ASPDAC
2007
ACM
129views Hardware» more  ASPDAC 2007»
13 years 8 months ago
ECO-system: Embracing the Change in Placement
In a realistic design flow, circuit and system optimizations must interact with physical aspects of the design. For example, improvements in timing and power may require replacing ...
Jarrod A. Roy, Igor L. Markov