<?xml version="1.0" encoding="utf-8"?>
<rss version="2.0" xml:base="http://www.kerneltrap.org"  xmlns:dc="http://purl.org/dc/elements/1.1/">
<channel>
 <title>KernelTrap - Life</title>
 <link>http://www.kerneltrap.org/taxonomy/term/25/0</link>
 <description></description>
 <language>en-local</language>
<item>
 <title>Simulator vs. Emulator (Simulation vs. Emulation)</title>
 <link>http://www.kerneltrap.org/node/59263</link>
 <description>&lt;!-- google_ad_section_start --&gt;&lt;p&gt;The first question regarding the difference between simulator and emulator I encountered in my undergraduate class of computer organization and architecture. The lecturer gave the difference in the aspect of completeness. But, ever since I had been wondering about the difference. Therefore, today I decide to round up the difference based on my own life experience of using simulator and emulator.&lt;/p&gt;
&lt;!-- google_ad_section_end --&gt;&lt;p&gt;&lt;a href=&quot;http://www.kerneltrap.org/node/59263&quot; target=&quot;_blank&quot;&gt;read more&lt;/a&gt;&lt;/p&gt;</description>
 <comments>http://www.kerneltrap.org/node/59263#comments</comments>
 <category domain="http://www.kerneltrap.org/taxonomy/term/4493">difference simulator vs. emulator simulation vs. emulation</category>
 <category domain="http://www.kerneltrap.org/taxonomy/term/25">Life</category>
 <pubDate>Sat, 08 May 2010 06:36:02 +0000</pubDate>
 <dc:creator>Eus</dc:creator>
 <guid isPermaLink="false">59263 at http://www.kerneltrap.org</guid>
</item>
<item>
 <title>My Undergraduate Thesis</title>
 <link>http://www.kerneltrap.org/node/59163</link>
 <description>&lt;!-- google_ad_section_start --&gt;&lt;p&gt;Rather than letting my undergraduate thesis be buried in the shelf, I will just publish it &lt;a href=&quot;http://kerneltrap.org/files/Revision - Print - Tadeus Prastowo - Implementation of AF_ATN Raw Socket for the ATN TP4-CLNP Networking Suite.pdf&quot;&gt;here&lt;/a&gt;.&lt;/p&gt;
&lt;!-- google_ad_section_end --&gt;&lt;p&gt;&lt;a href=&quot;http://www.kerneltrap.org/node/59163&quot; target=&quot;_blank&quot;&gt;read more&lt;/a&gt;&lt;/p&gt;</description>
 <comments>http://www.kerneltrap.org/node/59163#comments</comments>
 <category domain="http://www.kerneltrap.org/taxonomy/term/4473">tadeus prastowo undergraduate thesis ATN CLNP TP4 networking suite</category>
 <category domain="http://www.kerneltrap.org/taxonomy/term/25">Life</category>
 <pubDate>Fri, 07 May 2010 13:55:40 +0000</pubDate>
 <dc:creator>Eus</dc:creator>
 <guid isPermaLink="false">59163 at http://www.kerneltrap.org</guid>
</item>
<item>
 <title>Paradigm Shift in Using Memory</title>
 <link>http://www.kerneltrap.org/node/58163</link>
 <description>&lt;!-- google_ad_section_start --&gt;&lt;p&gt;As a C programmer I was told that I should use as little memory as possible. Unfortunately, that advise didn&#039;t come along with the fact that I should make a trade-off between software complexity, computing speed and memory usage: more malloc()s means more instructions to be executed, and therefore, the computing speed suffers and the software complexity increases (e.g., how about if malloc() fails?), and vice versa. I was aware about the trade-off but had not got the paradigm shift. Now I do get the shift.&lt;/p&gt;
&lt;!-- google_ad_section_end --&gt;&lt;p&gt;&lt;a href=&quot;http://www.kerneltrap.org/node/58163&quot; target=&quot;_blank&quot;&gt;read more&lt;/a&gt;&lt;/p&gt;</description>
 <comments>http://www.kerneltrap.org/node/58163#comments</comments>
 <category domain="http://www.kerneltrap.org/taxonomy/term/4423">make making trade-off speed memory complexity</category>
 <category domain="http://www.kerneltrap.org/taxonomy/term/25">Life</category>
 <pubDate>Thu, 29 Apr 2010 09:31:25 +0000</pubDate>
 <dc:creator>Eus</dc:creator>
 <guid isPermaLink="false">58163 at http://www.kerneltrap.org</guid>
