Efficient online optimization by utilizing offline analysis and the safeTSA representation

Authors:
Jeffery von Ronne;Andreas Hartmann;Wolfram Amme;Michael Franz
Affiliations:
University of Calitbrnia, Irvine;Friedrich-Schiller-Universität Jena, Germany;Friedrich-Schiller-Universität Jena, Germany;University of California, Irvine
Venue:
PPPJ '02/IRE '02 Proceedings of the inaugural conference on the Principles and Practice of programming, 2002 and Proceedings of the second workshop on Intermediate representation engineering for virtual machines, 2002
Year:
2002

Citing 5
Cited 0

Proof-carrying code

Proceedings of the 24th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
From system F to typed assembly language

ACM Transactions on Programming Languages and Systems (TOPLAS)
Linear scan register allocation

ACM Transactions on Programming Languages and Systems (TOPLAS)
SafeTSA: a type safe and referentially secure mobile-code representation based on static single assignment form

Proceedings of the ACM SIGPLAN 2001 conference on Programming language design and implementation
Using annotations to reduce dynamic optimization time

Proceedings of the ACM SIGPLAN 2001 conference on Programming language design and implementation

Quantified Score

Hi-index	0.00

Visualization

Abstract

Conventional mobile-code representations, e.g. Java bytecode, provide machine-independence and type-safety, but do so at the expense of performance. This performance hit can be taken in the form of decreased throughput or in increased latency. SafeTSA was designed to reduce this performance hit, especially when producing high-quality optimized machine code. It does this by utilizing SSA form and thus shifting dataflow analysis effort from the online JIT compiler to the offline producer of the safeTSA program.This paper describes the extension of safeTSA to support a greater shifting of optimiza- tion effort away from the online JIT compiler, increase the performance, without sacrificing type-safety or machine-independence. Specifically, we describe mechanisms to reduce.the cost of online register allocation through offline analysis, and to use offline escape analysis so the online JIT compiler can produce less heap allocations.