<?xml version="1.0"?>
<feed xmlns="http://www.w3.org/2005/Atom" xml:lang="en">
		<id>https://www.scipedia.com/wd/index.php?action=history&amp;feed=atom&amp;title=Dhar_et_al_2008a</id>
		<title>Dhar et al 2008a - Revision history</title>
		<link rel="self" type="application/atom+xml" href="https://www.scipedia.com/wd/index.php?action=history&amp;feed=atom&amp;title=Dhar_et_al_2008a"/>
		<link rel="alternate" type="text/html" href="https://www.scipedia.com/wd/index.php?title=Dhar_et_al_2008a&amp;action=history"/>
		<updated>2026-04-25T21:28:40Z</updated>
		<subtitle>Revision history for this page on the wiki</subtitle>
		<generator>MediaWiki 1.27.0-wmf.10</generator>

	<entry>
		<id>https://www.scipedia.com/wd/index.php?title=Dhar_et_al_2008a&amp;diff=193908&amp;oldid=prev</id>
		<title>Scipediacontent: Scipediacontent moved page Draft Content 392515731 to Dhar et al 2008a</title>
		<link rel="alternate" type="text/html" href="https://www.scipedia.com/wd/index.php?title=Dhar_et_al_2008a&amp;diff=193908&amp;oldid=prev"/>
				<updated>2021-01-28T20:03:08Z</updated>
		
		<summary type="html">&lt;p&gt;Scipediacontent moved page &lt;a href=&quot;/public/Draft_Content_392515731&quot; class=&quot;mw-redirect&quot; title=&quot;Draft Content 392515731&quot;&gt;Draft Content 392515731&lt;/a&gt; to &lt;a href=&quot;/public/Dhar_et_al_2008a&quot; title=&quot;Dhar et al 2008a&quot;&gt;Dhar et al 2008a&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 20:03, 28 January 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>https://www.scipedia.com/wd/index.php?title=Dhar_et_al_2008a&amp;diff=193907&amp;oldid=prev</id>
		<title>Scipediacontent: Created page with &quot; == Abstract ==   path confidence estimate indicates the likelihood that the processor is currently fetching correct path instructions. Accurate path confidence prediction is...&quot;</title>
		<link rel="alternate" type="text/html" href="https://www.scipedia.com/wd/index.php?title=Dhar_et_al_2008a&amp;diff=193907&amp;oldid=prev"/>
				<updated>2021-01-28T20:03:03Z</updated>
		
		<summary type="html">&lt;p&gt;Created page with &amp;quot; == Abstract ==   path confidence estimate indicates the likelihood that the processor is currently fetching correct path instructions. Accurate path confidence prediction is...&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;
 path confidence estimate indicates the likelihood that the processor is currently fetching correct path instructions. Accurate path confidence prediction is critical for applications like pipeline gating and confidence-based SMT fetch prioritization. Previous work in this domain uses a threshold-and-count predictor, where the number of unresolved, low-confidence branches serves as an estimate of path confidence. This approach is inaccurate since it implicitly assumes that all low-confidence branches have the same mispredict rate, and that high-confidence branches never mispredict. We propose an alternative path confidence predictor designed from first principles, called PaCo, that directly estimates the probability that the processor is on the goodpath, and considers contributions from all branches, both high and low confidence. Even though it uses only modest hardware, PaCo can estimate the processorpsilas goodpath likelihood with very high accuracy, with an RMS error of 3.8%. We show that PaCo significantly outperforms threshold-and-count predictors in pipeline gating and SMT fetch prioritization. In pipeline gating, while the best conventional predictor can reduce badpath instructions executed by 7% with a small loss in performance, PaCo can reduce bad-path instructions by 32% without any performance loss. In SMT fetch prioritization, using PaCo instead of conventional path confidence predictors improves performance by up to 23%, and 5.5% on average.&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;
* [https://www.ideals.illinois.edu/bitstream/2142/74601/2/B59-CRHC_07_08.pdf https://www.ideals.illinois.edu/bitstream/2142/74601/2/B59-CRHC_07_08.pdf]&lt;br /&gt;
&lt;br /&gt;
* [http://xplorestaging.ieee.org/ielx5/4653641/4658618/04658627.pdf?arnumber=4658627 http://xplorestaging.ieee.org/ielx5/4653641/4658618/04658627.pdf?arnumber=4658627],&lt;br /&gt;
: [http://dx.doi.org/10.1109/hpca.2008.4658627 http://dx.doi.org/10.1109/hpca.2008.4658627]&lt;br /&gt;
&lt;br /&gt;
* [https://dblp.uni-trier.de/db/conf/hpca/hpca2008.html#MalikADF08 https://dblp.uni-trier.de/db/conf/hpca/hpca2008.html#MalikADF08],&lt;br /&gt;
: [http://yadda.icm.edu.pl/yadda/element/bwmeta1.element.ieee-000004658627 http://yadda.icm.edu.pl/yadda/element/bwmeta1.element.ieee-000004658627],&lt;br /&gt;
: [https://ieeexplore.ieee.org/document/4658627 https://ieeexplore.ieee.org/document/4658627],&lt;br /&gt;
: [https://www.ideals.illinois.edu/handle/2142/74601 https://www.ideals.illinois.edu/handle/2142/74601],&lt;br /&gt;
: [https://academic.microsoft.com/#/detail/2108498195 https://academic.microsoft.com/#/detail/2108498195]&lt;/div&gt;</summary>
		<author><name>Scipediacontent</name></author>	</entry>

	</feed>