budvin.edippuliarachchi@tufts.edu
I am a graduate research assistant at Department of Computer Science , Tufts University. I am supervised by Prof. Hari Sundar. Before that I got my bachelor’s degree from Department of Computer Science & Engineering , University of Moratuwa, Sri Lanka.
My primary research is in the intersection of scientific computations on distributed systems and graph decomposition. I am interested in utilizing graph algorithms to optimize computation and communication costs in scientific computations. I am also interested in building compilers for Domain Specific Languages for Partial Differential Equation solvers.
BSc in Computer Science Engineering (2022)
University of Moratuwa
The Cornell, Maryland, Max Planck Pre-doctoral Research School (August 2022)
Max Planck Institute for Software Systems in Saarbrücken, Germany
Profiling the new software suite ALICE O2 developed by CERN for their run 3. Research involves executing sample workflows, profiling them with memory and CPU profiling tools to identify potential bottlenecks.
Research to explore the ability to utilize a commodity computer cluster to efficiently perform K-mer counting. Research is mainly based on searching for optimization strategies with MPI framework to obtain performance gains which can be scaled for a distributed environment.
Budvin Edippuliarachchi, Damika Gamlath, Ruchin Amaratunga, Gunavaran Brihadiswaran, and Sanath Jayasena. 2022. Quill: A Memory Efficient k-mer Counting and k-mer Querying Tool for Commodity Clusters. In Proceedings of the 14th International Conference on Bioinformatics and Biomedical Technology (ICBBT ‘22).
Gold Medal - Dept. of Computer Science and Engineering, Univ. of Moratuwa (2022)
Awarded for achieving the best overall GPA for computer science specialization.
Dean’s List - University of Moratuwa (2017-2021)
For all consecutive semesters
Champions - Aces Coders v8.0 (2020)
One of the largest competitive programming competitions in Sri Lanka which is organized by the University of
Peradeniya.
Top 100 - IEEEXtreme (2021, 2020)
IEEEXtreme 14.0 (2021) - Global Rank 71st
IEEEXtreme 13.0 (2020) - Global Rank 92nd
Champions - UoJ Coders (2019)
12-hr competitive programming competition organized by the University of Jaffna.
Bronze Medalist - Sri Lanka Mathematics Olympiad - Junior (2008)
Preliminary mathematics olympiad round held in Sri Lanka to qualify for the International Mathematics
Olympiad competition.
Software Engineer - Expert Intelligence (2023)
Cloud infrastructure automation and full stack development.
Backend Engineer, DevOps Consultant - IXD Labs (2021-2023)
Backend development and cloud infrastructure management for web based products and services.
Software Engineering Intern - Mitra Innovation (2020, 2021)
6 month software engineering internship covering AWS services, event driven software design, multi-tenant architecture, real-time data streaming, performance optimization in web apps and 3D animations with vector mathematics.
Teaching Assistant - Dept. of Computer Science and Engineering, Univ. of Moratuwa (2021, 2022)
CS3062 - Theory of Computing
CS2022 - Data Structures and Algorithms
CS1033 - Programming Fundamentals
Step Up - Introduction to Algorithms (2022)
Step up is a technical workshop Organized by the IEEE Student Branch University of Jaffna. This workshop mainly focuses on Competitive Programming and making students aware of Data Structures and Algorithms.
Prolog To XTREME 15.0 (2021)
A virtual webinar hosted by The IEEE Student Branch of the University of Jaffna, focusing on Algorithms & Data Structures for the IEEEXtreme 15.0 coding competition with the purpose of guiding their students and to get an idea about the tricks and tips, to solve the problems.
CodeSolveur (2021)
Organized by the IEEE Student Branch of General Sir John Kotelawala Defece University in collaboration with the IEEEXtreme Sri Lanka Section to enhance the knowledge of KDU undergraduates on competitive programming. During this session mainly the techniques of competitive programming such as divide and conquer, dynamic programming and greedy approach were discussed.