Friday, June 14, 2013

[tmqcawsq] Game of Life as thread optimization

Program Conway's Game of Life cellular automata the "obvious" way: every cell is a separate thread which checks its neighbors every clock cycle.  For a universe with side length 2^64, one will need 2^128 threads.  With coordinates expressed as arbitrary precision integers, one needs an infinite number of threads.

Use automated or semi-automated compiler tools to "optimize" this naive implementation to one that will actually run, ultimately aiming for a hashlife optimized version like Golly.  This is a pretty big dream.

No comments :