Write a Blog >>
Tue 19 Jan 2016 16:30 - 17:00 at Room Harbor View - Staging Chair(s): Jacques Carette

Powerful optimizations of object queries can lead to reduced asymptotic running times. However, such queries are often used in dynamic languages, and the required generality of the optimizations in handling a dynamic language can lead to significant runtime overhead as well as significantly increased code size. This paper studies combinations of optimizations for reducing this runtime overhead and code size. We describe two new optimizations — counting elimination and result set elimination, their effectiveness when combined with inlining and when using specialized data structures, and additional optimizations enabled by type analysis and alias analysis. The two new optimizations are enabled by the high-level nature of queries, even though they are difficult and not supported by general compiler optimizations. We have run a variety of benchmarks, including distributed algorithms and benchmarks from prior best systems, obtaining a speedup of up to 56% and code size reduction of up to 37%.

Tue 19 Jan

pepm-2016-main
16:00 - 17:40: PEPM - Staging at Room Harbor View
Chair(s): Jacques CaretteMcMaster University
pepm-2016-main16:00 - 16:30
Talk
Jeremy YallopUniversity of Cambridge, UK
DOI
pepm-2016-main16:30 - 17:00
Talk
Jon Brandvein, Yanhong A. LiuStony Brook University, USA
DOI
pepm-2016-main17:00 - 17:20
Talk
Kenichi AsaiOchanomizu University
DOI
pepm-2016-main17:20 - 17:40
Talk
Jun InoueNational Institute of Advanced Industrial Science and Technology, Japan, Oleg Kiselyov, Yukiyoshi Kameyama
DOI