{[ promptMessage ]}

Bookmark it

{[ promptMessage ]}

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

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

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

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

View Full Document Right Arrow Icon
+ Administrivia Midterms Soon Hw4 Soon Watch Jeopardy!
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!
Image of page 3

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

View Full Document Right 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.
Image of page 4
+ The Environment Forms a Torus Imagine making a tube of a piece of paper and then connecting the edges
Image of page 5

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

View Full Document Right 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
Image of page 6
Image of page 7

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

View Full Document Right Arrow Icon
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 don’t have to store the zeros!...
View Full Document

{[ snackBarMessage ]}

What students are saying

  • Left Quote Icon

    As a current student on this bumpy collegiate pathway, I stumbled upon Course Hero, where I can find study resources for nearly all my courses, get online help from tutors 24/7, and even share my old projects, papers, and lecture notes with other students.

    Student Picture

    Kiran Temple University Fox School of Business ‘17, Course Hero Intern

  • Left Quote Icon

    I cannot even describe how much Course Hero helped me this summer. It’s truly become something I can always rely on and help me. In the end, I was not only able to survive summer classes, but I was able to thrive thanks to Course Hero.

    Student Picture

    Dana University of Pennsylvania ‘17, Course Hero Intern

  • Left Quote Icon

    The ability to access any university’s resources through Course Hero proved invaluable in my case. I was behind on Tulane coursework and actually used UCLA’s materials to help me move forward and get everything together on time.

    Student Picture

    Jill Tulane University ‘16, Course Hero Intern