Optimizing function placement for large-scale data-center applications

Ottoni, Guilherme; Maher, Bertrand A.

doi:10.1109/cgo.2017.7863743

Cited by 33 publications

(30 citation statements)

References 20 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…This is possible through the use of sample-based profiling, which enables high-quality profiles to be gathered with minimal operational complexity. This is the approach taken by tools such as Ispike [21], AutoFDO [6], and HFSort [25]. This same principle is used as the basis of the BOLT tool presented in this paper.…”

Section: Introductionmentioning

confidence: 99%

BOLT: A Practical Binary Optimizer for Data Centers and Beyond

Panchenko

Auler

Nell

et al. 2019

2019 IEEE/ACM International Symposium on Code Generation and Optimization (CGO)

Self Cite

View full text Add to dashboard Cite

Performance optimization for large-scale applications has recently become more important as computation continues to move towards data centers. Data-center applications are generally very large and complex, which makes code layout an important optimization to improve their performance. This has motivated recent investigation of practical techniques to improve code layout at both compile time and link time. Although post-link optimizers had some success in the past, no recent work has explored their benefits in the context of modern data-center applications.In this paper, we present BOLT, a post-link optimizer built on top of the LLVM framework. Utilizing samplebased profiling, BOLT boosts the performance of real-world applications even for highly optimized binaries built with both feedback-driven optimizations (FDO) and link-time optimizations (LTO). We demonstrate that post-link performance improvements are complementary to conventional compiler optimizations, even when the latter are done at a whole-program level and in the presence of profile information. We evaluated BOLT on both Facebook data-center workloads and open-source compilers. For data-center applications, BOLT achieves up to 8.0% performance speedups on top of profile-guided function reordering and LTO. For the GCC and Clang compilers, our evaluation shows that BOLT speeds up their binaries by up to 20.4% on top of FDO and LTO, and up to 52.1% if the binaries are built without FDO and LTO.

show abstract

Section: Introductionmentioning

confidence: 99%

BOLT: A Practical Binary Optimizer for Data Centers and Beyond

Panchenko

Auler

Nell

et al. 2019

2019 IEEE/ACM International Symposium on Code Generation and Optimization (CGO)

Self Cite

View full text Add to dashboard Cite

show abstract

“…In a recent study [Ottoni and Maher 2017], Ottoni and Maher measured the instruction cache performance of 4 server applications used internally at Facebook, including the execution engine that runs the Facebook web site [Ottoni and Maher 2017]. These commercial applications are not available for our study.…”

Section: Benchmarksmentioning

confidence: 99%

Codestitcher: inter-procedural basic block layout optimization

Lavaee

Criswell

Ding

2019

Proceedings of the 28th International Conference on Compiler Construction

View full text Add to dashboard Cite

Modern software executes a large amount of code. Previous techniques of code layout optimization were developed one or two decades ago and have become inadequate to cope with the scale and complexity of new types of applications such as compilers, browsers, interpreters, language VMs and shared libraries.This paper presents Codestitcher, an inter-procedural basic block code layout optimizer which reorders basic blocks in an executable to benefit from better cache and TLB performance. Codestitcher provides a hierarchical framework which can be used to improve locality in various layers of the memory hierarchy. Our evaluation shows that Codestitcher improves the performance of the original program by 3% to 25% (on average, by 10%) on 5 widely used applications with large code sizes: MySQL, Clang, Firefox, Apache, and Python. It gives an additional improvement of 4% over LLVM's PGO and 3% over PGO combined with the best function reordering technique.

show abstract

“…Since code locality and layout are important for a server JIT running vast amounts of code, we leverage the HHVM JIT's whole-program reoptimization framework to implement function sorting. Ottoni and Maher [32] recently demonstrated that function sorting is very impactful for large-scale data-center applications. By placing functions that commonly call each other close by, function sorting can significantly improve the performance of the instruction TLB and the instruction cache.…”

Section: Function Sortingmentioning

confidence: 99%

“…By placing functions that commonly call each other close by, function sorting can significantly improve the performance of the instruction TLB and the instruction cache. In [32], function sorting was applied statically at link time. HHVM was one of the workloads evaluated in that work, and this optimization improved its performance by 8%.…”

Section: Function Sortingmentioning

confidence: 99%

See 1 more Smart Citation

HHVM JIT: a profile-guided, region-based compiler for PHP and Hack

OttoniGuilherme

2018

SIGPLAN Not.

Self Cite

View full text Add to dashboard Cite

Dynamic languages such as PHP, JavaScript, Python, and Ruby have been gaining popularity over the last two decades. A very popular domain for these languages is web development, including server-side development of large-scale websites. As a result, improving the performance of these languages has become more important. Efficiently compiling programs in these languages is challenging, and many popular dynamic languages still lack efficient productionquality implementations. This paper describes the design of the second generation of the HHVM JIT and how it addresses the challenges to efficiently execute PHP and Hack programs. This new design uses profiling to build an aggressive region-based JIT compiler. We discuss the benefits of this approach compared to the more popular method-based and trace-based approaches to compile dynamic languages. Our evaluation running a very large PHP-based code base, the Facebook website, demonstrates the effectiveness of the new JIT design.

show abstract

Optimizing function placement for large-scale data-center applications

Cited by 33 publications

References 20 publications

BOLT: A Practical Binary Optimizer for Data Centers and Beyond

BOLT: A Practical Binary Optimizer for Data Centers and Beyond

Codestitcher: inter-procedural basic block layout optimization

HHVM JIT: a profile-guided, region-based compiler for PHP and Hack

Contact Info

Product

Resources

About