{"id":{"repo_id":"cornell","oai_identifier":"oai:ecommons.cornell.edu:1813/2123"},"canonical_url":"https://search.ndltd.org/etd/cornell/oai:ecommons.cornell.edu:1813/2123","repository":{"repo_id":"cornell","name":"Cornell University","base_url":"https://ecommons.cornell.edu/server/oai/request"},"display":{"title":"Custom-Quality Wire Routing Using Modern Design Rules","abstract":"This thesis presents a wire routing methodology that produces custom-quality results. We use a gridless tile-based approach that extends previous works in four main ways. First, it captures all the intricacies of modern design rules, e.g. the difference between contact-to-contact spacing and contact-to-wire spacing. Second, it implements a robust cost model that includes: i) horizontal wire costs, ii) vertical wire costs, iii) via costs, and iv) jog costs. Third, a design-rule correct route is always guaranteed even if the search for the least-cost path is terminated early. Fourth, route ordering is dynamically updated based upon the routability of nodes. The resulting router is shown to route 1.5-11x faster than the Cadence Chip Assembly Router while consuming 6-8x less memory with 5-15% less wiring overhead.","abstract_html":"This thesis presents a wire routing methodology that produces custom-quality results. We use a gridless tile-based approach that extends previous works in four main ways. First, it captures all the intricacies of modern design rules, e.g. the difference between contact-to-contact spacing and contact-to-wire spacing. Second, it implements a robust cost model that includes: i) horizontal wire costs, ii) vertical wire costs, iii) via costs, and iv) jog costs. Third, a design-rule correct route is always guaranteed even if the search for the least-cost path is terminated early. Fourth, route ordering is dynamically updated based upon the routability of nodes. The resulting router is shown to route 1.5-11x faster than the Cadence Chip Assembly Router while consuming 6-8x less memory with 5-15% less wiring overhead.","abstract_has_math":false,"creators":["LaFrieda, Christopher"],"institution":null,"degree_name":null,"degree_level":null,"degree_discipline":null,"degree_department":null,"school":null,"contributors":[],"advisors":[],"committee_chairs":[],"committee_members":[],"year":2005,"date_issued":"2005-08-03T19:24:30Z","date_published":"2005-08-03T19:24:30Z","updated_at":"2026-11-19T03:14:48Z","subjects":["layout automation","router"],"languages":["en_US"],"rights":[],"rights_urls":[],"identifier_entries":[{"key":"dc:identifier.bibid","label":"Dc Identifier Bibid","values":["6476022"],"render_values":[{"text":"6476022","href":null,"code":true}]}],"person_identifier_entries":[]},"links":{"outbound_url":"https://hdl.handle.net/1813/2123","outbound_label":"Handle","outbound_source":"dc:identifier.uri","record_url":"https://hdl.handle.net/1813/2123","record_label":"Repository record","record_kind":"handle","record_source":"dc:identifier.uri","download_url":null,"download_label":null,"download_source":null,"access_status":null,"embargo_until":null,"access_note":null},"source_record":{"url":"https://ecommons.cornell.edu/server/oai/request?verb=GetRecord&metadataPrefix=dim&identifier=oai%3Aecommons.cornell.edu%3A1813%2F2123","prefix":"dim"},"metadata_groups":[{"id":"people","label":"People","entries":[{"key":"dc:creator","label":"Author","values":["LaFrieda, Christopher"]}]},{"id":"academic_context","label":"Academic Context","entries":[{"key":"dc:date.accessioned","label":"Dc Date Accessioned","values":["2005-08-03T19:24:30Z"]},{"key":"dc:date.available","label":"Dc Date Available","values":["2005-08-03T19:24:30Z"]},{"key":"dc:date.issued","label":"Date","values":["2005-08-03T19:24:30Z"]},{"key":"dc:type","label":"Dc Type","values":["dissertation or thesis"]}]},{"id":"subjects_keywords","label":"Subjects and Keywords","entries":[{"key":"dc:subject","label":"Dc Subject","values":["layout automation","router"]}]},{"id":"language_rights","label":"Language and Rights","entries":[{"key":"dc:language.iso","label":"Language (ISO)","values":["en_US"]}]},{"id":"identifiers","label":"Identifiers","entries":[{"key":"dc:identifier.bibid","label":"Dc Identifier Bibid","values":["6476022"]},{"key":"dc:identifier.uri","label":"Identifier URI","values":["https://hdl.handle.net/1813/2123"]}]},{"id":"additional","label":"Additional Metadata","entries":[{"key":"cerif:openaire","label":"Cerif Openaire","values":["<Publication xmlns=\"https://www.openaire.eu/cerif-profile/1.1/\" id=\"88d6c24e-08fb-4804-980e-9a095929756f\"> <Type xmlns=\"https://www.openaire.eu/cerif-profile/vocab/COAR_Publication_Types\">http://purl.org/coar/resource_type/c_1843</Type> <Language>en_US</Language> <Title>Custom-Quality Wire Routing Using Modern Design Rules</Title> <PublishedIn> <Publication> </Publication> </PublishedIn> <PublicationDate>2005-08-03T19:24:30Z</PublicationDate> <Authors> <Author> <DisplayName>LaFrieda, Christopher</DisplayName> <Affiliation> <OrgUnit> </OrgUnit> </Affiliation> </Author> </Authors> <Editors> </Editors> <Publishers> <Publisher> <OrgUnit /> </Publisher> </Publishers> <Keyword>layout automation</Keyword> <Keyword>router</Keyword> <Abstract>This thesis presents a wire routing methodology that produces custom-quality results. We use a gridless tile-based approach that extends previous works in four main ways. First, it captures all the intricacies of modern design rules, e.g. the difference between contact-to-contact spacing and contact-to-wire spacing. Second, it implements a robust cost model that includes: i) horizontal wire costs, ii) vertical wire costs, iii) via costs, and iv) jog costs. Third, a design-rule correct route is always guaranteed even if the search for the least-cost path is terminated early. Fourth, route ordering is dynamically updated based upon the routability of nodes. The resulting router is shown to route 1.5-11x faster than the Cadence Chip Assembly Router while consuming 6-8x less memory with 5-15% less wiring overhead.</Abstract> <Access xmlns=\"http://purl.org/coar/access_right\" > </Access> </Publication>"]},{"key":"cris:virtual.author","label":"Cris Virtual Author","values":["LaFrieda, Christopher"]},{"key":"cris:virtualsource.collection","label":"Cris Virtualsource Collection","values":["5893a6ea-7af3-41d7-abc6-04bcd26ab5df"]},{"key":"dc:description","label":"Description","values":["Rajit Manohar, Martin Burtscher, Sally McKee"]},{"key":"dc:description.abstract","label":"Abstract","values":["This thesis presents a wire routing methodology that produces custom-quality results. We use a gridless tile-based approach that extends previous works in four main ways. First, it captures all the intricacies of modern design rules, e.g. the difference between contact-to-contact spacing and contact-to-wire spacing. Second, it implements a robust cost model that includes: i) horizontal wire costs, ii) vertical wire costs, iii) via costs, and iv) jog costs. Third, a design-rule correct route is always guaranteed even if the search for the least-cost path is terminated early. Fourth, route ordering is dynamically updated based upon the routability of nodes. The resulting router is shown to route 1.5-11x faster than the Cadence Chip Assembly Router while consuming 6-8x less memory with 5-15% less wiring overhead."]},{"key":"dc:description.collection","label":"Dc Description Collection","values":["Cornell Theses and Dissertations"]},{"key":"dc:format.extent","label":"Dc Format Extent","values":["836804 bytes"]},{"key":"dc:format.mimetype","label":"Dc Format Mimetype","values":["application/pdf"]},{"key":"dc:title","label":"Title","values":["Custom-Quality Wire Routing Using Modern Design Rules"]},{"key":"dspace:entity.type","label":"Dspace Entity Type","values":["Publication"]},{"key":"others:access_status","label":"Others Access Status","values":["open.access"]}]}],"canonical_facts":{"cerif:openaire":["<Publication xmlns=\"https://www.openaire.eu/cerif-profile/1.1/\" id=\"88d6c24e-08fb-4804-980e-9a095929756f\"> <Type xmlns=\"https://www.openaire.eu/cerif-profile/vocab/COAR_Publication_Types\">http://purl.org/coar/resource_type/c_1843</Type> <Language>en_US</Language> <Title>Custom-Quality Wire Routing Using Modern Design Rules</Title> <PublishedIn> <Publication> </Publication> </PublishedIn> <PublicationDate>2005-08-03T19:24:30Z</PublicationDate> <Authors> <Author> <DisplayName>LaFrieda, Christopher</DisplayName> <Affiliation> <OrgUnit> </OrgUnit> </Affiliation> </Author> </Authors> <Editors> </Editors> <Publishers> <Publisher> <OrgUnit /> </Publisher> </Publishers> <Keyword>layout automation</Keyword> <Keyword>router</Keyword> <Abstract>This thesis presents a wire routing methodology that produces custom-quality results. We use a gridless tile-based approach that extends previous works in four main ways. First, it captures all the intricacies of modern design rules, e.g. the difference between contact-to-contact spacing and contact-to-wire spacing. Second, it implements a robust cost model that includes: i) horizontal wire costs, ii) vertical wire costs, iii) via costs, and iv) jog costs. Third, a design-rule correct route is always guaranteed even if the search for the least-cost path is terminated early. Fourth, route ordering is dynamically updated based upon the routability of nodes. The resulting router is shown to route 1.5-11x faster than the Cadence Chip Assembly Router while consuming 6-8x less memory with 5-15% less wiring overhead.</Abstract> <Access xmlns=\"http://purl.org/coar/access_right\" > </Access> </Publication>"],"cris:virtual.author":["LaFrieda, Christopher"],"cris:virtualsource.collection":["5893a6ea-7af3-41d7-abc6-04bcd26ab5df"],"dc:creator":["LaFrieda, Christopher"],"dc:date.accessioned":["2005-08-03T19:24:30Z"],"dc:date.available":["2005-08-03T19:24:30Z"],"dc:date.issued":["2005-08-03T19:24:30Z"],"dc:description":["Rajit Manohar, Martin Burtscher, Sally McKee"],"dc:description.abstract":["This thesis presents a wire routing methodology that produces custom-quality results. We use a gridless tile-based approach that extends previous works in four main ways. First, it captures all the intricacies of modern design rules, e.g. the difference between contact-to-contact spacing and contact-to-wire spacing. Second, it implements a robust cost model that includes: i) horizontal wire costs, ii) vertical wire costs, iii) via costs, and iv) jog costs. Third, a design-rule correct route is always guaranteed even if the search for the least-cost path is terminated early. Fourth, route ordering is dynamically updated based upon the routability of nodes. The resulting router is shown to route 1.5-11x faster than the Cadence Chip Assembly Router while consuming 6-8x less memory with 5-15% less wiring overhead."],"dc:description.collection":["Cornell Theses and Dissertations"],"dc:format.extent":["836804 bytes"],"dc:format.mimetype":["application/pdf"],"dc:identifier.bibid":["6476022"],"dc:identifier.uri":["https://hdl.handle.net/1813/2123"],"dc:language.iso":["en_US"],"dc:subject":["layout automation","router"],"dc:title":["Custom-Quality Wire Routing Using Modern Design Rules"],"dc:type":["dissertation or thesis"],"dspace:entity.type":["Publication"],"others:access_status":["open.access"]},"updated_at":"2026-11-19T03:14:48Z"}