Sciweavers

145 search results - page 4 / 29
» Parallel Global Routing Algorithms for Standard Cells
Sort
View
GCC
2003
Springer
14 years 18 days ago
An Evolutionary Constraint Satisfaction Solution for over the Cell Channel Routing
A novel combination of genetic algorithms and constraint satisfaction modelling for the solution of two and multi-layer over-thecell channel routing problems is presented. The two ...
Ahmet Ünveren, Adnan Acan
VLSID
1996
IEEE
119views VLSI» more  VLSID 1996»
13 years 11 months ago
Parallel simulated annealing strategies for VLSI cell placement
Simulated annealing based standard cell placement for VLSI designs has long been acknowledged as a compute-intensive process, and as a result several research efforts have been un...
John A. Chandy, Prithviraj Banerjee
ICCAD
2006
IEEE
126views Hardware» more  ICCAD 2006»
14 years 4 months ago
Optimizing yield in global routing
We present the first efficient approach to global routing that takes spacing-dependent costs into account and provably finds a near-optimum solution including these costs. We sh...
Dirk Müller
ISCAS
2005
IEEE
133views Hardware» more  ISCAS 2005»
14 years 1 months ago
Multiobjective VLSI cell placement using distributed simulated evolution algorithm
— Simulated Evolution (SimE) is a sound stochastic approximation algorithm based on the principles of adaptation. If properly engineered it is possible for SimE to reach nearopti...
Sadiq M. Sait, Ali Mustafa Zaidi, Mustafa I. Ali
DSRT
2008
IEEE
13 years 9 months ago
Lightweight Time Warp - A Novel Protocol for Parallel Optimistic Simulation of Large-Scale DEVS and Cell-DEVS Models
This paper proposes a novel Lightweight Time Warp (LTW) protocol for high-performance parallel optimistic simulation of large-scale DEVS and CellDEVS models. By exploiting the cha...
Qi Liu, Gabriel A. Wainer