Starting soon!
From: Pl-seminar <pl-seminar-bounces@xxxxxxxxxxx> on behalf of JOHN CYPHERT <pl-seminar-bounces@xxxxxxxxxxx>
Sent: Friday, May 21, 2021 11:32 AM
To: pl-seminar@xxxxxxxxxxx <pl-seminar@xxxxxxxxxxx>
Subject: Re: [madPL] Kirshanthan Sundararajah madPL Seminar
Sorry, I jumped the gun. 1 hr 30 min reminder!
From: JOHN CYPHERT <jcyphert@xxxxxxxx>
Sent: Friday, May 21, 2021 11:32 AM
To: pl-seminar@xxxxxxxxxxx <pl-seminar@xxxxxxxxxxx>
Subject: Re: Kirshanthan Sundararajah madPL Seminar
30 min reminder!
From: JOHN CYPHERT
Sent: Monday, May 17, 2021 11:04 AM
To: pl-seminar@xxxxxxxxxxx <pl-seminar@xxxxxxxxxxx>
Subject: Kirshanthan Sundararajah madPL Seminar
Hi everyone,
We will be having a PL seminar this
Friday May 21 at 1pm central. Kirshanthan ("Krish") Sundararajah a student of Milind Kulkarni at Purdue will be talking about "Composable, Sound Transformations for Nested Recursion
and Loops".
Abstract:
Over the past few decades, extensive research has been done on composing, verifying, and applying scheduling transformations like loop interchange and loop tiling for regular programs that use loops to operate over arrays and matrices.
As a result, we have general frameworks such as the polyhedral model to handle transformations for loop-based programs. Irregular programs, in contrast, use recursion and loops to manipulate pointer-based data structures. Irregular programs appear in many
essential applications such as scientific simulations, data mining, and graphics rendering. However, there is no analogous framework to the polyhedral model for recursive programs. Prior transformations designed for irregular programs are problem-specific
and not easily portable.
In this talk, I will discuss PolyRec, a uniïed general framework that can compose and apply scheduling transformations to nested recursive programs, and reason about the correctness of composed transformations. I will focus on the main
components of Polyrec: Representations of the computation schedule, transformations of that schedule, abstractions to capture dependences in the computation, and a method to verify the soundness of transformations in the presence of dependences. I will conclude
with my going work on extensions of PolyRec to incorporate new scheduling transformations and related future work.
Short Bio: Kirshanthan Sundararajah is a PhD Candidate in the School of Electrical and Computer Engineering at Purdue University, advised by Prof. Milind Kulkarni. His research interests lie in the areas of compilers, programming languages,
and high-performance computing. He is particularly interested in optimizing irregular programs that are recursive. Recently, he has been awarded the Bilsland Dissertation Fellowship for his PhD thesis work. He has spent time as an intern at Microsoft Research,
Reservoir Labs, and Nvidia working on various problems related to performance engineering. He earned his Bachelor's in Electronic and Telecommunication Engineering at the University of Moratuwa, Sri Lanka.
Hope to see you there,
John
Join Zoom Meeting
https://uwmadison.zoom.us/j/96790303225?pwd=V1pwRUhGQVlCcWFyczJ3L2N4dXlHUT09
Meeting ID: 967 9030 3225
Passcode: 044287
One tap mobile
+19292056099,,96790303225#,,,,*044287# US (New York)
+13017158592,,96790303225#,,,,*044287# US (Washington DC)
Dial by your location
+1 929 205 6099 US (New York)
+1 301 715 8592 US (Washington DC)
+1 312 626 6799 US (Chicago)
+1 669 900 6833 US (San Jose)
+1 253 215 8782 US (Tacoma)
+1 346 248 7799 US (Houston)
Meeting ID: 967 9030 3225
Passcode: 044287
Find your local number: https://uwmadison.zoom.us/u/aeaOmGfjMC
Join by SIP
96790303225@xxxxxxxxxxx
Join by H.323
162.255.37.11 (US West)
162.255.36.11 (US East)
115.114.131.7 (India Mumbai)
115.114.115.7 (India Hyderabad)
213.19.144.110 (Amsterdam Netherlands)
213.244.140.110 (Germany)
103.122.166.55 (Australia Sydney)
103.122.167.55 (Australia Melbourne)
149.137.40.110 (Singapore)
64.211.144.160 (Brazil)
69.174.57.160 (Canada Toronto)
65.39.152.160 (Canada Vancouver)
207.226.132.110 (Japan Tokyo)
149.137.24.110 (Japan Osaka)
Meeting ID: 967 9030 3225
Passcode: 044287
|
|