Changes

Jump to: navigation, search

Installation Wizards

2,317 bytes added, 04:23, 15 February 2017
Created page with "{{GPU610/DPS915 Index | 20171}} = Installation Wizards = == Team Members == # [mailto:mdbell@myseneca.ca?subject=gpu610 Matthew Bell] # [mailto:kramsamujh@myseneca.ca?subject..."
{{GPU610/DPS915 Index | 20171}}
= Installation Wizards =
== Team Members ==
# [mailto:mdbell@myseneca.ca?subject=gpu610 Matthew Bell]
# [mailto:kramsamujh@myseneca.ca?subject=gpu610 Kevin Ramsamujh]

[mailto:mdbell@myseneca.ca,kramsamujh@myseneca.ca?subject=gpu610 Email All]

== Progress ==
=== Assignment 1 ===
== Image Processing ==
Much like previous students who have taken this course, we decided to look over image processing (leveraging Christopher Ginac's PGM parser http://www.dreamincode.net/forums/topic/76816-image-processing-tutorial/ ).

For our profiling we scale an image up 10 times to better profile larger data sets, as our source image was only ~800kb in size. We then negate the image, and then reflect it.

The time taken to perform all 3 operations:
real 0m22.057s
user 0m4.584s
sys 0m14.221s


The results of our tests:
Flat profile:
Each sample counts as 0.01 seconds.
% cumulative self self total
time seconds seconds calls s/call s/call name
42.92 6.70 6.70 3 2.23 2.23 Image::operator=(Image const&)
29.15 11.25 4.55 2 2.27 2.27 Image::Image(int, int, int)
15.31 13.64 2.39 1 2.39 2.39 Image::Image(Image const&)
4.04 14.27 0.63 writeImage(char*, Image&)
2.56 14.67 0.40 Image::negateImage(Image&)
2.37 15.04 0.37 86832000 0.00 0.00 Image::getPixelVal(int, int)
2.18 15.38 0.34 Image::reflectImage(bool, Image&)
1.47 15.61 0.23 Image::enlargeImage(int, Image&)
0.00 15.61 0.00 868320 0.00 0.00 Image::setPixelVal(int, int, int)
0.00 15.61 0.00 3 0.00 0.00 Image::~Image()
0.00 15.61 0.00 1 0.00 0.00 _GLOBAL__sub_I__ZN5ImageC2Ev
0.00 15.61 0.00 1 0.00 0.00 _GLOBAL__sub_I_main
0.00 15.61 0.00 1 0.00 0.00 Image::getImageInfo(int&, int&, int&)

As wel can see, negating the image as well as reflecting and enlarging it are all costly operations, and we believe that we can optimize it to take far less time.

=== Assignment 2 ===
=== Assignment 3 ===
21
edits

Navigation menu