Heuristic Algorithms for Determining Feasible Routing Order in Non Sliceable Floorplans.

Date of Submission

December 1992

Date of Award

Winter 12-12-1993

Institute Name (Publisher)

Indian Statistical Institute

Document Type

Master's Dissertation

Degree Name

Master of Technology

Subject Name

Computer Science

Department

Advance Computing and Microelectronics Unit (ACMU-Kolkata)

Supervisor

Bhattacharya, Bhargab Bikram (ACMU-Kolkata; ISI)

Abstract (Summary of the Work)

In this dissertation we make an experimental study of the algorithms suggested in CSB913 for determining a feasible channel routing or der in nonslicible VLSI floorplans by reserving channels. Since the problem is NP-complete, a comparative study of the different heuristics based on time complexity and quality of the solution has been done.

Comments

ProQuest Collection ID: http://gateway.proquest.com/openurl?url_ver=Z39.88-2004&rft_val_fmt=info:ofi/fmt:kev:mtx:dissertation&res_dat=xri:pqm&rft_dat=xri:pqdiss:28843206

Control Number

ISI-DISS-1992-179

Creative Commons License

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

DOI

http://dspace.isical.ac.in:8080/jspui/handle/10263/6347

This document is currently not available here.

Share

COinS