section6

section6 - There is a short and sweet set of logical rules...

Info iconThis preview shows pages 1–8. Sign up to view the full content.

View Full Document Right Arrow Icon
+ Game of Life! February 11, 2011
Background image of page 1

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full DocumentRight Arrow Icon
+ Administrivia Midterms Soon Hw4 Soon Watch Jeopardy!
Background image of page 2
+ Today Talk about the basic concepts behind the game of life. Look at the Matlab code to get some ideas. Discuss possible parallelization strategies. What the heck is a sparse matrix? Goal: WIN CHOCOLATE!
Background image of page 3

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full DocumentRight Arrow Icon
+ Cellular Automaton Next Generation made from current state based on rules. Rules A cell in the next generation is alive if it has exactly three neighbors or was alive in the previous generation and has two neighbors. A previously alive cell dies if it has four or more neighbors.
Background image of page 4
+ The Environment Forms a Torus Imagine making a tube of a piece of paper and then connecting the edges
Background image of page 5

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full DocumentRight Arrow Icon
+ Insights from Matlab Code The way Professor Gilbert implemented this in Matlab is pretty clever. Indexing is used to wrap matrix into Torus Neighbor count calculation is done by shifting
Background image of page 6
Background image of page 7

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full DocumentRight Arrow Icon
Background image of page 8
This is the end of the preview. Sign up to access the rest of the document.

Unformatted text preview: There is a short and sweet set of logical rules for generating the next generation [Matlab Demo] + Parallelization Discussion What steps does the serial version take? What extra steps will we have to take? Where can we parallelize these steps (pending on your specific implementation): Shifts Data structures that can be distributed? Memory allocation (in specific cases) Update stage give right info at each point (#neighbors(i,j), S_t-1(i,j)) + Sparse Matrix Get a normal matrix version running first. Then consider this: What bits of information do you really need to calculate the next generation? How does this change your state representation? A sparse matrix is a matrix where many of the elements are zero. We dont have to store the zeros!...
View Full Document

This document was uploaded on 02/22/2011.

Page1 / 8

section6 - There is a short and sweet set of logical rules...

This preview shows document pages 1 - 8. Sign up to view the full document.

View Full Document Right Arrow Icon
Ask a homework question - tutors are online