Show simple item record

dc.contributor.advisorGu, Jun
dc.contributor.authorYu, Hongtao
dc.date.accessioned2005-07-29T23:12:27Z
dc.date.available2005-07-29T23:12:27Z
dc.date.issued1994
dc.identifier.citationYu, H. (1994). A highly efficient routing algorithm (Unpublished master's thesis). University of Calgary, Calgary, AB. doi:10.11575/PRISM/22676en_US
dc.identifier.isbn0612032639en
dc.identifier.urihttp://hdl.handle.net/1880/30540
dc.descriptionBibliography: p. 105-110.en
dc.description.abstractRouting is a challenging problem in today's circuit system design. ULSI, MCM and PCB are requiring over a hundred thousand interconnections within several tens of routing layers. Sluggish and memory devouring routing programs cannot fulfill these up-to-date design requirements. On the other hand, the performance of advanced circuit systems is directly related to the scheme of circuit interconnections. Therefore, routing without careful examination of circuit performance requirements results in low quality circuit systems. In this thesis, a Highly-Efficient Routing Algorithm(HERA) for general, large-scale multi-layer routing is presented. Its efficiency is based on an effectively organized data structure, optimized Steiner tree construction and an efficient obstacle-searching algorithm. Experimental results show that HERA outperforms all well-known routing algorithms in terms of execution time and routing quality. It runs over a hundred times faster than V 4R on big industrial routing benchmarks. HERA also produces uniformly distributed interconnections of shorter wiring length.
dc.format.extentxiv, 110 leaves ; 30 cm.en
dc.language.isoeng
dc.rightsUniversity of Calgary graduate students retain copyright ownership and moral rights for their thesis. You may use this material in any way that is permitted by the Copyright Act or through licensing that has been assigned to the document. For uses that are not allowable under copyright legislation or licensing, you are required to seek permission.
dc.subject.lccTK 7874.75 Y84 1994en
dc.subject.lcshIntegrated circuits - Very large scale integration
dc.subject.lcshComputer algorithms
dc.subject.lcshSignal processing - Digital techniques
dc.titleA highly efficient routing algorithm
dc.typemaster thesis
dc.publisher.institutionUniversity of Calgaryen
dc.identifier.doihttp://dx.doi.org/10.11575/PRISM/22676
thesis.degree.nameMaster of Science
thesis.degree.nameMS
thesis.degree.nameMSc
thesis.degree.disciplineElectrical and Computer Engineering
thesis.degree.grantorUniversity of Calgary
dc.identifier.lccTK 7874.75 Y84 1994en
dc.publisher.placeCalgaryen
ucalgary.thesis.notesoffsiteen
ucalgary.thesis.uarcreleaseyen
ucalgary.item.requestcopytrue
ucalgary.thesis.accessionTheses Collection 58.002:Box 1012 520538322


Files in this item

Thumbnail
Embargoed until: 2200-01-01

This item appears in the following Collection(s)

Show simple item record

University of Calgary graduate students retain copyright ownership and moral rights for their thesis. You may use this material in any way that is permitted by the Copyright Act or through licensing that has been assigned to the document. For uses that are not allowable under copyright legislation or licensing, you are required to seek permission.