<feed xmlns='http://www.w3.org/2005/Atom'>
<title>cacount, branch analysis</title>
<subtitle>enumerate finite space 1D CA state space</subtitle>
<link rel='alternate' type='text/html' href='http://code.sotun.de/git/cacount/'/>
<entry>
<title>analysis: compute average and cumulative trajectory length</title>
<updated>2013-06-28T14:31:14Z</updated>
<author>
<name>Jan Huwald</name>
<email>jh@sotun.de</email>
</author>
<published>2013-06-28T14:31:14Z</published>
<link rel='alternate' type='text/html' href='http://code.sotun.de/git/cacount/commit/?id=e96ca19e6874a10ba828597fa05962dd2bdcfff7'/>
<id>e96ca19e6874a10ba828597fa05962dd2bdcfff7</id>
<content type='text'>
</content>
<content type='xhtml'>
<div xmlns='http://www.w3.org/1999/xhtml'>
<pre>
</pre>
</div>
</content>
</entry>
<entry>
<title>add canon program option to test canonicalisation</title>
<updated>2013-06-25T12:58:09Z</updated>
<author>
<name>Jan Huwald</name>
<email>jh@sotun.de</email>
</author>
<published>2013-06-25T12:58:09Z</published>
<link rel='alternate' type='text/html' href='http://code.sotun.de/git/cacount/commit/?id=f9fb52f365f2354d2133a05e7dee92eb8edc5ec4'/>
<id>f9fb52f365f2354d2133a05e7dee92eb8edc5ec4</id>
<content type='text'>
</content>
<content type='xhtml'>
<div xmlns='http://www.w3.org/1999/xhtml'>
<pre>
</pre>
</div>
</content>
</entry>
<entry>
<title>.</title>
<updated>2013-06-25T12:58:01Z</updated>
<author>
<name>Jan Huwald</name>
<email>jh@sotun.de</email>
</author>
<published>2013-06-25T12:58:01Z</published>
<link rel='alternate' type='text/html' href='http://code.sotun.de/git/cacount/commit/?id=2f7d24215ec57f5376f06e4cc3d8136a6e26ed28'/>
<id>2f7d24215ec57f5376f06e4cc3d8136a6e26ed28</id>
<content type='text'>
</content>
<content type='xhtml'>
<div xmlns='http://www.w3.org/1999/xhtml'>
<pre>
</pre>
</div>
</content>
</entry>
<entry>
<title>use ordered map in cycleStat() to get sorted result</title>
<updated>2013-06-25T12:55:15Z</updated>
<author>
<name>Jan Huwald</name>
<email>jh@sotun.de</email>
</author>
<published>2013-06-25T12:55:15Z</published>
<link rel='alternate' type='text/html' href='http://code.sotun.de/git/cacount/commit/?id=98117566229c24d84dc15f1d794fba88dd40da4a'/>
<id>98117566229c24d84dc15f1d794fba88dd40da4a</id>
<content type='text'>
</content>
<content type='xhtml'>
<div xmlns='http://www.w3.org/1999/xhtml'>
<pre>
</pre>
</div>
</content>
</entry>
<entry>
<title>change computation of cycle id and redundancy detection</title>
<updated>2013-06-25T12:47:34Z</updated>
<author>
<name>Jan Huwald</name>
<email>jh@sotun.de</email>
</author>
<published>2013-06-25T12:47:34Z</published>
<link rel='alternate' type='text/html' href='http://code.sotun.de/git/cacount/commit/?id=53fefbf1505e0a28b37534a6e17b2a61cef58a0a'/>
<id>53fefbf1505e0a28b37534a6e17b2a61cef58a0a</id>
<content type='text'>
1. Introduce acanonize(state), which returns a canonical state and a
   (bit-encoded) label wether the encoded state was itself canonical
2. Use this labelled canonical state as inital color of each
   state. Now:
   - every redundant cycle has the same color (except for the label)
   - of each set of redundant cycles exactly one has the label set
3. Use the extended label to gather loop statistics.
</content>
<content type='xhtml'>
<div xmlns='http://www.w3.org/1999/xhtml'>
<pre>
1. Introduce acanonize(state), which returns a canonical state and a
   (bit-encoded) label wether the encoded state was itself canonical
