Misc/abrash-black-book
Watch
1
0
Fork
You've already forked abrash-black-book
 0
Code Issues Pull requests Projects Releases Packages Wiki Activity Actions

Use proper lists instead of DLs with bullet points

Browse source
This commit is contained in:
James Gregory 2013-12-30 13:34:37 +11:00
commit 7e957c0bb4
12 changed files with 83 additions and 83 deletions
Download patch file Download diff file Expand all files Collapse all files

10
17-06.html
View file

@ -38,11 +38,11 @@
<P><BR></P>
<P>We&rsquo;re still not ready for assembly, though; what we need is a new perspective that lends itself to vastly better performance in C<SMALL>++</SMALL>. The Life program in the next section is <I>three to seven times</I> faster than Listing 17.4&mdash;and it&rsquo;s still in C<SMALL>++</SMALL>.</P>
<P>How is this possible? Here are some hints:</P>
<DL>
<DD><B>&#149;</B>&nbsp;&nbsp;After a few dozen generations, most of the cellmap consists of cells in the off state.
<DD><B>&#149;</B>&nbsp;&nbsp;There are many possible cellmap representations other than one bit-per-pixel.
<DD><B>&#149;</B>&nbsp;&nbsp;Cells change state relatively infrequently.
</DL>
<ul>
<li>After a few dozen generations, most of the cellmap consists of cells in the off state.</li>
<li>There are many possible cellmap representations other than one bit-per-pixel.</li>
<li>Cells change state relatively infrequently.</li>
</ul>
<H3><A NAME="Heading8"></A><FONT COLOR="#000077">Bringing In the Right Brain</FONT></H3>
<P>In the previous section, we saw how a C<SMALL>++</SMALL> program could be sped up about eight times simply by rearranging the data and code in straightforward ways. Now we&rsquo;re going to see how right-brain non-linear optimization can speed things up by another four times&mdash;and make the code <I>simpler.</I></P>
<P>Now <I>that&rsquo;s</I> Zen code optimization.</P>