[[abstract]]©2001 IEEE-In this paper, we propose an architecture driven partitioning algorithm for netlists with multiterminal nets. Our target architecture is a multifield-programmable gate array (FPGA) emulation system with folded-Clos network for board routing. Our goal is to minimize the number of FPGA chips used and maximize routability. To that end, we introduce a new cost function: the average number of pseudoterminals per net in a multiway cut. Experimental result shows that our algorithm is very effective in terms of the number of chips used and routability as compared to other methods[[department]]資訊工程學
Most of the IC today are described and documented using heiarchical netlists. In addition to gates, ...
In this paper, we study the area-balanced multi-way partitioning problem of VLSI circuits based on a...
[[abstract]]In this paper, we propose the idea of temporal logic replication in dynamically reconfig...
In this paper, we propose an architecture driven partitioning algorithm for netlists with multi-term...
In this paper, we introduce a new recursive partitioning paradigm PROP which combines partitioning, ...
This paper presents a multi-way FPGA partitioning method. The basic idea is similar to one proposed ...
This paper describes a new procedure for generating very large realistic benchmark circuits which ar...
[[abstract]]A sliced-layout architecture is presented to alleviate the problems of the general bit-s...
[[abstract]]In this paper, we will study the net assignment problem for logic emulation system in th...
Mathematically the most difficult partitioning problem–packaging–is being considered. Its purpose is...
In this paper, we study the area-balanced multi-way partitioning problem of VLSI circuits based on a...
The paper presents a satisfiability-based method for solving the board-level multiterminal net routi...
Multi-FPGA (field-programmable gate arrays) systems are used as custom computing machines to solve c...
[[abstract]]We consider a board-level routing problem applicable to FPGA-based logic emulation syste...
In this paper, we present an algorithm for circuit partitioning with complex resource constraints in...
Most of the IC today are described and documented using heiarchical netlists. In addition to gates, ...
In this paper, we study the area-balanced multi-way partitioning problem of VLSI circuits based on a...
[[abstract]]In this paper, we propose the idea of temporal logic replication in dynamically reconfig...
In this paper, we propose an architecture driven partitioning algorithm for netlists with multi-term...
In this paper, we introduce a new recursive partitioning paradigm PROP which combines partitioning, ...
This paper presents a multi-way FPGA partitioning method. The basic idea is similar to one proposed ...
This paper describes a new procedure for generating very large realistic benchmark circuits which ar...
[[abstract]]A sliced-layout architecture is presented to alleviate the problems of the general bit-s...
[[abstract]]In this paper, we will study the net assignment problem for logic emulation system in th...
Mathematically the most difficult partitioning problem–packaging–is being considered. Its purpose is...
In this paper, we study the area-balanced multi-way partitioning problem of VLSI circuits based on a...
The paper presents a satisfiability-based method for solving the board-level multiterminal net routi...
Multi-FPGA (field-programmable gate arrays) systems are used as custom computing machines to solve c...
[[abstract]]We consider a board-level routing problem applicable to FPGA-based logic emulation syste...
In this paper, we present an algorithm for circuit partitioning with complex resource constraints in...
Most of the IC today are described and documented using heiarchical netlists. In addition to gates, ...
In this paper, we study the area-balanced multi-way partitioning problem of VLSI circuits based on a...
[[abstract]]In this paper, we propose the idea of temporal logic replication in dynamically reconfig...