240
edits
Changes
→Presentation
[[File:Out1.png|thumb|Maze 10x10]]
*Original Code:
}
* Analysis:
'''Parallelizable?'''
The program function named toPng() has a runtime of O(n^2); it takes up an average of 42% (min: 35%; max: 50%) of the program's execution time.
for (int i = 0; i < height; ++i) {
row_pointers[i] = new png_byte[width * 3];
for (int j = 0; j < width * 3; j += 3) {
row_pointers[i][j] = WALL;
row_pointers[i][j + 1] = WALL;
row_pointers[i][j + 2] = WALL;
}
}
* Profiling:
[[File:SDiagram.PNG]]
'''2. Parallelize'''
*Kernel: