<?xml version='1.0' encoding='UTF-8'?><?xml-stylesheet href='static/style.xsl' type='text/xsl'?><OAI-PMH xmlns="http://www.openarchives.org/OAI/2.0/" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/ http://www.openarchives.org/OAI/2.0/OAI-PMH.xsd"><responseDate>2026-11-21T10:26:14Z</responseDate><request verb="GetRecord" identifier="oai:ecommons.cornell.edu:1813/2123" metadataPrefix="dim">https://ecommons.cornell.edu/server/oai/request</request><GetRecord><record><header><identifier>oai:ecommons.cornell.edu:1813/2123</identifier><datestamp>2026-05-14T13:49:14Z</datestamp><setSpec>com_1813_35</setSpec><setSpec>col_1813_47</setSpec></header><metadata><dim:dim xmlns:dim="http://www.dspace.org/xmlns/dspace/dim" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xmlns:doc="http://www.lyncode.com/xoai" xsi:schemaLocation="http://www.dspace.org/xmlns/dspace/dim http://www.dspace.org/schema/dim.xsd">
   <dim:field mdschema="dc" element="contributor" qualifier="author">LaFrieda, Christopher</dim:field>
   <dim:field mdschema="dc" element="date" qualifier="accessioned">2005-08-03T19:24:30Z</dim:field>
   <dim:field mdschema="dc" element="date" qualifier="available">2005-08-03T19:24:30Z</dim:field>
   <dim:field mdschema="dc" element="date" qualifier="issued">2005-08-03T19:24:30Z</dim:field>
   <dim:field mdschema="dc" element="identifier" qualifier="uri">https://hdl.handle.net/1813/2123</dim:field>
   <dim:field mdschema="dc" element="identifier" qualifier="bibid">6476022</dim:field>
   <dim:field mdschema="dc" element="description" lang="en_US">Rajit Manohar, Martin Burtscher, Sally McKee</dim:field>
   <dim:field mdschema="dc" element="description" qualifier="abstract" lang="en_US">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.</dim:field>
   <dim:field mdschema="dc" element="format" qualifier="extent">836804 bytes</dim:field>
   <dim:field mdschema="dc" element="format" qualifier="mimetype">application/pdf</dim:field>
   <dim:field mdschema="dc" element="language" qualifier="iso">en_US</dim:field>
   <dim:field mdschema="dc" element="subject" lang="en_US">layout automation</dim:field>
   <dim:field mdschema="dc" element="subject" lang="en_US">router</dim:field>
   <dim:field mdschema="dc" element="title" lang="en_US">Custom-Quality Wire Routing Using Modern Design Rules</dim:field>
   <dim:field mdschema="dc" element="type" lang="en_US">dissertation or thesis</dim:field>
   <dim:field mdschema="dc" element="format" qualifier="mimetype">application/pdf</dim:field>
   <dim:field mdschema="dspace" element="entity" qualifier="type">Publication</dim:field>
   <dim:field mdschema="cris" element="virtual" qualifier="collection" authority="https://cornell-ecommons.eks.prod.4science.cloud/handle/1813/47" confidence="600">Cornell Theses and Dissertations</dim:field>
   <dim:field mdschema="cris" element="virtual" qualifier="author">LaFrieda, Christopher</dim:field>
   <dim:field mdschema="cris" element="virtualsource" qualifier="collection">5893a6ea-7af3-41d7-abc6-04bcd26ab5df</dim:field>
   <dim:field mdschema="others" element="access-status">open.access</dim:field>
   <dim:field mdschema="others" element="access-status">open.access</dim:field>
   <dim:field mdschema="cerif" element="openaire" authority="" confidence="-1">&lt;Publication xmlns="https://www.openaire.eu/cerif-profile/1.1/" id="88d6c24e-08fb-4804-980e-9a095929756f">
	&lt;Type xmlns="https://www.openaire.eu/cerif-profile/vocab/COAR_Publication_Types">http://purl.org/coar/resource_type/c_1843&lt;/Type>
	&lt;Language>en_US&lt;/Language>
   	&lt;Title>Custom-Quality Wire Routing Using Modern Design Rules&lt;/Title>
   	&lt;PublishedIn>
    	&lt;Publication>
      	&lt;/Publication>
   	&lt;/PublishedIn>
   	&lt;PublicationDate>2005-08-03T19:24:30Z&lt;/PublicationDate>
   	&lt;Authors>
      	&lt;Author>
        	&lt;DisplayName>LaFrieda, Christopher&lt;/DisplayName>
         	&lt;Affiliation>
         		&lt;OrgUnit>
         		&lt;/OrgUnit>
         	&lt;/Affiliation>
      	&lt;/Author>
	&lt;/Authors>
   	&lt;Editors>
	&lt;/Editors>
    &lt;Publishers>
        &lt;Publisher>
            &lt;OrgUnit />
        &lt;/Publisher>
    &lt;/Publishers>
    &lt;Keyword>layout automation&lt;/Keyword>
    &lt;Keyword>router&lt;/Keyword>
   	&lt;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.&lt;/Abstract>
	&lt;Access xmlns="http://purl.org/coar/access_right" 
    >
    &lt;/Access>
&lt;/Publication>
</dim:field>
</dim:dim>
</metadata></record></GetRecord></OAI-PMH>