Hierarchical partitioning for field-programmable systems

Authors:
Vi Chi Chan;David Lewis
Affiliations:
Toronto Design Centre, LSI Logic Corp. of Canada and Department of Electrical and Computer Engineering, University of Toronto;Department of Electrical and Computer Engineering, University of Toronto
Venue:
ICCAD '97 Proceedings of the 1997 IEEE/ACM international conference on Computer-aided design
Year:
1997

Citing 7
Cited 0

Analytical placement: A linear or a quadratic objective function?

DAC '91 Proceedings of the 28th ACM/IEEE Design Automation Conference
Partitioning very large circuits using analytical placement techniques

DAC '94 Proceedings of the 31st annual Design Automation Conference
Spectral partitioning: the more eigenvectors, the better

DAC '95 Proceedings of the 32nd annual ACM/IEEE Design Automation Conference
VLSI circuit partitioning by cluster-removal using iterative improvement techniques

Proceedings of the 1996 IEEE/ACM international conference on Computer-aided design
The Transmogrifier-2: a 1 million gate rapid prototyping system

FPGA '97 Proceedings of the 1997 ACM fifth international symposium on Field-programmable gate arrays
On the performance of spectral graph partitioning methods

Proceedings of the sixth annual ACM-SIAM symposium on Discrete algorithms
A linear-time heuristic for improving network partitions

DAC '82 Proceedings of the 19th Design Automation Conference

Quantified Score

Hi-index	0.00

Visualization

Abstract

This paper presents a new recursive bipartitioning algorithm for a hierarchical field-programmable system. It draws new insights into relating the quality of the bipartitioning algorithm to circuit structures by the use of the partitioning tree (Hagen et al., 1994). The final algorithm proposed not only forms the basis for the partitioning solution of a 1-million gate field programmable system (Lewis et al., 1997) but can also be applied to general VLSI or multiple-FPGA partitioning problems.