<?xml version="1.0" encoding="UTF-8"?><rss version="2.0"
	xmlns:content="http://purl.org/rss/1.0/modules/content/"
	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/"
		>
<channel>
	<title>Comments for Preshing on Programming</title>
	<atom:link href="http://preshing.com/comments/feed" rel="self" type="application/rss+xml" />
	<link>http://preshing.com</link>
	<description></description>
	<lastBuildDate>Sun, 19 Feb 2012 08:12:39 +0000</lastBuildDate>
	<sy:updatePeriod>hourly</sy:updatePeriod>
	<sy:updateFrequency>1</sy:updateFrequency>
	<generator>http://wordpress.org/?v=3.1.3</generator>
	<item>
		<title>Comment on xkcd Password Generator by Jesse Thompson</title>
		<link>http://preshing.com/20110811/xkcd-password-generator#comment-3872</link>
		<dc:creator>Jesse Thompson</dc:creator>
		<pubDate>Sun, 19 Feb 2012 08:12:39 +0000</pubDate>
		<guid isPermaLink="false">http://preshing.com/?p=1404#comment-3872</guid>
		<description>Ah ha, I&#039;ve just performed an update whereby the entropy can be derived conveniently from mouse movements! I have that feature modularized so anyone can use that as well (it does rely on a SHA256 function, so I found a GPL one of them online) and.. it&#039;s just been a lot of fun to make! :B</description>
		<content:encoded><![CDATA[<p>Ah ha, I&#8217;ve just performed an update whereby the entropy can be derived conveniently from mouse movements! I have that feature modularized so anyone can use that as well (it does rely on a SHA256 function, so I found a GPL one of them online) and.. it&#8217;s just been a lot of fun to make! :B</p>
]]></content:encoded>
	</item>
	<item>
		<title>Comment on xkcd Password Generator by Jesse Thompson</title>
		<link>http://preshing.com/20110811/xkcd-password-generator#comment-3839</link>
		<dc:creator>Jesse Thompson</dc:creator>
		<pubDate>Sat, 18 Feb 2012 03:29:42 +0000</pubDate>
		<guid isPermaLink="false">http://preshing.com/?p=1404#comment-3839</guid>
		<description>Oh, there&#039;s a comments&#039; section. :)

I just got done building a very similar page, and then accidentally found yours.

http://lightsecond.com/passphrase.html

My word list is 2845 long, it&#039;s a selectively slimmed down copy of the Dale-Chall 3000 Simple Word List. I think my words are a bit more recognizable and easier to remember and spell. You&#039;re welcome to use my copy if you&#039;d like:

http://lightsecond.com/password_building_block_dict.txt

I also use push-buttons to select how many words you want, and I chose not to display words before you push a button so that your mind won&#039;t be tainted by compelling words prior to seeing a phrase that you like.

Lemme know what you think? :)</description>
		<content:encoded><![CDATA[<p>Oh, there&#8217;s a comments&#8217; section. <img src='http://preshing.com/wp-includes/images/smilies/icon_smile.gif' alt=':)' class='wp-smiley' /> </p>
<p>I just got done building a very similar page, and then accidentally found yours.</p>
<p><a href="http://lightsecond.com/passphrase.html" rel="nofollow">http://lightsecond.com/passphrase.html</a></p>
<p>My word list is 2845 long, it&#8217;s a selectively slimmed down copy of the Dale-Chall 3000 Simple Word List. I think my words are a bit more recognizable and easier to remember and spell. You&#8217;re welcome to use my copy if you&#8217;d like:</p>
<p><a href="http://lightsecond.com/password_building_block_dict.txt" rel="nofollow">http://lightsecond.com/password_building_block_dict.txt</a></p>
<p>I also use push-buttons to select how many words you want, and I chose not to display words before you push a button so that your mind won&#8217;t be tainted by compelling words prior to seeing a phrase that you like.</p>
<p>Lemme know what you think? <img src='http://preshing.com/wp-includes/images/smilies/icon_smile.gif' alt=':)' class='wp-smiley' /> </p>
]]></content:encoded>
	</item>
	<item>
		<title>Comment on A Look Back at Single-Threaded CPU Performance by Jeff Preshing</title>
		<link>http://preshing.com/20120208/a-look-back-at-single-threaded-cpu-performance#comment-3723</link>
		<dc:creator>Jeff Preshing</dc:creator>
		<pubDate>Sun, 12 Feb 2012 18:35:23 +0000</pubDate>
		<guid isPermaLink="false">http://preshing.com/?p=2558#comment-3723</guid>
		<description>I&#039;m sure SPEC has legitimate reasons for allowing autoparallelization in their results. For example, if a customer has a huge single-threaded codebase that they just want to run faster by any means, CPU2006 can help them choose a system configuration. That&#039;s useful.

