Principles of CMOS VLSI design: a systems perspective
Principles of CMOS VLSI design: a systems perspective
Multiple-Way Network Partitioning
IEEE Transactions on Computers
Net partitions yield better module partitions
DAC '92 Proceedings of the 29th ACM/IEEE Design Automation Conference
A general purpose multiple way partitioning algorithm
DAC '91 Proceedings of the 28th ACM/IEEE Design Automation Conference
A new approach to effective circuit clustering
ICCAD '92 1992 IEEE/ACM international conference proceedings on Computer-aided design
A probabilistic multicommodity-flow solution to circuit clustering problems
ICCAD '92 1992 IEEE/ACM international conference proceedings on Computer-aided design
Spectral K-way ratio-cut partitioning and clustering
DAC '93 Proceedings of the 30th international Design Automation Conference
Efficient network flow based min-cut balanced partitioning
ICCAD '94 Proceedings of the 1994 IEEE/ACM international conference on Computer-aided design
Multi-way VLSI circuit partitioning based on dual net representation
ICCAD '94 Proceedings of the 1994 IEEE/ACM international conference on Computer-aided design
A linear-time heuristic for improving network partitions
DAC '82 Proceedings of the 19th Design Automation Conference
An Improved Min-Cut Algonthm for Partitioning VLSI Networks
IEEE Transactions on Computers
Lower bounds for the partitioning of graphs
IBM Journal of Research and Development
| Hi-index | 0.00 |
Partitioning is one of the critical phases of hierarchical design processes like VLSI design. Good partitioning techniques can positively influence the performance and cost of a VLSI product. This paper proposes a partitioning algorithm with a new cost metric. viewed from a VLSI layout point of view our cost metric minimizes the average delay per net. It can also be interpreted as achieving the minimum number of vias per net. This paper highlights how the seemingly slight difference between our metric and others could cause partitions to be evaluated considerably differently. Experimental results show that in addition to the expected improvements we get on our metric, the proposed algorithm does well on the traditional nets cut metric as well.