<?xml version="1.0" encoding="UTF-8"?>
<rss version="2.0" xmlns:atom="http://www.w3.org/2005/Atom"><channel><title>Robust benchmarking in noisy environments · HackerPapers discussions</title><link>https://hackerpaper.kaipfister.de/p/1608.04295/</link><description>Collected HN comments and submissions linking this paper.</description><language>en</language><lastBuildDate>Mon, 02 Nov 2026 11:16:22 GMT</lastBuildDate><atom:link href="https://hackerpaper.kaipfister.de/p/1608.04295/feed.xml" rel="self" type="application/rss+xml" /><item><title>Robust benchmarking in noisy environments — mentioned by suavesito</title><link>https://news.ycombinator.com/item?id=37443815</link><guid isPermaLink="false">urn:hackerpapers:mention:1608.04295:37443815</guid><pubDate>Sat, 09 Sep 2023 10:16:13 GMT</pubDate><description>&lt;p&gt;I think you might not be familiar with the package used to benchmark Julia [1]. It does not fix processes to CPU&amp;#x27;s, or set kernel governor to performance, and there are fluctuations from usage of the computer. But it does run the function for several seconds and returns the distribution of the runs (the little graphics underneath the benchmarks). It calculates standard deviation and if some runs are too small (sub-nano seconds) it emits warnings saying the results might be caused by inlining and constant propagation. The differences in runtimes you refer to are from use of different machines…&lt;/p&gt;&lt;p&gt;&lt;a href="https://hackerpaper.kaipfister.de/p/1608.04295/"&gt;Paper and discussion history&lt;/a&gt;. A mention is not an endorsement.&lt;/p&gt;</description><category>cs.PF</category></item><item><title>Robust benchmarking in noisy environments — mentioned by longemen3000</title><link>https://news.ycombinator.com/item?id=22086669</link><guid isPermaLink="false">urn:hackerpapers:mention:1608.04295:22086669</guid><pubDate>Sat, 18 Jan 2020 19:52:31 GMT</pubDate><description>&lt;p&gt;https://arxiv.org/abs/1608.04295 this paper is the statistical basis of time measuring in Julia. It is, at least a good read when trying to measure the execution of some program seriously at low level. It uses also a predictor of the estimate number of evaluations via a logistic function&lt;/p&gt;&lt;p&gt;&lt;a href="https://hackerpaper.kaipfister.de/p/1608.04295/"&gt;Paper and discussion history&lt;/a&gt;. A mention is not an endorsement.&lt;/p&gt;</description><category>cs.PF</category></item><item><title>Robust benchmarking in noisy environments — HN submission</title><link>https://news.ycombinator.com/item?id=12295364</link><guid isPermaLink="false">urn:hackerpapers:submission:1608.04295:12295364</guid><pubDate>Tue, 16 Aug 2016 03:32:43 GMT</pubDate><description>&lt;p&gt;Robust benchmarking in noisy environments&lt;/p&gt;&lt;p&gt;&lt;/p&gt;&lt;p&gt;2 points; 0 discussion replies on HN. &lt;a href="https://hackerpaper.kaipfister.de/p/1608.04295/"&gt;Paper and source history&lt;/a&gt;. A submission is not an endorsement.&lt;/p&gt;</description><category>cs.PF</category></item></channel></rss>
