[www] r263907 - [EuroLLVM 2016] Add placeholders for the slides and videos.

Sun Mar 20 09:03:14 PDT 2016

Author: aadg
Date: Sun Mar 20 11:03:14 2016
New Revision: 263907

URL: http://llvm.org/viewvc/llvm-project?rev=263907&view=rev
Log:
[EuroLLVM 2016] Add placeholders for the slides and videos.

Modified:
    www/trunk/devmtg/2016-03/index.html

Modified: www/trunk/devmtg/2016-03/index.html
URL: http://llvm.org/viewvc/llvm-project/www/trunk/devmtg/2016-03/index.html?rev=263907&r1=263906&r2=263907&view=diff
==============================================================================

--- www/trunk/devmtg/2016-03/index.html (original)
+++ www/trunk/devmtg/2016-03/index.html Sun Mar 20 11:03:14 2016
@@ -182,6 +182,8 @@ The schedule may be found here: <a href=
 <b><a id="presentation1">Clang, libc++ and the C++ standard</a></b><br>
 <i>Marshall Clow - Qualcomm</i><br>
 <i>Richard Smith - Google</i><br>
+<b>Slides:</b> coming soon<br>
+<b>Video:</b> coming soon<br>
 The C++ standard is evolving at a fairly rapid pace. After almost 15 years of
 little change (1998-2010), we've had major changes in 2011, 2014, and soon
 (probably) 2017. There are many parallel efforts to add new functionality to
@@ -199,6 +201,8 @@ LLVM.
 <i>Michel Popov - University of Versailles</i><br>
 <i>Eric Petit - University of Versailles</i><br>
 <i>William Jalby - University of Versailles</i><br>
+<b>Slides:</b> coming soon<br>
+<b>Video:</b> coming soon<br>
 Codelet Extractor and REplayer (CERE) is an LLVM-based framework that finds and
 extracts hotspots from an application as isolated fragments of code. Codelets
 can be modified, compiled, run, and measured independently from the original
@@ -217,6 +221,8 @@ Finally CERE also provides a python inte
 <p>
 <b><a id="presentation3">New LLD linker for ELF</a></b><br>
 <i>Rui Ueyama - Google</i><br>
+<b>Slides:</b> coming soon<br>
+<b>Video:</b> coming soon<br>
 Since last year, we have been working to rewrite the ELF support in LLD, the
 LLVM linker, to create a high-performance linker that works as a drop-in
 replacement for the GNU linker. It is now able to bootstrap LLVM, Clang, and
@@ -234,6 +240,8 @@ design. This talk will present the desig
 <i>Zia Ansari - Intel</i><br>
 <i>Andrey Turetskiy - Intel</i><br>
 <i>Anton Nadolsky - Intel</i><br>
+<b>Slides:</b> coming soon<br>
+<b>Video:</b> coming soon<br>
 Minimizing the size of compiler generated code often takes a back seat to other
 optimization objectives such as maximizing the runtime performance. For some
 applications, however, code size is of paramount importance, and this is an
@@ -254,6 +262,8 @@ improvements with an eye toward pushing
 <p>
 <b><a id="presentation5">Towards ameliorating measurement bias in evaluating performance of generated code</a></b><br>
 <i>Kristof Beyls - ARM</i><br>
+<b>Slides:</b> coming soon<br>
+<b>Video:</b> coming soon<br>
 To make sure LLVM continues to optimize code well, we use both post-commit
 performance tracking and pre-commit evaluation of new optimization patches. As
 compiler writers, we wish that the performance of code generated could be
@@ -286,6 +296,8 @@ try and avoid measurement bias.
 <p>
 <b><a id="presentation6">A journey of OpenCL 2.0 development in Clang</a></b><br>
 <i>Anastasia Stulova - ARM</i><br>
+<b>Slides:</b> coming soon<br>
+<b>Video:</b> coming soon<br>
 In this talk we would like to highlight some of the recent collaborative work
 among several institutions (namely ARM, Intel, Tampere University of
 Technology, and others) for supporting OpenCL 2.0 compilation in Clang. This
@@ -310,6 +322,8 @@ of what they think could be useful for t
 <p>
 <b><a id="presentation7">Building a binary optimizer with LLVM</a></b><br>
 <i>Maksim Panchenko - Facebook</i><br>
+<b>Slides:</b> coming soon<br>
+<b>Video:</b> coming soon<br>
 Large-scale applications in data centers are built with the highest level of
 compiler optimizations and typically use a carefully tuned set of compiler
 options as every single percent of performance could result in vast savings of
@@ -345,6 +359,8 @@ optimizer.
 <i>Ding Ye - University of New South Wales</i><br>
 <i>Hua Yan - University of New South Wales</i><br>
 <i>Jingling Xue - University of New South Wales</i><br>
