<?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/"
	xmlns:georss="http://www.georss.org/georss" xmlns:geo="http://www.w3.org/2003/01/geo/wgs84_pos#" xmlns:media="http://search.yahoo.com/mrss/"
		>
<channel>
	<title>Comments on: Compiling effortlessly &#8230; sort of</title>
	<atom:link href="http://kmandla.wordpress.com/2010/06/03/compiling-effortlessly-sort-of/feed/" rel="self" type="application/rss+xml" />
	<link>http://kmandla.wordpress.com/2010/06/03/compiling-effortlessly-sort-of/</link>
	<description>K.Mandla's blog of Linux experiences</description>
	<lastBuildDate>Mon, 11 Feb 2013 18:19:59 +0000</lastBuildDate>
	<sy:updatePeriod>hourly</sy:updatePeriod>
	<sy:updateFrequency>1</sy:updateFrequency>
	<generator>http://wordpress.com/</generator>
	<item>
		<title>By: JP Senior</title>
		<link>http://kmandla.wordpress.com/2010/06/03/compiling-effortlessly-sort-of/#comment-43656</link>
		<dc:creator><![CDATA[JP Senior]]></dc:creator>
		<pubDate>Tue, 08 Jun 2010 18:13:17 +0000</pubDate>
		<guid isPermaLink="false">http://kmandla.wordpress.com/2010/06/03/compiling-effortlessly-sort-of/#comment-43656</guid>
		<description><![CDATA[The completely fair scheduler is awesome; I do heavy visualization labs at home on qemu and virtualbox.  Often my CPU is pegged at 100% on all four cores.  The new scheduler is incredible when it comes to &#039;user&#039; components with something just as simple as my mouse.  IBM has a great report on CFQ at http://www.ibm.com/developerworks/linux/library/l-completely-fair-scheduler/ I&#039;ll admit 


With regards to compiling, most makefiles I&#039;ve come across in the wild don&#039;t attempt to use your neat-o multicore or hyperthreaded systems at all.  Try make -j3 to run 3 jobs on a 4 processor system - huge difference.  I usually leave one &quot;cpu&quot; or &quot;job&quot; available so I don&#039;t end up pinning each of my CPUs, allowing me to do normal work while I wait for the compile to finish.

Here&#039;s a comparison of compile times for pulseaudio 0.9.19.
w/o -j3

sudo time make
...snip...
95.67user 42.58system 2:20.17elapsed 98%CPU (0avgtext+0avgdata 222960maxresident)k
62192inputs+70096outputs (28major+13364466minor)pagefaults 0swaps

w -j4
sudo time make -j4
...snip...
96.60user 41.82system 0:38.79elapsed 356%CPU (0avgtext+0avgdata 222528maxresident)k
40inputs+66872outputs (0major+13299085minor)pagefaults 0swaps

2:20 vs 0:38!  Incredible!]]></description>
		<content:encoded><![CDATA[<p>The completely fair scheduler is awesome; I do heavy visualization labs at home on qemu and virtualbox.  Often my CPU is pegged at 100% on all four cores.  The new scheduler is incredible when it comes to &#8216;user&#8217; components with something just as simple as my mouse.  IBM has a great report on CFQ at <a href="http://www.ibm.com/developerworks/linux/library/l-completely-fair-scheduler/" rel="nofollow">http://www.ibm.com/developerworks/linux/library/l-completely-fair-scheduler/</a> I&#8217;ll admit </p>
<p>With regards to compiling, most makefiles I&#8217;ve come across in the wild don&#8217;t attempt to use your neat-o multicore or hyperthreaded systems at all.  Try make -j3 to run 3 jobs on a 4 processor system &#8211; huge difference.  I usually leave one &#8220;cpu&#8221; or &#8220;job&#8221; available so I don&#8217;t end up pinning each of my CPUs, allowing me to do normal work while I wait for the compile to finish.</p>
<p>Here&#8217;s a comparison of compile times for pulseaudio 0.9.19.<br />
w/o -j3</p>
<p>sudo time make<br />
&#8230;snip&#8230;<br />
95.67user 42.58system 2:20.17elapsed 98%CPU (0avgtext+0avgdata 222960maxresident)k<br />
62192inputs+70096outputs (28major+13364466minor)pagefaults 0swaps</p>
<p>w -j4<br />
sudo time make -j4<br />
&#8230;snip&#8230;<br />
96.60user 41.82system 0:38.79elapsed 356%CPU (0avgtext+0avgdata 222528maxresident)k<br />
40inputs+66872outputs (0major+13299085minor)pagefaults 0swaps</p>
<p>2:20 vs 0:38!  Incredible!</p>
]]></content:encoded>
	</item>
	<item>
		<title>By: Michele Amato</title>
		<link>http://kmandla.wordpress.com/2010/06/03/compiling-effortlessly-sort-of/#comment-43602</link>
		<dc:creator><![CDATA[Michele Amato]]></dc:creator>
		<pubDate>Thu, 03 Jun 2010 14:19:01 +0000</pubDate>
		<guid isPermaLink="false">http://kmandla.wordpress.com/2010/06/03/compiling-effortlessly-sort-of/#comment-43602</guid>
		<description><![CDATA[Thank you very much!!!]]></description>
		<content:encoded><![CDATA[<p>Thank you very much!!!</p>
]]></content:encoded>
	</item>
	<item>
		<title>By: K.Mandla</title>
		<link>http://kmandla.wordpress.com/2010/06/03/compiling-effortlessly-sort-of/#comment-43600</link>
		<dc:creator><![CDATA[K.Mandla]]></dc:creator>
		<pubDate>Thu, 03 Jun 2010 13:25:56 +0000</pubDate>
		<guid isPermaLink="false">http://kmandla.wordpress.com/2010/06/03/compiling-effortlessly-sort-of/#comment-43600</guid>
		<description><![CDATA[Not a problem. ;) 

http://pastebin.com/unqEFN3t ]]></description>
		<content:encoded><![CDATA[<p>Not a problem. <img src='http://s1.wp.com/wp-includes/images/smilies/icon_wink.gif' alt=';)' class='wp-smiley' />  </p>
<p><a href="http://pastebin.com/unqEFN3t" rel="nofollow">http://pastebin.com/unqEFN3t</a> </p>
]]></content:encoded>
	</item>
	<item>
		<title>By: cthulhu</title>
		<link>http://kmandla.wordpress.com/2010/06/03/compiling-effortlessly-sort-of/#comment-43599</link>
		<dc:creator><![CDATA[cthulhu]]></dc:creator>
		<pubDate>Thu, 03 Jun 2010 13:10:37 +0000</pubDate>
		<guid isPermaLink="false">http://kmandla.wordpress.com/2010/06/03/compiling-effortlessly-sort-of/#comment-43599</guid>
		<description><![CDATA[This is what it says on the distcc web-page:

&quot;distcc does not require all machines to share a filesystem, have synchronized clocks, or to have the same libraries or header files installed. They can even have different processors or operating systems, if cross-compilers are installed.&quot;

Not sure exactly what it means, but it sounds good.]]></description>
		<content:encoded><![CDATA[<p>This is what it says on the distcc web-page:</p>
<p>&#8220;distcc does not require all machines to share a filesystem, have synchronized clocks, or to have the same libraries or header files installed. They can even have different processors or operating systems, if cross-compilers are installed.&#8221;</p>
<p>Not sure exactly what it means, but it sounds good.</p>
]]></content:encoded>
	</item>
	<item>
		<title>By: Michele Amato</title>
		<link>http://kmandla.wordpress.com/2010/06/03/compiling-effortlessly-sort-of/#comment-43597</link>
		<dc:creator><![CDATA[Michele Amato]]></dc:creator>
		<pubDate>Thu, 03 Jun 2010 12:00:09 +0000</pubDate>
		<guid isPermaLink="false">http://kmandla.wordpress.com/2010/06/03/compiling-effortlessly-sort-of/#comment-43597</guid>
		<description><![CDATA[Hi! Can you share your dot-config file for kernel 2.6.34, please? Thanks in advance and scuse me for my very bad english...]]></description>
		<content:encoded><![CDATA[<p>Hi! Can you share your dot-config file for kernel 2.6.34, please? Thanks in advance and scuse me for my very bad english&#8230;</p>
]]></content:encoded>
	</item>
	<item>
		<title>By: Luca</title>
		<link>http://kmandla.wordpress.com/2010/06/03/compiling-effortlessly-sort-of/#comment-43596</link>
		<dc:creator><![CDATA[Luca]]></dc:creator>
		<pubDate>Thu, 03 Jun 2010 11:33:19 +0000</pubDate>
		<guid isPermaLink="false">http://kmandla.wordpress.com/2010/06/03/compiling-effortlessly-sort-of/#comment-43596</guid>
		<description><![CDATA[You can however it isn&#039;t exactly effortless. You need to ensure the machines in your compile farm all have the same toolchain (note: architecture) and libraries installed. Yanking the drive is definitely the easier of the two.]]></description>
		<content:encoded><![CDATA[<p>You can however it isn&#8217;t exactly effortless. You need to ensure the machines in your compile farm all have the same toolchain (note: architecture) and libraries installed. Yanking the drive is definitely the easier of the two.</p>
]]></content:encoded>
	</item>
	<item>
		<title>By: cthulhu</title>
		<link>http://kmandla.wordpress.com/2010/06/03/compiling-effortlessly-sort-of/#comment-43594</link>
		<dc:creator><![CDATA[cthulhu]]></dc:creator>
		<pubDate>Thu, 03 Jun 2010 07:48:48 +0000</pubDate>
		<guid isPermaLink="false">http://kmandla.wordpress.com/2010/06/03/compiling-effortlessly-sort-of/#comment-43594</guid>
		<description><![CDATA[I&#039;m no wizard at networks and stuff, but it was my understanding that you could use distcc to distribute the compiling process on the other machines, thereby making it a lot faster.]]></description>
		<content:encoded><![CDATA[<p>I&#8217;m no wizard at networks and stuff, but it was my understanding that you could use distcc to distribute the compiling process on the other machines, thereby making it a lot faster.</p>
]]></content:encoded>
	</item>
	<item>
		<title>By: K.Mandla</title>
		<link>http://kmandla.wordpress.com/2010/06/03/compiling-effortlessly-sort-of/#comment-43593</link>
		<dc:creator><![CDATA[K.Mandla]]></dc:creator>
		<pubDate>Thu, 03 Jun 2010 03:02:50 +0000</pubDate>
		<guid isPermaLink="false">http://kmandla.wordpress.com/2010/06/03/compiling-effortlessly-sort-of/#comment-43593</guid>
		<description><![CDATA[I&#039;m betting that&#039;s the answer then. Before now I rarely did any compiling  on this old machine because it seemed too taxing. Now, it seems to be able  of doing both without suffering so much. I am likewise thankful for that  improvement. :D ]]></description>
		<content:encoded><![CDATA[<p>I&#8217;m betting that&#8217;s the answer then. Before now I rarely did any compiling  on this old machine because it seemed too taxing. Now, it seems to be able  of doing both without suffering so much. I am likewise thankful for that  improvement. <img src='http://s0.wp.com/wp-includes/images/smilies/icon_biggrin.gif' alt=':D' class='wp-smiley' />  </p>
]]></content:encoded>
	</item>
	<item>
		<title>By: Reacocard</title>
		<link>http://kmandla.wordpress.com/2010/06/03/compiling-effortlessly-sort-of/#comment-43592</link>
		<dc:creator><![CDATA[Reacocard]]></dc:creator>
		<pubDate>Thu, 03 Jun 2010 02:55:01 +0000</pubDate>
		<guid isPermaLink="false">http://kmandla.wordpress.com/2010/06/03/compiling-effortlessly-sort-of/#comment-43592</guid>
		<description><![CDATA[There was a lot of work done on the CPU scheduler over that interval - 2.6.32 in particular (http://x264dev.multimedia.cx/?p=185).  The increase in responsiveness is indeed quite noticeable, even on my overpowered 2.5ghz core 2 duo.  Software that gets faster as it ages is one of my favorite things about open-source. :)]]></description>
		<content:encoded><![CDATA[<p>There was a lot of work done on the CPU scheduler over that interval &#8211; 2.6.32 in particular (<a href="http://x264dev.multimedia.cx/?p=185" rel="nofollow">http://x264dev.multimedia.cx/?p=185</a>).  The increase in responsiveness is indeed quite noticeable, even on my overpowered 2.5ghz core 2 duo.  Software that gets faster as it ages is one of my favorite things about open-source. <img src='http://s0.wp.com/wp-includes/images/smilies/icon_smile.gif' alt=':)' class='wp-smiley' /> </p>
]]></content:encoded>
	</item>
</channel>
</rss>
