91
edits
Changes
→Serial Implementation
----
=== Serial Implementation ===
==== Structure ====
The serial implementation of the above algorithm divides the problem in two three distinct classes.
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.
[[File:serial_hotspot.png|600px|thumb|center|alt| Apply Rules Class ]]
==== Results ====