This preview shows pages 1–2. Sign up to view the full content.
This preview has intentionally blurred sections. Sign up to view the full version.View Full Document
Unformatted text preview: CS 140 Assignment 5: Life in the Fast Lane Assigned February 7, 2010 Due by 11:59 pm Friday, February 18 The object of this problem is to implement a cellular automaton called the Game of Life in Cilk++, and to tune it to get maximum performance. The program itself is pretty simple, but there are subtle issues in performance tuning. There’s a prize for the fastest program; details are below. 1 Background Life takes place on an infinite two-dimensional grid of squares, each of which is either empty or occupied by an organism. Each grid square has eight neighbors: two horizontal, two vertical, and four diagonal. Time moves in discrete steps called “generations”. At each generation, the organisms are born, live, and die, according to the following rules. • If an empty square has exactly three occupied neighbors, a new organism is born in that square and it becomes occupied. • If an occupied square has exactly two or three occupied neighbors, it remains occupied. • If an occupied square has more than three occupied neighbors, its organism dies of overcrowd- ing and the square becomes empty....
View Full Document
This document was uploaded on 02/22/2011.
- Spring '09