<?xml version="1.0"?>
<feed xmlns="http://www.w3.org/2005/Atom" xml:lang="en">
		<id>http://www.colloquiam.com/wd/index.php?action=history&amp;feed=atom&amp;title=Singh_Gill_2010a</id>
		<title>Singh Gill 2010a - Revision history</title>
		<link rel="self" type="application/atom+xml" href="http://www.colloquiam.com/wd/index.php?action=history&amp;feed=atom&amp;title=Singh_Gill_2010a"/>
		<link rel="alternate" type="text/html" href="http://www.colloquiam.com/wd/index.php?title=Singh_Gill_2010a&amp;action=history"/>
		<updated>2026-05-13T23:12:30Z</updated>
		<subtitle>Revision history for this page on the wiki</subtitle>
		<generator>MediaWiki 1.27.0-wmf.10</generator>

	<entry>
		<id>http://www.colloquiam.com/wd/index.php?title=Singh_Gill_2010a&amp;diff=205248&amp;oldid=prev</id>
		<title>Scipediacontent: Scipediacontent moved page Draft Content 105733344 to Singh Gill 2010a</title>
		<link rel="alternate" type="text/html" href="http://www.colloquiam.com/wd/index.php?title=Singh_Gill_2010a&amp;diff=205248&amp;oldid=prev"/>
				<updated>2021-02-03T16:08:06Z</updated>
		
		<summary type="html">&lt;p&gt;Scipediacontent moved page &lt;a href=&quot;/public/Draft_Content_105733344&quot; class=&quot;mw-redirect&quot; title=&quot;Draft Content 105733344&quot;&gt;Draft Content 105733344&lt;/a&gt; to &lt;a href=&quot;/public/Singh_Gill_2010a&quot; title=&quot;Singh Gill 2010a&quot;&gt;Singh Gill 2010a&lt;/a&gt;&lt;/p&gt;
&lt;table class=&quot;diff diff-contentalign-left&quot; data-mw=&quot;interface&quot;&gt;
				&lt;tr style='vertical-align: top;' lang='en'&gt;
				&lt;td colspan='1' style=&quot;background-color: white; color:black; text-align: center;&quot;&gt;← Older revision&lt;/td&gt;
				&lt;td colspan='1' style=&quot;background-color: white; color:black; text-align: center;&quot;&gt;Revision as of 16:08, 3 February 2021&lt;/td&gt;
				&lt;/tr&gt;&lt;tr&gt;&lt;td colspan='2' style='text-align: center;' lang='en'&gt;&lt;div class=&quot;mw-diff-empty&quot;&gt;(No difference)&lt;/div&gt;
&lt;/td&gt;&lt;/tr&gt;&lt;/table&gt;</summary>
		<author><name>Scipediacontent</name></author>	</entry>

	<entry>
		<id>http://www.colloquiam.com/wd/index.php?title=Singh_Gill_2010a&amp;diff=205247&amp;oldid=prev</id>
		<title>Scipediacontent: Created page with &quot; == Abstract ==  This paper presents a systematic approach for microarchitectural exploration in pipelined asynchronous systems, with the goal of achieving a specified through...&quot;</title>
		<link rel="alternate" type="text/html" href="http://www.colloquiam.com/wd/index.php?title=Singh_Gill_2010a&amp;diff=205247&amp;oldid=prev"/>
				<updated>2021-02-03T16:08:03Z</updated>
		
		<summary type="html">&lt;p&gt;Created page with &amp;quot; == Abstract ==  This paper presents a systematic approach for microarchitectural exploration in pipelined asynchronous systems, with the goal of achieving a specified through...&amp;quot;&lt;/p&gt;
&lt;p&gt;&lt;b&gt;New page&lt;/b&gt;&lt;/p&gt;&lt;div&gt;&lt;br /&gt;
== Abstract ==&lt;br /&gt;
&lt;br /&gt;
This paper presents a systematic approach for microarchitectural exploration in pipelined asynchronous systems, with the goal of achieving a specified throughput target while minimizing a given cost function (based on energy, area, etc.). The method includes a general framework that (i) allows for a rich extensible set of microarchitectural transformations for improving throughput; and (ii) can handle a variety of cost functions, such as area, energy, $E\tau^2$ and the energy-area product.In general, the space of transformations that can be applied to a given circuit is potentially infinite because an arbitrarily long sequence of transformations may be applicable. To compound the challenge, the value of the given cost function can change non-monotonically as successive transformations are applied (e.g., some transformations increase area, while others decrease area), thereby making it difficult to apply a typical branch-and-bound approach to prune the search space. Our method employs simple but effective heuristic search strategies (including greedy, look ahead, and breadth-first). A key contribution is to identify commutativity of certain transformations, thereby pruning the design space significantly. The approach was automated and applied to a number of examples. Various throughput targets were assumed: from 50\% to 20x throughput improvement. In each example, the approach was successful in meeting the throughput target.&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
== Original document ==&lt;br /&gt;
&lt;br /&gt;
The different versions of the original document can be found in:&lt;br /&gt;
&lt;br /&gt;
* [http://www.cs.columbia.edu/%7Eggill/papers/async10.pdf http://www.cs.columbia.edu/%7Eggill/papers/async10.pdf]&lt;br /&gt;
&lt;br /&gt;
* [http://www.cs.columbia.edu/~ggill/papers/async10.pdf http://www.cs.columbia.edu/~ggill/papers/async10.pdf],&lt;br /&gt;
: [http://yadda.icm.edu.pl/yadda/element/bwmeta1.element.ieee-000005476976 http://yadda.icm.edu.pl/yadda/element/bwmeta1.element.ieee-000005476976],&lt;br /&gt;
: [https://dblp.uni-trier.de/db/conf/async/async2010.html#GillS10 https://dblp.uni-trier.de/db/conf/async/async2010.html#GillS10],&lt;br /&gt;
: [https://academic.microsoft.com/#/detail/2040723997 https://academic.microsoft.com/#/detail/2040723997]&lt;br /&gt;
&lt;br /&gt;
* [http://xplorestaging.ieee.org/ielx5/5476381/5476957/05476976.pdf?arnumber=5476976 http://xplorestaging.ieee.org/ielx5/5476381/5476957/05476976.pdf?arnumber=5476976],&lt;br /&gt;
: [http://dx.doi.org/10.1109/async.2010.15 http://dx.doi.org/10.1109/async.2010.15]&lt;/div&gt;</summary>
		<author><name>Scipediacontent</name></author>	</entry>

	</feed>