But I think there are several reasons to focus on purely single-threaded processes only:

&lt;ol&gt;
&lt;li&gt;Complex software will become more and more constrained by &lt;a href=&quot;http://en.wikipedia.org/wiki/Amdahl%27s_law&quot; rel=&quot;nofollow&quot;&gt;Amdahl&#039;s Law&lt;/a&gt;, and it&#039;s useful to quantify to what extent we are, and will be, limited by this law.&lt;/li&gt;
&lt;li&gt;It gives us a better idea how the CPU microarchitecture itself has evolved.&lt;/li&gt;
&lt;li&gt;In a true single-threaded process, we know that the other cores are available to do work. You can launch N copies of the process and expect up to N times the throughput (assuming no shared bottlenecks). But when an application has been auto-parallelized, the same can no longer be said, so the comparison is not completely fair, in my opinion.&lt;/li&gt;
&lt;/ol&gt;
</description>
		<content:encoded><![CDATA[<p>I&#8217;m sure SPEC has legitimate reasons for allowing autoparallelization in their results. For example, if a customer has a huge single-threaded codebase that they just want to run faster by any means, CPU2006 can help them choose a system configuration. That&#8217;s useful.</p>
<p>But I think there are several reasons to focus on purely single-threaded processes only:</p>
<ol>
<li>Complex software will become more and more constrained by <a href="http://en.wikipedia.org/wiki/Amdahl%27s_law" rel="nofollow">Amdahl&#8217;s Law</a>, and it&#8217;s useful to quantify to what extent we are, and will be, limited by this law.</li>
<li>It gives us a better idea how the CPU microarchitecture itself has evolved.</li>
<li>In a true single-threaded process, we know that the other cores are available to do work. You can launch N copies of the process and expect up to N times the throughput (assuming no shared bottlenecks). But when an application has been auto-parallelized, the same can no longer be said, so the comparison is not completely fair, in my opinion.</li>
</ol>
]]></content:encoded>
	</item>
	<item>
		<title>Comment on A Look Back at Single-Threaded CPU Performance by Eas</title>
		<link>http://preshing.com/20120208/a-look-back-at-single-threaded-cpu-performance#comment-3699</link>
		<dc:creator>Eas</dc:creator>
		<pubDate>Sat, 11 Feb 2012 23:45:51 +0000</pubDate>
		<guid isPermaLink="false">http://preshing.com/?p=2558#comment-3699</guid>
		<description>Very interesting.

Seems like an argument can be made for leaving the autoparallelization influenced results uncorrected.  These benchmarks have always tested CPU+compiler. If the compiler can eek more performance out of single threaded code by spreading it over multiple cores, why shouldn&#039;t that count?  

