PROP: a recursive paradigm for area-efficient and performance oriented partitioning of large FPGA netlists

Authors:
Roman Kužnar;Franc Brglez
Affiliations:
Dept. of Electrical & Comp. Eng., University of Ljubljana, Tržžaška 25, 61000 Ljubljana, Slovenia;CBL, Dept. of Electrical & Comp. Eng, Box 7911, North Carolina State University, Raleigh, N.C.
Venue:
ICCAD '95 Proceedings of the 1995 IEEE/ACM international conference on Computer-aided design
Year:
1995

Citing 19
Cited 9

Multiple-Way Network Partitioning

IEEE Transactions on Computers
A general purpose multiple way partitioning algorithm

DAC '91 Proceedings of the 28th ACM/IEEE Design Automation Conference
An efficient method of partitioning circuits for multiple-FPGA implementation.

DAC '93 Proceedings of the 30th international Design Automation Conference
Cost minimization of partitions into multiple devices

DAC '93 Proceedings of the 30th international Design Automation Conference
Spectral K-way ratio-cut partitioning and clustering

DAC '93 Proceedings of the 30th international Design Automation Conference
A parallel bottom-up clustering algorithm with applications to circuit partitioning in VLSI design

DAC '93 Proceedings of the 30th international Design Automation Conference
Quadratic Boolean programming for performance-driven system partitioning

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
Multi-way netlist partitioning into heterogeneous FPGAs and minimization of total device cost and interconnect

DAC '94 Proceedings of the 31st annual Design Automation Conference
Circuit partitioning for huge logic emulation systems

DAC '94 Proceedings of the 31st annual Design Automation Conference
Partitioning very large circuits using analytical placement techniques

DAC '94 Proceedings of the 31st annual Design Automation Conference
Multi-way partitioning via spacefilling curves and dynamic programming

DAC '94 Proceedings of the 31st annual Design Automation Conference
A unified cost model for min-cut partitioning with replication applied to optimization of large heterogeneous FPGA partitions

EURO-DAC '94 Proceedings of the conference on European design automation
Spectral partitioning: the more eigenvectors, the better

DAC '95 Proceedings of the 32nd annual ACM/IEEE Design Automation Conference
Multi-way partitioning for minimum delay for look-up table based FPGAs

DAC '95 Proceedings of the 32nd annual ACM/IEEE Design Automation Conference
Partitioning with cone structures

ICCAD '93 Proceedings of the 1993 IEEE/ACM international conference on Computer-aided design
Optimal replication for min-cut partitioning

ICCAD '92 Proceedings of the 1992 IEEE/ACM international conference on Computer-aided design
Synthesis and Optimization of Digital Circuits

Synthesis and Optimization of Digital Circuits

Partitioning of VLSI circuits and systems

DAC '96 Proceedings of the 33rd annual Design Automation Conference
I/O and performance tradeoffs with the FunctionBus during multi-FPGA partitioning

FPGA '97 Proceedings of the 1997 ACM fifth international symposium on Field-programmable gate arrays
A hierarchy-driven FPGA partitioning method

DAC '97 Proceedings of the 34th annual Design Automation Conference
Executable workflows: a paradigm for collaborative design on the Internet

DAC '97 Proceedings of the 34th annual Design Automation Conference
Towards a new benchmarking paradigm in EDA: analysis of equivalence class mutant circuit distributions

Proceedings of the 1997 international symposium on Physical design
Iterative improvement based multi-way netlist partitioning for FPGAs

DATE '99 Proceedings of the conference on Design, automation and test in Europe
Synthesis of wiring signature-invariant equivalence class circuit mutants and applications to benchmarking

Proceedings of the conference on Design, automation and test in Europe
Ultra-fast interconnect driven cell cloning for minimizing critical path delay

Proceedings of the 19th international symposium on Physical design
Multi-FPGA partitioning method based on topological levelization

Journal of Electrical and Computer Engineering

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this paper, we introduce a new recursive partitioning paradigm PROP which combines (p)artitioning, (r)eplication, (o)ptimization, to be followed by another recursion of (p)artitioning, etc. We measure the quality of partitions in terms of total device cost, logic and terminal utilization, and critical path delay. Traditionally, the minimum lower bound into which a given netlist can be partitioned is determined by disregarding the logic interconnect while distributing the logic nodes into a minimum number of devices. PROP paradigm challenges this assumption by demonstrating feasible partitions of some large netlists such that the number of device partitions is smaller than minimum lower bounds postulated initially. Overall, we report consistent reductions in the total number of partitions for a wide range of combinational and sequential circuit benchmarks while, on the average, reducing critical path delay as well.