In the name of GOD
Home Page of
Ehsan Kh. Ardestani Zadeh
Welcome to my Home page!
see for useful links
Topology Driven Partitioning (TDP)
The partitioning is a general problem with wide range of applications. According to our interest, we focus on its application in physical design of VLSI systems.
In this project, I am going to develop a new method for partitioning to consider communication cost of partitions with each others. The problem is as follow:
- There is a set of some chips with a given arbitrary topology
- in other side, there is a netlist which represents a design with its constituent primary elements and their connections. We can consider the input netlist as a graph.
- Now, partition the given netlist and assign them to each chip with this consideration that the overall communication cost must be minimized.
I am doing this project under supervision of Dr. Morteza Saheb Zamani.
The consol of beta release of our tool.
here is the result of e few runs.
The cost in 3rd iteration have got minimum. Why we are going on? (area restriction and balancing consideration (?!))