<?xml version="1.0" encoding="UTF-8"?>
<rss version="2.0"
	xmlns:content="http://purl.org/rss/1.0/modules/content/"
	xmlns:wfw="http://wellformedweb.org/CommentAPI/"
	xmlns:dc="http://purl.org/dc/elements/1.1/"
	xmlns:atom="http://www.w3.org/2005/Atom"
	xmlns:sy="http://purl.org/rss/1.0/modules/syndication/"
	xmlns:slash="http://purl.org/rss/1.0/modules/slash/"
	>

<channel>
	<title>Geek in progress &#187; hpm</title>
	<atom:link href="http://www.itkovian.net/base/tag/hpm/feed/" rel="self" type="application/rss+xml" />
	<link>http://www.itkovian.net/base</link>
	<description>I am not yet done.</description>
	<lastBuildDate>Thu, 20 Oct 2011 20:56:59 +0000</lastBuildDate>
	<language>en</language>
	<sy:updatePeriod>hourly</sy:updatePeriod>
	<sy:updateFrequency>1</sy:updateFrequency>
	<generator>http://wordpress.org/?v=3.2.1</generator>
		<item>
		<title>Using HPM-Sampling to Drive Dynamic Compilation</title>
		<link>http://www.itkovian.net/base/using-hpm-sampling-to-drive-dynamic-compilation/</link>
		<comments>http://www.itkovian.net/base/using-hpm-sampling-to-drive-dynamic-compilation/#comments</comments>
		<pubDate>Sat, 12 May 2007 05:16:39 +0000</pubDate>
		<dc:creator>Itkovian</dc:creator>
				<category><![CDATA[paper]]></category>
		<category><![CDATA[research]]></category>
		<category><![CDATA[hpm]]></category>
		<category><![CDATA[java]]></category>
		<category><![CDATA[oopsla]]></category>

		<guid isPermaLink="false">http://www.itkovian.net/base/?p=148</guid>
		<description><![CDATA[The following paper has been acepted for publication at OOPSLA 2007.

<b>Using HPM-Sampling to Drive Dynamic Compilation</b>, <a href="http://buytaert.net">Dries Buytaert</a>, <a href="http://itkovian.net">Andy Georges</a>, <a href="http://www.research.ibm.com/people/h/hind/">Michael Hind</a>, <a href="http://www.research.ibm.com/people/m/marnold/">Matthew Arnold</a>, <a href="http://www.elis.ugent.be/~leeckhou">Lieven Eeckhout</a>, and <a href="http://www.elis.ugent.be/~kdb">Koen De Bosschere</a>.

The paper abstract reads as follows.

All high-performance production JVMs employ an adaptive strategy for program execution.  Methods are first executed unoptimized and then an online profiling mechanism is used to find a subset of methods that should be optimized during the same execution.  This paper empirically evaluates the design space of
several profilers for initiating dynamic compilation and shows that existing online profiling schemes suffer from several limitations. They provide an insufficient number of samples, are untimely, and have limited accuracy at determining the frequently executed methods.  We describe and comprehensively evaluate HPM-sampling, a simple but effective profiling scheme for finding  optimization candidates using hardware performance monitors (HPMs) that addresses the aforementioned limitations.  We show that HPM-sampling is more accurate; has low overhead; and improves performance by 5.7\% on average and up to 18.3\% when compared to the default system in Jikes RVM, without changing the compiler.]]></description>
			<content:encoded><![CDATA[<p>The following paper has been acepted for publication at OOPSLA 2007.</p>
<p><b>Using HPM-Sampling to Drive Dynamic Compilation</b>, <a href="http://buytaert.net">Dries Buytaert</a>, <a href="http://itkovian.net">Andy Georges</a>, <a href="http://www.research.ibm.com/people/h/hind/">Michael Hind</a>, <a href="http://www.research.ibm.com/people/m/marnold/">Matthew Arnold</a>, <a href="http://www.elis.ugent.be/~leeckhou">Lieven Eeckhout</a>, and <a href="http://www.elis.ugent.be/~kdb">Koen De Bosschere</a>.</p>
<p>The paper abstract reads as follows.</p>
<p>All high-performance production JVMs employ an adaptive strategy for program execution.  Methods are first executed unoptimized and then an online profiling mechanism is used to find a subset of methods that should be optimized during the same execution.  This paper empirically evaluates the design space of<br />
several profilers for initiating dynamic compilation and shows that existing online profiling schemes suffer from several limitations. They provide an insufficient number of samples, are untimely, and have limited accuracy at determining the frequently executed methods.  We describe and comprehensively evaluate HPM-sampling, a simple but effective profiling scheme for finding  optimization candidates using hardware performance monitors (HPMs) that addresses the aforementioned limitations.  We show that HPM-sampling is more accurate; has low overhead; and improves performance by 5.7\% on average and up to 18.3\% when compared to the default system in Jikes RVM, without changing the compiler.<br />
<!--break--></p>
<p>Montréal, here we come. October 21st &#8211; October 25th it is!</p>
<p>This paper has quite a long history behind it. Dries and I conceived the idea while attending the <a href="http://www.hipeac.net/acaces2006/">ACACES</a> summerschool in July 2006. After a long talk with Mike, we decided to launch some preliminary measurements with the system Dries had already built into Jikes RVM using the HPM interface I had adapted from <a href="http://cs.anu.edu.au/~Steve.Blackburn/">Steve Blackburn</a>&#8216;s <a href="http://user.it.uu.se/~mikpe/linux/perfctr/">perfctr patch for <a href="http://jikesrvm.sourceforge.net">Jikes RVM</a>. We intially targetted PLDI 2007, when some matters were brought to our attention, that questioned our original idea on the current state of the art. Submission was postponed, extra experiments were conducted and we targetted VEE instead, where our paper was rejected. Based on the reviews we received there, it seems like it was a border case, but a rejection nonetheless. So, we figured, why not submit to OOPSLA. Worst case scenario: we get additional reviews to improve our paper. I turns out that the Best Case Scenario was visited upon us instead. You can get a <a href="http://itkovian.net/base/files/papers/oopsla2007-buytaert-preprint.pdf">preprint</a> version.</p>
]]></content:encoded>
			<wfw:commentRss>http://www.itkovian.net/base/using-hpm-sampling-to-drive-dynamic-compilation/feed/</wfw:commentRss>
		<slash:comments>3</slash:comments>
		</item>
	</channel>
</rss>

