Fri 30 Oct 2015 13:30 - 13:52 at Grand Station 2 - 12. Performance Chair(s): Tiark Rompf

To maximize run-time performance, programmers often specialize their code by hand, replacing library collections and containers by custom objects in which data is restructured for efficient access. However, changing the data representation is a tedious and error-prone process that makes it hard to test, maintain and evolve the source code. We present an automated and composable mechanism that allows programmers to safely change the data representation in delimited scopes containing anything from expressions to entire class definitions. To achieve this, programmers define a transformation and our mechanism automatically and transparently applies it during compilation, eliminating the need to manually change the source code. Our technique leverages the type system in order to offer correctness guarantees on the transformation and its interaction with object-oriented language features, such as dynamic dispatch, inheritance and generics. We have embedded this technique in a Scala compiler plugin and used it in four very different transformations, ranging from improving the data layout and encoding, to retrofitting specialization and value class status, and all the way to collection deforestation. On our benchmarks, the technique obtained speedups between 1.8x and 24.5x.

Fri 30 Oct
Times are displayed in time zone: Eastern Time (US & Canada) change

13:30 - 15:00: 12. PerformanceOOPSLA at Grand Station 2
Chair(s): Tiark RompfPurdue & Oracle Labs
13:30 - 13:52
Automating Ad-hoc Data Representation TransformationsOOPSLA Artifact
Vlad UrecheEPFL, Switzerland, Aggelos BiboudisUniversity of Athens, Yannis SmaragdakisUniversity of Athens, Martin OderskyEPFL, Switzerland
Pre-print Media Attached
13:52 - 14:15
Tracing vs. Partial Evaluation: Comparing Meta-compilation Approaches for Self-Optimizing InterpretersOOPSLA Artifact
Stefan MarrINRIA, France, St├ęphane DucasseINRIA, France
Link to publication Media Attached
14:15 - 14:37
Effectively Mapping Linguistic Abstractions for Message-Passing Concurrency to Threads on the Java Virtual Machine
Ganesha UpadhyayaIowa State University, USA, Hridesh RajanIowa State University, USA
DOI Pre-print Media Attached
14:37 - 15:00
Partial Evaluation of Machine Code
Venkatesh SrinivasanUniversity of Wisconsin-Madison, USA, Thomas RepsUniversity of Wisconsin - Madison and Grammatech Inc.
DOI Media Attached