Regularizing the Irregular: Analyses and Transformations for Recursive, Irregular Applications

Explore a seminar on optimizing irregular programs that operate on pointer-based data structures like trees and graphs. Delve into the research efforts of Milind Kulkarni's group to automatically optimize tree-traversing applications. Learn about their key insight of abstracting data structure traversals as vector operations, enabling the design of transformations to enhance locality and enable vectorization. Discover the analyses developed to prove the soundness of these transformations. Gain insights into future research directions in this field. The talk is presented by Milind Kulkarni, an associate professor at Purdue University, whose research focuses on developing efficient languages, compilers, and systems for complex applications on advanced computation platforms.