2. Use this labelled canonical state as inital color of each
   state. Now:
   - every redundant cycle has the same color (except for the label)
   - of each set of redundant cycles exactly one has the label set
3. Use the extended label to gather loop statistics.
</pre>
</div>
</content>
</entry>
<entry>
<title>fix computation of maxState</title>
<updated>2013-06-25T12:41:16Z</updated>
<author>
<name>Jan Huwald</name>
<email>jh@sotun.de</email>
</author>
<published>2013-06-25T12:41:16Z</published>
<link rel='alternate' type='text/html' href='http://code.sotun.de/git/cacount/commit/?id=c45681cfcddb27f7c416ec4328eece7bf9779031'/>
<id>c45681cfcddb27f7c416ec4328eece7bf9779031</id>
<content type='text'>
</content>
<content type='xhtml'>
<div xmlns='http://www.w3.org/1999/xhtml'>
<pre>
</pre>
</div>
</content>
</entry>
<entry>
<title>.</title>
<updated>2013-06-25T09:03:20Z</updated>
<author>
<name>Jan Huwald</name>
<email>jh@sotun.de</email>
</author>
<published>2013-06-25T09:03:20Z</published>
<link rel='alternate' type='text/html' href='http://code.sotun.de/git/cacount/commit/?id=13dcafc1853d206f41498933072f16ea37b58189'/>
<id>13dcafc1853d206f41498933072f16ea37b58189</id>
<content type='text'>
</content>
<content type='xhtml'>
<div xmlns='http://www.w3.org/1999/xhtml'>
<pre>
</pre>
</div>
</content>
</entry>
<entry>
<title>skip unneccessary loops in findCycle</title>
<updated>2013-06-24T09:31:17Z</updated>
<author>
<name>Jan Huwald</name>
<email>jh@sotun.de</email>
</author>
<published>2013-06-24T09:31:17Z</published>
<link rel='alternate' type='text/html' href='http://code.sotun.de/git/cacount/commit/?id=b17c7882e6dd83f728f11e11611f1f925556ba09'/>
<id>b17c7882e6dd83f728f11e11611f1f925556ba09</id>
<content type='text'>
</content>
<content type='xhtml'>
<div xmlns='http://www.w3.org/1999/xhtml'>
<pre>
</pre>
</div>
</content>
</entry>
<entry>
<title>support canceling iterTrans if no work is done anymore</title>
<updated>2013-06-24T09:20:54Z</updated>
<author>
<name>Jan Huwald</name>
<email>jh@sotun.de</email>
</author>
<published>2013-06-24T09:20:54Z</published>
<link rel='alternate' type='text/html' href='http://code.sotun.de/git/cacount/commit/?id=21d9e26dfb72ba6d0fa4f3f40a439e51d943d349'/>
<id>21d9e26dfb72ba6d0fa4f3f40a439e51d943d349</id>
<content type='text'>
A bool is passed to the worker function to store wether any work has
been done in an iterState round. To prevent cache line bouncing, each
worker thread has its own cache line aligned bool which is ultimately
merged.
</content>
<content type='xhtml'>
<div xmlns='http://www.w3.org/1999/xhtml'>
<pre>
A bool is passed to the worker function to store wether any work has
been done in an iterState round. To prevent cache line bouncing, each
worker thread has its own cache line aligned bool which is ultimately
merged.
</pre>
</div>
</content>
</entry>
<entry>
<title>compute cycle redundancy again, refractor, optimize</title>
<updated>2013-06-14T13:09:25Z</updated>
<author>
<name>Jan Huwald</name>
<email>jh@sotun.de</email>
</author>
<published>2013-06-14T13:09:25Z</published>
<link rel='alternate' type='text/html' href='http://code.sotun.de/git/cacount/commit/?id=aac019848c8813fe9dff3a8e9128c418f1225cda'/>
<id>aac019848c8813fe9dff3a8e9128c418f1225cda</id>
<content type='text'>
</content>
<content type='xhtml'>
<div xmlns='http://www.w3.org/1999/xhtml'>
<pre>
</pre>
</div>
</content>
</entry>
</feed>
