Grant: Collaborative Research and Development Grants
University of Toronto
$136,000.00
Efficient Memory Footprint Reduction for Java Performance_x000d_ _x000d_
EF 2020-21
Résumé
Our prior work on data compression significantly advanced this subfield of computer architecture, and also showed the significant potential of applying optimized data compression across the whole systems stack (from caches to memory). As it commonly happens, our results also highlighted some completely new problems and opportunities. First of all, to be efficient, data compression needs to be very fast, especially decompression part as it is frequently on the critical execution path. Second, compressibility varies a lot for different applications, but still is generic enough to be interesting and is observed in 60% to 75% of different applications for both CPU and GPGPU applications. Third, to be efficient in memory hierarchy, it is better to use domain-specific or pattern-specific compression algorithms that might sacrifice some compression ratio for acceptable overhead of compression/decompression.
In this work, we aim to apply our experience on data compression to a new area where the current application of data compression was very limited so far - just-in-time (JIT) compilation. Based on our initial discussion, there is a strong indication that memory footprint is an important concern for Java performance. In our project, we aim to address this problem using data compression. We envision several major directions in our research. First, we would like to collect a set of representative Java applications and generate their memory dumps that would include both the JIT metadata, compiled objects, and the heap. Second, we will perform an extensive analysis of existing
compression algorithms that might be useful for each for the major contributors to the memory consumption. Third, we will look for potential domain-specific encodings that will improve compressibility of Java applications even further. Fourth, we will investigate a potential of running execution directly on compressed data when possible.
Programme
Collaborative Research and Development Grants
Bénéficiaire
Emplacement
Ontario, Canada
Type de bénéficiaire
Academia
Type
Grant
Source
NSERC's Awards Data
Tel que publié
Application id
531328-2018
Name nom
Pekhimenko, Gennady
Department département
Computer and Mathematical Sciences (Scarborough)
Organization id
31
Institution établissement
University of Toronto
Province en
Ontario
Province fr
Ontario
Country en
CANADA
Country fr
CANADA
Fiscal year exercice financier
2020
Competition year année de concours
2018
Award amount
136000
Program id
CRDPJ
Program name en
Collaborative Research and Development Grants
Program name fr
Subventions de recherche et développement coopérative
Group en
Research partnerships programs
Group fr
Programmes de partenariat
Committee code
96
Committee name en
RPP Internal Decision Cttee
Committee name fr
Cté de décision interne - PPR
Area of application code
801
Area of application group en
Information and communication services
Area of application group fr
Services d'information et de télécommunications
Area of application en
Computer software
Area of application fr
Logiciel
Research subject code
2702
Research subject group en
Information technology
Research subject group fr
Technologie de l'information
Research subject en
Computer systems organization
Research subject fr
Organisation des systèmes informatiques
Installment
inst:2 - 4
Partie
3
Nb partie
4
Application title
Efficient Memory Footprint Reduction for Java Performance_x000d_
_x000d_
Keyword
NSERC
Application summary
Our prior work on data compression significantly advanced this subfield of computer architecture, and also showed the significant potential of applying optimized data compression across the whole systems stack (from caches to memory). As it commonly happens, our results also highlighted some completely new problems and opportunities. First of all, to be efficient, data compression needs to be very fast, especially decompression part as it is frequently on the critical execution path. Second, compressibility varies a lot for different applications, but still is generic enough to be interesting and is observed in 60% to 75% of different applications for both CPU and GPGPU applications. Third, to be efficient in memory hierarchy, it is better to use domain-specific or pattern-specific compression algorithms that might sacrifice some compression ratio for acceptable overhead of compression/decompression.
In this work, we aim to apply our experience on data compression to a new area where the current application of data compression was very limited so far - just-in-time (JIT) compilation. Based on our initial discussion, there is a strong indication that memory footprint is an important concern for Java performance. In our project, we aim to address this problem using data compression. We envision several major directions in our research. First, we would like to collect a set of representative Java applications and generate their memory dumps that would include both the JIT metadata, compiled objects, and the heap. Second, we will perform an extensive analysis of existing
compression algorithms that might be useful for each for the major contributors to the memory consumption. Third, we will look for potential domain-specific encodings that will improve compressibility of Java applications even further. Fourth, we will investigate a potential of running execution directly on compressed data when possible.