[[abstract]]Efficient and effective algorithms for multichip module (MCM) system partitioning under timing and capacity constraints are proposed. Advantage is taken of the small number of chip slots (compared to the large number of circuit modules) and the problem formulation is transformed into an integer programming problem. An approach called Constraints Decoupling, which decomposes the original dual-constraint problem into two independent single-constraint problems, which are much easier to solve is proposed. Experimental results are encouraging and all timing and capacity violations in the initial designs can be eliminated[[fileno]]2030222030014[[department]]資訊工程學
Abstract—Due to the precedence constraints among vertices, the partitioning problem for time-multipl...
International audienceHypergraph partitioning has been used in several areas including circuit parti...
The tutorial introduces the partitioning with applications to VLSI circuit designs. The problem form...
[[abstract]]We propose a new method called Constraints Decoupling to solve MCM system partitioning p...
[[abstract]]The authors propose an efficient and effective algorithm for system partitioning under t...
This paper considers several different algorithms that reduce the required number of buses for multi...
We present a novel genetic algorithm-based partitioning scheme for multichip modules (MCM's) which i...
Multi-Chip Module design is an increasingly common design style for integrated circuits. The area ta...
This paper presents a new partitioning method for software oriented hardware /software codesign. It ...
[[abstract]]We study in this paper the feasibility problem for two-way circuit partitioning subject ...
In this paper, we study the area-balanced multi-way partitioning problem of VLSI circuits based on a...
circuit partitioning algorithms employ the locking mechanism, which enforces each cell to move exact...
This paper considers the problem of finding low cost chip set for a minimum cost partitioning of a l...
In this paper, we study the area-balanced multi-way partitioning problem of VLSI circuits based on a...
Retiming, including pipelining, is applied to make the processing units (PUs) run at a required thro...
Abstract—Due to the precedence constraints among vertices, the partitioning problem for time-multipl...
International audienceHypergraph partitioning has been used in several areas including circuit parti...
The tutorial introduces the partitioning with applications to VLSI circuit designs. The problem form...
[[abstract]]We propose a new method called Constraints Decoupling to solve MCM system partitioning p...
[[abstract]]The authors propose an efficient and effective algorithm for system partitioning under t...
This paper considers several different algorithms that reduce the required number of buses for multi...
We present a novel genetic algorithm-based partitioning scheme for multichip modules (MCM's) which i...
Multi-Chip Module design is an increasingly common design style for integrated circuits. The area ta...
This paper presents a new partitioning method for software oriented hardware /software codesign. It ...
[[abstract]]We study in this paper the feasibility problem for two-way circuit partitioning subject ...
In this paper, we study the area-balanced multi-way partitioning problem of VLSI circuits based on a...
circuit partitioning algorithms employ the locking mechanism, which enforces each cell to move exact...
This paper considers the problem of finding low cost chip set for a minimum cost partitioning of a l...
In this paper, we study the area-balanced multi-way partitioning problem of VLSI circuits based on a...
Retiming, including pipelining, is applied to make the processing units (PUs) run at a required thro...
Abstract—Due to the precedence constraints among vertices, the partitioning problem for time-multipl...
International audienceHypergraph partitioning has been used in several areas including circuit parti...
The tutorial introduces the partitioning with applications to VLSI circuit designs. The problem form...