BEGIN:VCALENDAR
VERSION:2.0
PRODID:Linklings LLC
BEGIN:VTIMEZONE
TZID:America/New_York
X-LIC-LOCATION:America/New_York
BEGIN:DAYLIGHT
TZOFFSETFROM:-0500
TZOFFSETTO:-0400
TZNAME:EDT
DTSTART:19700308T020000
RRULE:FREQ=YEARLY;BYMONTH=3;BYDAY=2SU
END:DAYLIGHT
BEGIN:STANDARD
TZOFFSETFROM:-0400
TZOFFSETTO:-0500
TZNAME:EST
DTSTART:19701101T020000
RRULE:FREQ=YEARLY;BYMONTH=11;BYDAY=1SU
END:STANDARD
END:VTIMEZONE
BEGIN:VEVENT
DTSTAMP:20210402T160544Z
LOCATION:Track 6
DTSTART;TZID=America/New_York:20201112T100000
DTEND;TZID=America/New_York:20201112T183000
UID:submissions.supercomputing.org_SC20_sess212@linklings.com
SUMMARY:LLVM-HPC2020: The Sixth Workshop on the LLVM Compiler Infrastructu
 re in HPC
DESCRIPTION:Workshop\n\nLLVM-HPC2020 – Closing Remarks\n\n\n\n------------
 ---------\nLLVM-HPC2020 – Break\n\n\n\n---------------------\nLLVM-HPC2020
  – Panel\n\n\n\n---------------------\nLLVM-HPC2020 – Introduction: The Si
 xth Workshop on the LLVM Compiler Infrastructure in HPC\n\nFinkel, Perry-H
 olby, Brodman, Leidel\n\nLLVM, winner of the 2012 ACM Software System Awar
 d, has become an integral part of the software-development ecosystem for o
 ptimizing compilers, dynamic-language execution engines, source-code analy
 sis and transformation tools, debuggers and linkers and a whole host of pr
 ogramming-language and toolch...\n\n---------------------\nLLVM-HPC2020 – 
 Welcome\n\n\n\n---------------------\nAutotuning Search Space for Loop Tra
 nsformations\n\nKruse, Wu, Finkel\n\nOne of the challenges for optimizing 
 compilers is to predict whether applying an optimization will improve its 
 execution speed. Programmers may override the compiler's profitability heu
 ristic using optimization directives such as pragmas in the source code. M
 achine learning in the form of autotuning...\n\n---------------------\nDee
 p Learning-Based Approximate Graph-Coloring Algorithm for Register Allocat
 ion\n\nDas, Ahmad, Venkataramanan\n\nGraph-coloring is an NP-hard problem 
 which has a myriad of applications. Register allocation, which is a crucia
 l phase of a good optimizing compiler, relies on graph coloring. Hence, an
  efficient graph-coloring algorithm is of paramount importance. In this wo
 rk we try to ‘learn’ a good heuristic for...\n\n---------------------\nTow
 ard Automated Kernel Fusion for the Optimization of Scientific Application
 s\n\nLamzed-Short, Law, Mallinson, Mudalige, Jarvis\n\nWe introduce a nove
 l transformation pass written using LLVM that performs kernel fusion. We d
 emonstrate the correctness and performance of the pass on several example 
 programs inspired by scientific applications of interest. The method achie
 ves up to 4x speedup relative to unfused versions of the pr...\n\n--------
 -------------\nRobust Practical Binary Optimization at Run-Time Using LLVM
 \n\nEngelke, Schulz\n\nIn High Performance Computing (HPC), performance of
  applications are important factors, which is has led to a wide body of wo
 rk on optimizing compilers. However, compilers alone are naturally limited
  in their potential, as they cannot exploit run-time information to specia
 lize generated code. For th...\n\n---------------------\nExtending the LLV
 M/Clang Framework for OpenMP Metadirective Support\n\nMishra, Malik, Chapm
 an\n\nOpenMP 5.0 introduces many new directives to meet the demand of emer
 ging high performance computing systems. Among these new directives, the m
 etadirective and declare variant directives are important to control the e
 xecution behavior of a given application by compile-time adaptation based 
 on the Ope...\n\n---------------------\nStatic Neural Compiler Optimizatio
 n via Deep Reinforcement Learning\n\nMammadli, Jannesari, Wolf\n\nThe phas
 e-ordering problem of modern compilers has received a lot of attention fro
 m the research community over the years, yet remains largely unsolved. Var
 ious optimization sequences exposed to the user are manually designed by c
 ompiler developers. In designing such a sequence developers have to ch...\
 n\n---------------------\nLLVM-HPC2020 – Keynote\n\nAmini\n\n-------------
 --------\nLLVM-HPC2020 – Lunch Break\n\n\n\n---------------------\nReally 
 Embedding Domain-Specific Languages into C++\n\nFinkel, McCaskey, Popoola,
  Lyakh, Doerfert\n\nDomain-specific languages (DSLs) are both pervasive an
 d powerful, but remain difficult to integrate into large projects. As a re
 sult, while DSLs can bring distinct advantages in performance, reliability
 , and maintainability, their use often involves trading off other good sof
 tware-engineering practi...\n\n---------------------\nLLVM-HPC2020 – Break
 \n\n\n\n\nRegistration Category: Workshop Reg Pass
END:VEVENT
END:VCALENDAR

