Regularizing the Irregular: Analyses and Transformations for Recursive, Irregular Applications
Offered By: Paul G. Allen School via YouTube
Course Description
Overview
Save Big on Coursera Plus. 7,000+ courses at $160 off. Limited Time Only!
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.
Syllabus
PLSE Seminar Series M Kulkarni "Regularizing the irregular: analyses and transformations..."
Taught by
Paul G. Allen School
Related Courses
Computer Science Essentials: AlgorithmsPackt via FutureLearn Complete Intro to Computer Science
Frontend Masters Tree and Graph Data Structures
Frontend Masters Python Data Structures: Trees
LinkedIn Learning Python: Recursion
LinkedIn Learning