MCDM Applied to the Partitioning Problem of 3D-Stacked Integrated Circuits

2016 ◽  
pp. 165-187 ◽  
Author(s):  
Nguyen Anh Vu Doan ◽  
Dragomir Milojevic ◽  
Yves De Smet
Keyword(s):  
Integrated Circuits ◽  
Partitioning Problem ◽  
Stacked Integrated Circuits

scholarly journals Test Flow Selection for Stacked Integrated Circuits

2019 ◽  
Vol 35 (4) ◽  
pp. 425-440
Author(s):  
Breeta SenGupta ◽  
Dimitar Nikolov ◽  
Assmitra Dash ◽  
Erik Larsson
Keyword(s):  
Integrated Circuits ◽  
Test Flow ◽  
Selection For ◽  
Stacked Integrated Circuits

Automated Pathfinding tool chain for 3D-stacked integrated circuits: Practical case study

2009 ◽  
Author(s):  
Dragomir Milojevic ◽  
Trevor E. Carlson ◽  
Kris Croes ◽  
Riko Radojcic ◽  
Diana F. Ragett ◽  
...  
Keyword(s):  
Integrated Circuits ◽  
Practical Case ◽  
Tool Chain ◽  
Stacked Integrated Circuits

scholarly journals Time-multiplexed test access architecture for stacked integrated circuits

2016 ◽  
Vol 13 (14) ◽  
pp. 20160314-20160314
Author(s):  
Muhammad Adil Ansari ◽  
Jihun Jung ◽  
Dooyoung Kim ◽  
Sungju Park
Keyword(s):  
Integrated Circuits ◽  
Stacked Integrated Circuits

scholarly journals New Methods for the Construction of Test Cases for Partitioning Heuristics

VLSI Design ◽  
1995 ◽  
Vol 3 (1) ◽  
pp. 93-98 ◽  
Author(s):  
Youssef Saab
Keyword(s):  
Integrated Circuits ◽  
Network Flow ◽  
Test Cases ◽  
Heuristic Methods ◽  
Optimal Solutions ◽  
Clustering Problem ◽  
New Methods ◽  
Fixed Dimension ◽  
Geometric Clustering ◽  
Partitioning Problem

Partitioning is an important problem in the design automation of integrated circuits. This problem in many of its formulation is NP-Hard, and several heuristic methods have been proposed for its solution. To evaluate the effectiveness of the various partitioning heuristics, it is desirable to have test cases with known optimal solutions that are as “random looking” as possible. In this paper, we describe several methods for the construction of such test cases. All our methods except one use the theory of network flow. The remaining method uses a relationship between a partitioning problem and the geometric clustering problem. The latter problem can be solved in polynomial time in any fixed dimension.

Sign in / Sign up

Export Citation Format

Share Document