ESE 556 Project 1
- Partitioning -
 
 

Goal

Implement and experiment a partitioning algorithm for gate-level designs. The goal of partitioning is to minimize the cutset size, while meeting the area constraints
fixed for partitions. Additionally, each group will address some specific requirements/constraints as defined bellow:
 
 

Task	Kernighan-Lin	Fiduccia-Mattheyses	Simulated annealing
Implement algo & experiment	Sankalp K., Zhao Y., Weng Y.;	Hui Z., Xian T.;	Wei Y., Zhou J.;
k-way partitioning	Sankalp K.;	Xian T.;	Wei Y.;
Each gate is characterized by a set of 4 different rectangular shapes and areas. The shapes differ by their aspect ratio. This will affect the way the area of a partition is calculated.	Weng Y.;	Hui Z.;
Each partition is described by a set of different areas. This areas correspond to different packaging options. Partitioning has to find which partition areas offer the minimal cutset size.	Zhao Y.;		Zhou J.;

Benchmark Examples

To experiment with the developed algorithms, you will use a set of benchmark examples that can be downloaded
from http://vlsicad.cs.ucla.edu/~cheese/ispd98.html.

What to hand in?

A technical report must be handed in. The report will contain following sections:

• Introduction and Problem Statement.
• Related Work.
• Presentation of the proposed solution and relevant implementation issues.
• Experimental results.
• Conclusion.
• Bibliography.

Deadline

March 1 2004 - midnight.