Zone Partitioning of Pins Amidst Rectangular Blocks.

Date of Submission

December 2002

Date of Award

Winter 12-12-2003

Institute Name (Publisher)

Indian Statistical Institute

Document Type

Master's Dissertation

Degree Name

Master of Technology

Subject Name

Computer Science


Advance Computing and Microelectronics Unit (ACMU-Kolkata)


Sur-Kolay, Susmita (ACMU-Kolkata; ISI)

Abstract (Summary of the Work)

Topological routing has gained importance in state-of-the-art VLSI lay- out synthesis. This report poses an important problem in VI.SI physical design called MinZone purtitioning where the objective ia to purtition the rutuling areu of a yitven place- tAent of circuit modules into minimum set of zones such that in cach zone, no two pin belong to the sume net and no two zones are overlapping. Thus topological routing can be cumpleted among the zones where as within the zone the only wires are from a pin to the boundary of the zone. Hence such partitioning is likely to accelerate routing by reducing the problem size. The related problem MarZone, uhich pertains to identifying a zune with marimum number of distinct pins is also considered here. Both the problems are observed to be NP-hard. For the first problem a special type of visibility graph is formed, by considering the mazimum empty rectangle among the cireuit modules. Then the graph is partitioned into minimal number of Cliques using Most Common Neighbor heuristic. Further we use a greedy heuristic for avoiding the mutual overlapping of the zones. Once the zone partitioning ia done MarZone can be obtained in linear time.


ProQuest Collection ID:

Control Number


Creative Commons License

Creative Commons Attribution 4.0 International License
This work is licensed under a Creative Commons Attribution 4.0 International License.


This document is currently not available here.