+<b>Slides:</b> coming soon<br>
+<b>Video:</b> coming soon<br>
 This talk presents SVF, a research tool that enables scalable and precise
 interprocedural Static Value-Flow analysis for sequential and multithreaded C
 programs by leveraging recent advances in sparse analysis. SVF, which is fully
@@ -378,6 +394,8 @@ Note: this presentation will be shared w
 <i>Chris Diamand - University of Cambridge</i><br>
 <i>Stephen Kell - Computer Laboratory, University of Cambridge</i><br>
 <i>David Chisnall - Computer Laboratory, University of Cambridge</i><br>
+<b>Slides:</b> coming soon<br>
+<b>Video:</b> coming soon<br>
 Existing sanitizers ASan and MSan add run-time checking for memory
 errors, both spatial and temporal. However, currently there is no
 analogous way to check for type errors. This talk describes a system for
@@ -409,6 +427,8 @@ pointing to?".
 <p>
 <b><a id="presentation10">Molly: Parallelizing for Distributed Memory using LLVM</a></b><br>
 <i>Michael Kruse - INRIA/ENS</i><br>
+<b>Slides:</b> coming soon<br>
+<b>Video:</b> coming soon<br>
 Motivated by modern day physics which in addition to experiments also tries to
 verify and deduce laws of nature by simulating the state-of-the-art physical
 models using large computers, we explore means of accelerating such simulations
@@ -443,6 +463,8 @@ optimizations that make the manually opt
 <p>
 <b><a id="presentation11">How Polyhedral Modeling enables compilation to Heterogeneous Hardware</a></b><br>
 <i>Tobias Grosser - ETH</i><br>
+<b>Slides:</b> coming soon<br>
+<b>Video:</b> coming soon<br>
 Polly, as a polyhedral loop optimizer for LLVM, is not only a sophisticated
 tool for data locality optimizations, but also has precise information about
 loop behavior that can be used to automatically generate accelerator code.
@@ -463,6 +485,8 @@ of automatic PTX/CUDA code generation us
 <b><a id="presentation12">Bringing RenderScript to LLDB</a></b><br>
 <i>Luke Drummond - Codeplay</i><br>
 <i>Ewan Crawford - Codeplay</i><br>
+<b>Slides:</b> coming soon<br>
+<b>Video:</b> coming soon<br>
 RenderScript is Android's compute framework for parallel computation via
 heterogeneous acceleration. It supports multiple target architectures and uses
 a two-stage compilation process, with both off-line and on-line stages, using
@@ -487,6 +511,8 @@ mechanism, remote debugging, and generat
 <i>Victor Lomuller - Codeplay</i><br>
 <i>Ralph Potter - Codeplay</i><br>
 <i>Uwe Dolinsky - Codeplay</i><br>
+<b>Slides:</b> coming soon<br>
+<b>Video:</b> coming soon<br>
 Heterogeneous systems have been massively adopted across a wide range of
 devices. Multiple initiatives, such as OpenCL and HSA, have appeared to
 efficiently program these types of devices.
@@ -509,6 +535,8 @@ focus on Codeplay's usage of Clang to ma
 <p>
 <b><a id="presentation14">A closer look at ARM code size</a></b><br>
 <i>Tilmann Scheller - Samsung Electronics</i><br>
+<b>Slides:</b> coming soon<br>
+<b>Video:</b> coming soon<br>
 The ARM LLVM backend has been around for many years and generates high quality
 code which executes very efficiently. However, LLVM is also increasingly used
 for resource-constrained embedded systems where code size is more of an issue.
@@ -526,6 +554,8 @@ resource-constrained microcontroller.
 <b><a id="presentation15">Scalarization across threads</a></b><br>
 <i>Alexander Timofeev - Luxoft</i><br>
 <i>Boris Ivanovsky - Luxoft</i><br>
+<b>Slides:</b> coming soon<br>
+<b>Video:</b> coming soon<br>
 Some of the modern highly parallel architectures include separate vector
 arithmetic units to achieve better performance on parallel algorithms. On the
 other hand, real world applications never operate on vector data only. In most
@@ -551,6 +581,8 @@ increase in a few benchmarks, one of the
 <b><a id="tuto1">Adding your Architecture to LLDB</a></b><br>
 <i>Deepak Panickal - Codeplay</i><br>
 <i>Andrzej Warzynski - Codeplay</i><br>
+<b>Slides:</b> coming soon<br>
+<b>Video:</b> coming soon<br>
 This tutorial explains how to get started with adding a new architecture to
 LLDB. It walks through all the major steps required and how LLDB's various
 plugins work together in making this a maintainable and easily approachable
@@ -570,6 +602,8 @@ well as solutions to common issues, will
 <i>Tobias Grosser - ETH</i><br>
 <i>Johannes Doerfert - Saarland University</i><br>
 <i>Zino Benaissa - Quic Inc.</i><br>