</item>
<item>
 <title>Practicing Piano and Hacking</title>
 <link>http://www.kerneltrap.org/node/57883</link>
 <description>&lt;!-- google_ad_section_start --&gt;&lt;p&gt;Last week my brother asked me to help him find the piano score of Final Fantasy VII&#039;s Those Who Fight. Well, since I had never heard the song before, I searched for one in YouTube and landed on: &lt;a href=&quot;http://www.youtube.com/watch?v=ssGdJNe2PHE&quot; title=&quot;http://www.youtube.com/watch?v=ssGdJNe2PHE&quot;&gt;http://www.youtube.com/watch?v=ssGdJNe2PHE&lt;/a&gt;.&lt;/p&gt;
&lt;!-- google_ad_section_end --&gt;&lt;p&gt;&lt;a href=&quot;http://www.kerneltrap.org/node/57883&quot; target=&quot;_blank&quot;&gt;read more&lt;/a&gt;&lt;/p&gt;</description>
 <comments>http://www.kerneltrap.org/node/57883#comments</comments>
 <category domain="http://www.kerneltrap.org/taxonomy/term/4413">playing piano vs. hacking</category>
 <category domain="http://www.kerneltrap.org/taxonomy/term/25">Life</category>
 <pubDate>Mon, 26 Apr 2010 16:23:30 +0000</pubDate>
 <dc:creator>Eus</dc:creator>
 <guid isPermaLink="false">57883 at http://www.kerneltrap.org</guid>
</item>
<item>
 <title>What is Special about Peterson&#039;s Mutex?</title>
 <link>http://www.kerneltrap.org/node/57873</link>
 <description>&lt;!-- google_ad_section_start --&gt;&lt;p&gt;Reading the book on &lt;a href=&quot;http://mitpress.mit.edu/catalog/item/default.asp?ttype=2&amp;amp;tid=11481&quot;&gt;Principles of Model Checking&lt;/a&gt; by Christel Baier and Joost-Pieter Katoen, on page 43-45, I was reminded about a particular property of &lt;a href=&quot;http://en.wikipedia.org/wiki/Peterson%27s_algorithm&quot;&gt;Peterson&#039;s mutual exclusion algorithm&lt;/a&gt; that I forgot from my undergraduate operating systems class, and therefore, I had pondered till I read the book. In particular, I was wondering why the need for the turn variable. Peterson&#039;s mutual exclusion algorithm is special in the way that it has the inclusion of a scheduling strategy to ensure the progress of the competing processes. Ha, I really forgot the obvious!&lt;/p&gt;
&lt;!-- google_ad_section_end --&gt;&lt;p&gt;&lt;a href=&quot;http://www.kerneltrap.org/node/57873&quot; target=&quot;_blank&quot;&gt;read more&lt;/a&gt;&lt;/p&gt;</description>
 <comments>http://www.kerneltrap.org/node/57873#comments</comments>
 <category domain="http://www.kerneltrap.org/taxonomy/term/4403">why peterson&#039;s mutex vs. plain semaphore</category>
 <category domain="http://www.kerneltrap.org/taxonomy/term/25">Life</category>
 <pubDate>Mon, 26 Apr 2010 16:00:30 +0000</pubDate>
 <dc:creator>Eus</dc:creator>
 <guid isPermaLink="false">57873 at http://www.kerneltrap.org</guid>
</item>
<item>
 <title>To Lock or not to Lock?</title>
 <link>http://www.kerneltrap.org/node/57853</link>
 <description>&lt;!-- google_ad_section_start --&gt;&lt;p&gt;A basic problem that I encountered when I started to developed a stand-alone application involving the use of a DB, which is &lt;a href=&quot;http://github.com/eus/service_publishing_ap&quot;&gt;Service Publishing AP&lt;/a&gt;&#039;s service_list, as opposed to a web application is to decide whether I should employ locking or copying when using an iterator to iterate, for example, a shared linked list or a shared DB.&lt;/p&gt;
&lt;!-- google_ad_section_end --&gt;&lt;p&gt;&lt;a href=&quot;http://www.kerneltrap.org/node/57853&quot; target=&quot;_blank&quot;&gt;read more&lt;/a&gt;&lt;/p&gt;</description>
 <comments>http://www.kerneltrap.org/node/57853#comments</comments>
 <category domain="http://www.kerneltrap.org/taxonomy/term/4393">how to iterate data iterating reader-writer lock make a copy decision</category>
 <category domain="http://www.kerneltrap.org/taxonomy/term/25">Life</category>
 <pubDate>Mon, 26 Apr 2010 14:30:00 +0000</pubDate>
 <dc:creator>Eus</dc:creator>
 <guid isPermaLink="false">57853 at http://www.kerneltrap.org</guid>
</item>
<item>
 <title>Fixing Screen Resolution of GNU/Linux Ubuntu Hardy X Server</title>
 <link>http://www.kerneltrap.org/node/57623</link>
 <description>&lt;!-- google_ad_section_start --&gt;&lt;p&gt;A month ago my dad told me that his GNU/Linux Ubuntu Hardy screen resolution stuck at 640x480 because somebody had fiddled with his computer to fix something else. So, I goog