Difference between revisions of "DPS921 Team Optimize"
| Line 1: | Line 1: | ||
| + | = The Game of Life = | ||
| + | |||
| + | == Group Members == | ||
| + | |||
| + | # [mailto:lkapur@myseneca.ca?subject=DPS921%20from%20CDOT%20Wiki Luv Kapur], Research, and everything else. | ||
| + | |||
| + | == Progress == | ||
| + | |||
| + | '''Entry on: November 6th 2016''' | ||
| + | |||
| + | Assignment page (Optimize) has been created and he following project topic is being researched on | ||
| + | * The Game Of Life - Cilk Plus Implementation - [https://en.wikipedia.org/wiki/Conway's_Game_of_Life] | ||
| + | |||
| + | '''Entry on: November 14th 2016 ''' | ||
| + | |||
| + | The Game of Life, is thoroughly researched and the following key points have been derived: | ||
| + | * Problem Description and Algorithm Analysis | ||
| + | * Serial Implementation | ||
| + | * Cilk Plus Implementation | ||
| + | * OpenMP Implementation | ||
| + | * TBB Implementation | ||
| + | * Comparative Analysis of all the parallel versions | ||
| + | |||
| + | ---- | ||
| + | |||
| + | == Research == | ||
| + | |||
| + | === References === | ||
| + | ''All the research is based from the following resources:'' | ||
| + | * Comway's Game Of Life - Algorithm Description - [http://www.math.cornell.edu/~lipa/mec/lesson6.html] | ||
| + | * Comway's Game Of Life - Rules - [http://web.mit.edu/sp.268/www/2010/lifeSlides.pdf] | ||
| + | * Example Generations - [https://en.wikipedia.org/wiki/Conway's_Game_of_Life] | ||
| + | |||
| + | '''Entry on: November 27th 2016 by Luv Kapur''' | ||
| + | |||
| + | ---- | ||
| + | === Algorithm Description === | ||
| + | Comway's Game of Life is a algorithmic representation of cellular automation developed by John Conway in 1970. The game is played on an infinite two-dimensional rectangular grid of cells. Each cell has two probable states, alive or dead. Depending on the state of that cell's 8 neighbors, the state of each cell changes each turn of the game, constituting a unique generation on every computation . Neighbors of a cell are cells that touch that cell, either horizontal, vertical, or diagonal from that cell. | ||
| + | |||
| + | The initial pattern is the first generation. The second generation evolves from applying the rules simultaneously to every cell on the game board, i.e. births and deaths happen simultaneously. Afterwards, the rules are iteratively applied to create future generations. For each generation of the game, a cell's status in the next generation is determined by a set of rules. | ||
| + | |||
| + | ---- | ||
| + | === Rules === | ||
| + | The rules of the game are simple, and describe the next generation of cells in the grid: | ||
| + | * '''Birth''': a cell that is dead at time t will be alive at time t +1 if exactly 3 of its eight neighbors were alive at time t | ||
| + | * '''Death''': a cell can die by: | ||
| + | ** '''Overcrowding''': if a cell is alive at time t + 1 and 4 or more of its neighbors are also alive at time t, the cell will be dead at time t + 1 | ||
| + | ** '''Exposure''': If a live cell at time t has only 1 live neighbor or no live neighbors, it will be dead at time t + 1 | ||
| + | * '''Survival''': a cell survives from time t to time t + 1 if and only if 2 or 3 of its neighbors are alive at time t | ||
| + | |||
| + | ---- | ||
| + | === Examples === | ||
| + | Using the above two dimensional infinite playground and rules as outline above, the following patterns emerge during various cell positions during various generations. | ||
| + | |||
| + | * Triomino Patterns | ||
| + | [[File:Gol_Example.png|600px|thumb|center|alt| Triomino Patterns]] | ||
| + | |||
| + | * Still Life Patterns | ||
| + | [[File:still_life_example.png|600px|thumb|center|alt| Still Life Patterns]] | ||
| + | ---- | ||
=== Serial Implementation === | === Serial Implementation === | ||
The serial implementation of the above algorithm divides the problem in two three distinct classes. | The serial implementation of the above algorithm divides the problem in two three distinct classes. | ||
Revision as of 21:00, 27 November 2016
Contents
The Game of Life
Group Members
- Luv Kapur, Research, and everything else.
Progress
Entry on: November 6th 2016
Assignment page (Optimize) has been created and he following project topic is being researched on
- The Game Of Life - Cilk Plus Implementation - [1]
Entry on: November 14th 2016
The Game of Life, is thoroughly researched and the following key points have been derived:
- Problem Description and Algorithm Analysis
- Serial Implementation
- Cilk Plus Implementation
- OpenMP Implementation
- TBB Implementation
- Comparative Analysis of all the parallel versions
Research
References
All the research is based from the following resources:
- Comway's Game Of Life - Algorithm Description - [2]
- Comway's Game Of Life - Rules - [3]
- Example Generations - [4]
Entry on: November 27th 2016 by Luv Kapur
Algorithm Description
Comway's Game of Life is a algorithmic representation of cellular automation developed by John Conway in 1970. The game is played on an infinite two-dimensional rectangular grid of cells. Each cell has two probable states, alive or dead. Depending on the state of that cell's 8 neighbors, the state of each cell changes each turn of the game, constituting a unique generation on every computation . Neighbors of a cell are cells that touch that cell, either horizontal, vertical, or diagonal from that cell.
The initial pattern is the first generation. The second generation evolves from applying the rules simultaneously to every cell on the game board, i.e. births and deaths happen simultaneously. Afterwards, the rules are iteratively applied to create future generations. For each generation of the game, a cell's status in the next generation is determined by a set of rules.
Rules
The rules of the game are simple, and describe the next generation of cells in the grid:
- Birth: a cell that is dead at time t will be alive at time t +1 if exactly 3 of its eight neighbors were alive at time t
- Death: a cell can die by:
- Overcrowding: if a cell is alive at time t + 1 and 4 or more of its neighbors are also alive at time t, the cell will be dead at time t + 1
- Exposure: If a live cell at time t has only 1 live neighbor or no live neighbors, it will be dead at time t + 1
- Survival: a cell survives from time t to time t + 1 if and only if 2 or 3 of its neighbors are alive at time t
Examples
Using the above two dimensional infinite playground and rules as outline above, the following patterns emerge during various cell positions during various generations.
- Triomino Patterns
- Still Life Patterns
Serial Implementation
The serial implementation of the above algorithm divides the problem in two three distinct classes.
- Cellular - the class which defines the cell. It keeps track of the generation, pointer to a world class which defines the dimensions in which the cell exists and a pointer to the rule class which governs the change in the cell on every generation.
- World - the class which defines the world, the environment for the cell in which the cell undergoes evolution. The class contains the dimensions for the 2D dimensional matrix where the cell is positioned.
- Rule - the class which defines the rule which govern the evolution in every generation. It contains pointers to two world object, the current and the next computed one.
Serial Hot Spot
The serial implementation basically applies the rule to every cell in the 2D dimensional matrix, and computes another world determining the position of every cell using the number of neighbours surrounding it. The following loop takes the maximum amount of computation time in determining the position of the cells in the next generation. This will be parallelized in the coming sections.