I&#039;m curious what the trend line looked like bck into the early 90s.  At just about the point your grap starts, Intel lost a significant part of the market for high-performance programmable digital logic to the 3D chip vendors. It is also about the time we started seeing SIMD instructions in mainstream CPUs.  I wonder what impact those things had on investment in single threaded performance.</description>
		<content:encoded><![CDATA[<p>Very interesting.</p>
<p>Seems like an argument can be made for leaving the autoparallelization influenced results uncorrected.  These benchmarks have always tested CPU+compiler. If the compiler can eek more performance out of single threaded code by spreading it over multiple cores, why shouldn&#8217;t that count?  </p>
<p>I&#8217;m curious what the trend line looked like bck into the early 90s.  At just about the point your grap starts, Intel lost a significant part of the market for high-performance programmable digital logic to the 3D chip vendors. It is also about the time we started seeing SIMD instructions in mainstream CPUs.  I wonder what impact those things had on investment in single threaded performance.</p>
]]></content:encoded>
	</item>
	<item>
		<title>Comment on A Look Back at Single-Threaded CPU Performance by Aaron Davies</title>
		<link>http://preshing.com/20120208/a-look-back-at-single-threaded-cpu-performance#comment-3677</link>
		<dc:creator>Aaron Davies</dc:creator>
		<pubDate>Fri, 10 Feb 2012 23:52:37 +0000</pubDate>
		<guid isPermaLink="false">http://preshing.com/?p=2558#comment-3677</guid>
		<description>Ah, thanks much! (I&#039;m not terribly familiar with SPEC&#039;s methodology.)</description>
		<content:encoded><![CDATA[<p>Ah, thanks much! (I&#8217;m not terribly familiar with SPEC&#8217;s methodology.)</p>
]]></content:encoded>
	</item>
	<item>
		<title>Comment on A Look Back at Single-Threaded CPU Performance by Jeff Preshing</title>
		<link>http://preshing.com/20120208/a-look-back-at-single-threaded-cpu-performance#comment-3634</link>
		<dc:creator>Jeff Preshing</dc:creator>
		<pubDate>Thu, 09 Feb 2012 15:35:12 +0000</pubDate>
		<guid isPermaLink="false">http://preshing.com/?p=2558#comment-3634</guid>
		<description>They&#039;re adjusted CPU2006 results. (I excluded six benchmarks from the calculation.) You can look at this number as a ballpark figure for single-threaded performance &lt;a href=&quot;http://www.spec.org/cpu2006/Docs/readme1st.html#Q23&quot; rel=&quot;nofollow&quot;&gt;relative to a Sun Ultra Enterprise 2&lt;/a&gt;.</description>
		<content:encoded><![CDATA[<p>They&#8217;re adjusted CPU2006 results. (I excluded six benchmarks from the calculation.) You can look at this number as a ballpark figure for single-threaded performance <a href="http://www.spec.org/cpu2006/Docs/readme1st.html#Q23" rel="nofollow">relative to a Sun Ultra Enterprise 2</a>.</p>
]]></content:encoded>
	</item>
	<item>
		<title>Comment on A Look Back at Single-Threaded CPU Performance by Aaron Davies</title>
		<link>http://preshing.com/20120208/a-look-back-at-single-threaded-cpu-performance#comment-3633</link>
		<dc:creator>Aaron Davies</dc:creator>
		<pubDate>Thu, 09 Feb 2012 14:45:53 +0000</pubDate>
		<guid isPermaLink="false">http://preshing.com/?p=2558#comment-3633</guid>
		<description>Nice graphs. Just out of curiosity, what exactly are they normalized &lt;i&gt;to&lt;/i&gt;? What&#039;s at 1.0 on each graph?</description>
		<content:encoded><![CDATA[<p>Nice graphs. Just out of curiosity, what exactly are they normalized <i>to</i>? What&#8217;s at 1.0 on each graph?</p>
]]></content:encoded>
	</item>
	<item>
		<title>Comment on A Look Back at Single-Threaded CPU Performance by Samuel Williams</title>
		<link>http://preshing.com/20120208/a-look-back-at-single-threaded-cpu-performance#comment-3628</link>
		<dc:creator>Samuel Williams</dc:creator>
		<pubDate>Thu, 09 Feb 2012 11:21:43 +0000</pubDate>
		<guid isPermaLink="false">http://preshing.com/?p=2558#comment-3628</guid>
		<description>Fantastic graphs - great job!</description>
		<content:encoded><![CDATA[<p>Fantastic graphs &#8211; great job!</p>
]]></content:encoded>
	</item>
	<item>
		<title>Comment on High-Resolution Mandelbrot in Obfuscated Python by Jeff Preshing</title>
		<link>http://preshing.com/20110926/high-resolution-mandelbrot-in-obfuscated-python#comment-3610</link>
		<dc:creator>Jeff Preshing</dc:creator>
		<pubDate>Wed, 08 Feb 2012 22:02:29 +0000</pubDate>
		<guid isPermaLink="false">http://preshing.com/?p=1846#comment-3610</guid>
		<description>There are various bits of information in the &lt;a href=&quot;http://www.reddit.com/r/programming/comments/krpem/highresolution_mandelbrot_in_obfuscated_python/&quot; rel=&quot;nofollow&quot;&gt;Reddit discussion&lt;/a&gt;. Not as organized as a blog post, but it might answer some questions for you...</description>
		<content:encoded><![CDATA[<p>There are various bits of information in the <a href="http://www.reddit.com/r/programming/comments/krpem/highresolution_mandelbrot_in_obfuscated_python/" rel="nofollow">Reddit discussion</a>. Not as organized as a blog post, but it might answer some questions for you&#8230;</p>
]]></content:encoded>
	</item>
	<item>
		<title>Comment on High-Resolution Mandelbrot in Obfuscated Python by Grayson Carroll</title>
		<link>http://preshing.com/20110926/high-resolution-mandelbrot-in-obfuscated-python#comment-3608</link>
		<dc:creator>Grayson Carroll</dc:creator>
		<pubDate>Wed, 08 Feb 2012 21:36:11 +0000</pubDate>
		<guid isPermaLink="false">http://preshing.com/?p=1846#comment-3608</guid>
		<description>I second the comment requesting an explanation similar to the penrose code you worked on,
I got a lot out of that. If you could give us some hints on the actual process of obfuscation, that could be
very useful as well.</description>
		<content:encoded><![CDATA[<p>I second the comment requesting an explanation similar to the penrose code you worked on,<br />
I got a lot out of that. If you could give us some hints on the actual process of obfuscation, that could be<br />
very useful as well.</p>
]]></content:encoded>
	</item>
</channel>
</rss>

