In this project, we are implementing the high-performance version of the triangular counting algorithm that can work efficiently on big systems using Graphit, a new domain specific programming language suited for graphs that generates fast implementations from high-level algorithm specifications. Then, we are planning to compare the result with previous works done in this field. If time permits, we will extend our project to implement different highly optimized graph algorithms in Graphit and work towards improving the current version of Graphit.

I am majoring in 6-3 (Computer Science and Engineering). The classes I have taken at MIT prepared me for SuperUROP. By doing this project, I hope to learn more about performance engineering and gain more practical skills. I am excited about the many challenges that the project will bring.