<?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-22T10:18:28Z</responseDate><request verb="GetRecord" identifier="oai:ecommons.cornell.edu:1813/70398" metadataPrefix="dim">https://ecommons.cornell.edu/server/oai/request</request><GetRecord><record><header><identifier>oai:ecommons.cornell.edu:1813/70398</identifier><datestamp>2026-05-15T19:50:30Z</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">Hua, Wenmian</dim:field>
   <dim:field mdschema="dc" element="contributor" qualifier="chair">Manohar, Rajit</dim:field>
   <dim:field mdschema="dc" element="contributor" qualifier="committeeMember">Zhang, Zhiru</dim:field>
   <dim:field mdschema="dc" element="contributor" qualifier="committeeMember">Studer, Christoph</dim:field>
   <dim:field mdschema="dc" element="date" qualifier="accessioned">2020-08-10T20:24:03Z</dim:field>
   <dim:field mdschema="dc" element="date" qualifier="available">2020-08-10T20:24:03Z</dim:field>
   <dim:field mdschema="dc" element="date" qualifier="issued">2020-05</dim:field>
   <dim:field mdschema="dc" element="identifier" qualifier="other">ProQuest Submission ID: 11964</dim:field>
   <dim:field mdschema="dc" element="identifier" qualifier="other">ProQuest Publication ID: 27961492</dim:field>
   <dim:field mdschema="dc" element="identifier" qualifier="uri">https://hdl.handle.net/1813/70398</dim:field>
   <dim:field mdschema="dc" element="identifier" qualifier="doi">https://doi.org/10.7298/wynk-4987</dim:field>
   <dim:field mdschema="dc" element="identifier" qualifier="bibid">13254530</dim:field>
   <dim:field mdschema="dc" element="description">141 pages</dim:field>
   <dim:field mdschema="dc" element="description" qualifier="abstract">Asynchronous circuits have potential advantages of higher speed and lower power consumption compared to their synchronous counterparts, but their poor CAD support is a major issue limiting adoption. A key component of any CAD flow for chip design is timing analysis, and the timing analysis problem for asynchronous logic is much more complicated than that for synchronous logic. Previous work on timing showed that such systems under AND-causality and fixed delay exhibit periodicity properties. In this thesis, we first give a graph-based proof of the exact periodicity properties of such systems. Our result under weaker assumption of system connectivity, provides a theoretical foundation for these properties to be applied and exploited in more general asynchronous circuits containing bundled data logic or synchronous components. Based on the theoretical results, we present the first known integrated timing and power analysis engine capable of handling large asynchronous timing circuits. For timing, we introduce the notion of performance and correctness slack for asynchronous circuits; for power, we compute both the static and dynamic components. We provide a hierarchical approach to constructing the event-dependency graph, and use the Galois framework for the parallelization to achieve fast runtime. The net result is Cyclone, a fast and accurate engine for both static timing and power analysis of asynchronous circuits. Along the way, we also explore the problem of cycle time of min-max system, one of the important algorithmic problems that we will encounter when extending our timing analysis to more general systems that contain OR-causality. We provide a new algorithm to solve this problem and prove its correctness. We also show that the algorithm runs reasonably fast in practice.</dim:field>
   <dim:field mdschema="dc" element="language" qualifier="iso">en</dim:field>
   <dim:field mdschema="dc" element="subject">asynchronous circuits</dim:field>
   <dim:field mdschema="dc" element="subject">computational modeling</dim:field>
   <dim:field mdschema="dc" element="subject">graph theory</dim:field>
   <dim:field mdschema="dc" element="subject">metastability-free interface</dim:field>
   <dim:field mdschema="dc" element="subject">min-max systems</dim:field>
   <dim:field mdschema="dc" element="subject">timing analysis</dim:field>
   <dim:field mdschema="dc" element="title">Cyclone: The First Integrated Timing and Power Engine for Asynchronous Systems</dim:field>
   <dim:field mdschema="dc" element="type">dissertation or thesis</dim:field>
   <dim:field mdschema="dc" element="relation" qualifier="localuri">https://catalog.library.cornell.edu/catalog/13254530</dim:field>
   <dim:field mdschema="dc" element="format" qualifier="mimetype">application/pdf</dim:field>
   <dim:field mdschema="thesis" element="degree" qualifier="discipline">Electrical and Computer Engineering</dim:field>
   <dim:field mdschema="thesis" element="degree" qualifier="grantor">Cornell University</dim:field>
   <dim:field mdschema="thesis" element="degree" qualifier="level">Doctor of Philosophy</dim:field>
   <dim:field mdschema="thesis" element="degree" qualifier="name">Ph. D., Electrical and Computer Engineering</dim:field>
   <dim:field mdschema="dcterms" element="license">https://hdl.handle.net/1813/59810</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">Hua, Wenmian</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="af956c5b-7b26-4b4e-be02-31de6f346d05">
	&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&lt;/Language>
   	&lt;Title>Cyclone: The First Integrated Timing and Power Engine for Asynchronous Systems&lt;/Title>
   	&lt;PublishedIn>
    	&lt;Publication>
      	&lt;/Publication>
   	&lt;/PublishedIn>
   	&lt;PublicationDate>2020-05&lt;/PublicationDate>
   	&lt;DOI>https://doi.org/10.7298/wynk-4987&lt;/DOI>
   	&lt;Authors>
      	&lt;Author>
        	&lt;DisplayName>Hua, Wenmian&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>asynchronous circuits&lt;/Keyword>
    &lt;Keyword>computational modeling&lt;/Keyword>
    &lt;Keyword>graph theory&lt;/Keyword>
    &lt;Keyword>metastability-free interface&lt;/Keyword>
    &lt;Keyword>min-max systems&lt;/Keyword>
    &lt;Keyword>timing analysis&lt;/Keyword>
   	&lt;Abstract>Asynchronous circuits have potential advantages of higher speed and lower power consumption compared to their synchronous counterparts, but their poor CAD support is a major issue limiting adoption. A key component of any CAD flow for chip design is timing analysis, and the timing analysis problem for asynchronous logic is much more complicated than that for synchronous logic. Previous work on timing showed that such systems under AND-causality and fixed delay exhibit periodicity properties. In this thesis, we first give a graph-based proof of the exact periodicity properties of such systems. Our result under weaker assumption of system connectivity, provides a theoretical foundation for these properties to be applied and exploited in more general asynchronous circuits containing bundled data logic or synchronous components. Based on the theoretical results, we present the first known integrated timing and power analysis engine capable of handling large asynchronous timing circuits. For timing, we introduce the notion of performance and correctness slack for asynchronous circuits; for power, we compute both the static and dynamic components. We provide a hierarchical approach to constructing the event-dependency graph, and use the Galois framework for the parallelization to achieve fast runtime. The net result is Cyclone, a fast and accurate engine for both static timing and power analysis of asynchronous circuits. Along the way, we also explore the problem of cycle time of min-max system, one of the important algorithmic problems that we will encounter when extending our timing analysis to more general systems that contain OR-causality. We provide a new algorithm to solve this problem and prove its correctness. We also show that the algorithm runs reasonably fast in practice.&lt;/Abstract>
	&lt;Access xmlns="http://purl.org/coar/access_right" 
    >
    &lt;/Access>
&lt;/Publication>
</dim:field>
</dim:dim>
</metadata></record></GetRecord></OAI-PMH>