+<b>Slides:</b> coming soon<br>
+<b>Video:</b> coming soon<br>
 The Polly Loop Optimizer is a framework for the analysis and optimization of
 (possibly imperfectly) nested loops. It provides various transformations such
 as loop fusion, loop distribution, loop tiling as well as outer loop
@@ -592,6 +626,8 @@ their own loop transformations.
 <b><a id="tuto3">Building, Testing and Debugging a Simple out-of-tree LLVM Pass</a></b><br>
 <i>Serge Guelton - Quarkslab</i><br>
 <i>Adrien Guinet - Quarkslab</i><br>
+<b>Slides:</b> coming soon<br>
+<b>Video:</b> coming soon<br>
 This tutorial aims at providing solid ground to develop out-of-tree LLVM passes.
 It presents all the required building blocks, starting from scratch: cmake
 integration, llvm pass management, opt / clang integration. It presents the core
@@ -609,6 +645,8 @@ audience, especially when considering we
 <p>
 <b><a id="lightning1">Random Testing of the LLVM Code Generator</a></b><br>
 <i>Bevin Hansson - SICS Swedish ICT</i><br>
+<b>Slides:</b> coming soon<br>
+<b>Video:</b> coming soon<br>
 LLVM is a large, complex piece of software with many interlocking components.
 Testing a system of this magnitude is an arduous task. Random testing is an
 increasingly popular technique used to test complex systems. A successful
@@ -630,6 +668,8 @@ generation.
 <i>Ignacio Laguna - Lawrence Livermore National Laboratory</i><br>
 <i>Martin Schulz - Lawrence Livermore National Laboratory</i><br>
 <i>Gregory L. Lee - Lawrence Livermore National Laboratory</i><br>
+<b>Slides:</b> coming soon<br>
+<b>Video:</b> coming soon<br>
 Although the importance OpenMP as a parallel programming model and its adoption
 in Clang/LLVM is increasing (OpenMP 3.1 is now fully supported by Clang/LLVM
 3.7), existing data-race checkers for OpenMP have high overheads and generate
@@ -650,6 +690,8 @@ Note: this lightning has an associated <
 <p>
 <b><a id="lightning3">Hierarchical Graph Coloring Register Allocation in LLVM</a></b><br>
 <i>Aaron Smith - Microsoft Research</i><br>
+<b>Slides:</b> coming soon<br>
+<b>Video:</b> coming soon<br>
 This talk will present a new register allocator for LLVM based on a
 hierarchical graph coloring approach. In this allocator a program's control
 structure is represented as a tree of tiles and a two phase algorithm colors
@@ -661,6 +703,8 @@ greedy allocator.
 <p>
 <b><a id="lightning4">Retargeting LLVM to an Explicit Data Graph Execution (EDGE) Architecture</a></b><br>
 <i>Aaron Smith - Microsoft Research</i><br>
+<b>Slides:</b> coming soon<br>
+<b>Video:</b> coming soon<br>
 This talk will describe recent work to retarget LLVM to an Explicit Data Graph
 Execution (EDGE) architecture. EDGE architectures utilize a hybrid von
 Neumann/dataflow execution model which provides out of order execution with
@@ -675,6 +719,8 @@ production quality Visual Studio based E
 <i>Gabriel Hjort Blindell - Royal Institute of Technology (KTH)</i><br>
 <i>Mats Carlsson - SICS</i><br>
 <i>Christian Schulte - SICS & Royal Institute of Technology (KTH)</i><br>
+<b>Slides:</b> coming soon<br>
+<b>Video:</b> coming soon<br>
 This talk presents Unison - a simple, flexible and potentially optimal tool
 that solves register allocation and instruction scheduling simultaneously.
 Experiments using MediaBench and Hexagon show that Unison can speed up the code
@@ -693,6 +739,8 @@ optimization levels.
 <i>Vedran Miletić - Heidelberg Institute for Theoretical Studies</i><br>
 <i>Szilárd Páll - Royal Institute of Technology (KTH)</i><br>
 <i>Frauke Gräter - Heidelberg Institute for Theoretical Studies</i><br>
+<b>Slides:</b> coming soon<br>
+<b>Video:</b> coming soon<br>
 Molecular dynamics is a simulation method for studying movements of atoms and
 molecules, usually applied in the study of biomolecules and materials. GROMACS
 open source molecular dynamics simulator supports GPU acceleration using both
@@ -718,6 +766,8 @@ talk will present the challenges we enco
 <b><a id="lightning7">CSiBE in the LLVM ecosystem</a></b><br>
 <i>Gabor Ballabas - Department of Software Engineering, University of Szeged</i><br>
 <i>Gabor Loki - Department of Software Engineering, University of Szeged</i><br>
+<b>Slides:</b> coming soon<br>
+<b>Video:</b> coming soon<br>
 More than a decade ago, we have started to set up a code size benchmarking
 environment for compilers - called CSiBE - which became the official code size
 benchmark of GNU GCC. Since then, lots of open source and industrial compilers


