Institute of Computer Languages
Compilers and Languages Group

Talks 2011 - Florian Brandner

Der Arbeitsbereich für Programmiersprachen und Übersetzer am Institut für Computersprachen lädt zu folgendem Vortrag ein:

Dr. Florian Brandner

INRIA / Ecole Normale Supérieure de Lyon (ENS Lyon), Frankreich


"Optimal" Spilling using Integer Linear Programming

Datum: Freitag, 27. Mai 2011
Zeit: 15:00 c.t.
Ort: TU Wien, Bibliothek E185.1, Argentinierstraße 8, 4. Stock (Mitte)


In recent years register allocation regained lots of attention. A major insight, triggering several exciting developments, was the fact that Static Single Assignment form (SSA) provides many favorable properties that promise to simplify register allocation by splitting the problem into three separate subphases: spilling, assignment, and coalescing.

This talk will focus on the spilling problem, i.e., the problem of evicting variables to temporary locations in memory in order to limit the number of required registers. The main problem here is the placement of load and store instructions such that execution time and code size are minimized. We propose a new exact spilling model based on Integer Linear Programming (ILP) in order to gain further insights of the problem for the development of new spilling heuristics. Our experiments show that existing heuristics and even previous "optimal" formulations still leave headroom for improvements.

Kurzbiographie von Florian Brandner

Florian Brandner is currently a INRIA post-doc researcher at the Ecole Normale Supérieure de Lyon (France). He graduated from the Vienna University of Technology (Austria) in 2004 and received his PhD from the same university in 2009. His research is focused on the interaction between architecture design and compiler development. During his PhD he developed a processor modeling and exploration system, which allows to automatically generate software development tools such as a compiler and instruction set simulators from concise processor specifications. His current research focus is on exploiting Static Single Assignment form (SSA) in code generation algorithms such as register allocation, spilling, and instruction selection.

Sie möchten auf diesen Vortrag durch Aushang hinweisen? Eine druckfertige Einladung im pdf-Format dafür finden Sie hier.

   About Us
      Talks 2017
      Talks 2016
      Talks 2015
      Talks 2014
      Talks 2013
      Talks 2012
      Talks 2011
      Talks 2010
      Talks 2009
      Talks 2008
      Talks 2007
      Talks 2006
      Talks 2005
      Talks 2004
Fast Access:
Previous Talk
Next Talk
Faculty of Informatics
Vienna University of Technology
top | HTML 4.01 | last update: 2017-02-13 (Webmaster)