Dear LLVM contributors,
I am a first year P.h.D. student at Ural Federal University majoring
in "Mathematical modelling, numerical methods, and software
complexes". At the moment my research focuses on a machine-specific
performance modelling and polyhedral optimizations.
During the Google Summer of Code 2016 I will work on the "Improvement
of vectorization process in Polly" project, which description can be
found on the following link .
I am planning to do the following during the first five weeks:
1. Understand why we attain only 73.97% with our current manual
implementation of Matrix-Matrix Multiplication . According to ,
we can expect 90% of the turbo boost peak of the processor with the C
2. Implement determination of statements that contain only matrix
3. Implement tilings and interchanges of specific loops based on the
algorithm presented in . At this step all necessary parameters of a
target architecture (e.g. sizes of cache lines) could be passed as
command line parameters.
I would be very grateful for your comments, feedback and ideas about
the plan and the whole project.
Information about updates of the project after reaching the milestones
will be published in my blog, which can be found on the following link
 - https://docs.google.com/document/d/1lXYvyGP3mME5QRc912TXtjdqf7-1k_s1-xVl7JgeTpw/edit?usp=sharing
 - https://drive.google.com/file/d/0B2Wloo-931AoUUU1T2ZLTDFHNFk/view
 - http://wiki.cs.utexas.edu/rvdg/HowToOptimizeGemm
 - http://www.cs.utexas.edu/users/flame/pubs/TOMS-BLIS-Analytical.pdf
 - http://romangareev.blogspot.ru