Implementation of Strassen Algorithm w/ parallel programming for Matrix Multiplication

• I implemented strassen algorithm for matrix multiplication
• I studied parallel parallel programming(very slightly) and implemented multi thread and OpenMP to boost the speed

Performance

• Before the implementation of algorithm, I checked which data structure is the fastest static/dynamic array and vector You can check the code in Performance.cpp

I will keep updating this file...

Reference

[1] Strassen Algorithim Description : https://en.wikipedia.org/wiki/Strassen_algorithm

[2] Question about OpenMP Application to MatrixMultiplication : https://stackoverflow.com/questions/22634121/openmp-c-matrix-multiplication-run-slower-in-parallel

[3] Implementation example of Strassen Multiplication : https://github.com/wcochran/strassen_multiplier/blob/master/mm.c

[4] Stair effect of Strassen Multiplication : https://stackoverflow.com/questions/4304600/matrix-multiplication-strassen-vs-standard

[5] Array and Pointer : http://0www.parkjonghyuk.net/lecture/programming1/lecturenote/chap06-6.pdf

[6] Multi-thread : https://gist.github.com/nadavrot/5b35d44e8ba3dd718e595e40184d03f0#why-is-this-program-slow

[7] Markdown : https://pandao.github.io/editor.md/en.html