PhD Defense by Tong Zhou

Primary tabs

Title: High-level Compiler Optimizations for Python Programs
Date: Thursday, December 7th
Time: 2 PM – 4 PM (ET)
Location: Klaus 3402
Virtual: https://gatech.zoom.us/my/tzhou80?pwd=b3EzUGRiWGY5Y2VkamZtdVJ2WTh5UT09

Tong Zhou
Ph.D. Candidate
School of Computer Science
Georgia Institute of Technology

Committee
Dr. Vivek Sarkar (Advisor) - School of Computer Science, Georgia Institute of Technology
Dr. Jun Shirako - School of Computer Science, Georgia Institute of Technology
Dr. Santosh Pande - School of Computer Science, Georgia Institute of Technology
Dr. Tushar Krishna - School of Electrical and Computer Engineering, Georgia Institute of Technology
Dr. Rich Vuduc - School of Computational Science and Engineering, Georgia Institute of Technology

Abstract:
As Python becomes the de facto high-level programming language for many data analytics and scientific computing domains, it becomes increasingly critical to build optimizing compilers that are able to generate efficient sequential and parallel code from Python programs to keep up with the insatiable demands for performance in these domains. Programs written in high-level languages like Python often make extensive use of arrays as a core data type, and mathematical functions applied on the arrays, in conjunction with general loops and element-level array accesses. Such a programming style poses both challenges and opportunities for optimizing compilers. We recognize that current compilers are limited in their ability to make effective use of the high-level operator and loop semantics to generate efficient code on modern parallel architectures.

This dissertation presents three pieces of work that demonstrate that compilers that leverage high-level operator and loop semantics can deliver improved performance for Python programs on CPUs and GPUs, relative to past work. On the CPU front, we present Intrepydd, a Python to C++ compiler that compiles a broad class of Python language constructs and NumPy array operators to sequential and parallel C++ code on CPUs. On the GPU front, we present APPy (Annotated Parallelism for Python), which enables users to parallelize generic Python loops and tensor expressions for execution on GPUs by simply adding compiler directives (annotations) to Python code. Then for programs consisting of sparse tensor operators, we introduce ReACT, which consists of a set of code generation techniques that achieve greater redundancy elimination than state-of-the-art.

Groups

Status

Categories

  • No categories were selected.

Keywords

  • No keywords were submitted.

Target Audience