Sciweavers

335 search results - page 2 / 67
» High quality graph partitioning
Sort
View
IPPS
2006
IEEE
13 years 11 months ago
Parallelizing post-placement timing optimization
This paper presents an efficient modeling scheme and a partitioning heuristic for parallelizing VLSI post-placement timing optimization. Encoding the paths with timing violations...
Jiyoun Kim, Marios C. Papaefthymiou, José N...
SDM
2007
SIAM
139views Data Mining» more  SDM 2007»
13 years 7 months ago
Dynamic Algorithm for Graph Clustering Using Minimum Cut Tree
We present an efficient dynamic algorithm for clustering undirected graphs, whose edge property is changing continuously. The algorithm maintains clusters of high quality in pres...
Barna Saha, Pabitra Mitra
ITC
2000
IEEE
101views Hardware» more  ITC 2000»
13 years 10 months ago
Deterministic partitioning techniques for fault diagnosis in scan-based BIST
A deterministic partitioning technique for fault diagnosis in Scan-Based BIST is proposed. Properties of high quality partitions for improved fault diagnosis times are identified...
Ismet Bayraktaroglu, Alex Orailoglu
IPPS
2010
IEEE
13 years 3 months ago
Engineering a scalable high quality graph partitioner
Manuel Holtgrewe, Peter Sanders, Christian Schulz