Author

Hashmi

Date of Award

4-1992

Degree Name

Master of Science

Department

Computer Science

First Advisor

Dr. Naveed A. Sherwani

Second Advisor

Dr. Alfred J. Boals

Third Advisor

Dr. Ajay K. Gupta

Access Setting

Masters Thesis-Open Access

Abstract

In this thesis, we study two problems related to the physical design of VLSI circuits. One problem is related to the VLSI global routing and the other is related to the detailed routing in a bounded region.

We consider the routing of multiple multi-terminal nets on a single layer. We suggest a new approach for this problem. Our approach is based on simultaneously finding a forest of k non-intersecting spanning trees. We present an O(n^3) algorithm for finding two spanning trees corresponding to two nets on a single layer.

We also study the problem of finding a minimum Steiner tree in the presence of obstacles when the terminals lie on the boundary of a rectilinear rectangle (RSTO) and present two results. Our first contribution is an exact solution for finding the shortest rectilinear Steiner tree in presence of an obstacle. Second, we give a provably good approximation algorithm for RSTO in the presence of n obstacles.

Share

COinS