Impact of gate-level clustering on automated system partitioning of 3D-ICs

07/18/2023
by   Quentin Delhaye, et al.
0

When partitioning gate-level netlists using graphs, it is beneficial to cluster gates to reduce the order of the graph and preserve some characteristics of the circuit that the partitioning might degrade. Gate clustering is even more important for netlist partitioning targeting 3D system integration. In this paper, we make the argument that the choice of clustering method for 3D-ICs partitioning is not trivial and deserves careful consideration. To support our claim, we implemented three clustering methods that were used prior to partitioning two synthetic designs representing two extremes of the circuits medium/long interconnect diversity spectrum. Automatically partitioned netlists are then placed and routed in 3D to compare the impact of clustering methods on several metrics. From our experiments, we see that the clustering method indeed has a different impact depending on the design considered and that a circuit-blind, universal partitioning method is not the way to go, with wire-length savings of up to 31 22 Furthermore, we highlight that 3D-ICs open new opportunities to design systems with a denser interconnect, drastically reducing the design utilization of circuits that would not be considered viable in 2D.

READ FULL TEXT
research
11/14/2018

Faster manipulation of large quantum circuits using wire label reference diagrams

Large scale quantum computing is highly anticipated, and quantum circuit...
research
05/14/2022

Efficient Hierarchical State Vector Simulation of Quantum Circuits via Acyclic Graph Partitioning

Early but promising results in quantum computing have been enabled by th...
research
09/21/2023

Design of Reversible Computing Systems; Large Logic, Languages, and Circuits

This PhD dissertation investigates garbage-free reversible computing sys...
research
02/27/2023

Novel Efficient Scalable QCA XOR and Full Adder Designs

Circuit design based on Quantum-dots Cellular Automata technology offers...
research
09/17/2023

Axioms for Distanceless Graph Partitioning

In 2002, Kleinberg proposed three axioms for distance-based clustering, ...
research
11/17/2012

Data Clustering via Principal Direction Gap Partitioning

We explore the geometrical interpretation of the PCA based clustering al...

Please sign up or login with your details

Forgot password? Click here to reset