Paper Info
Title
Renaissance: benchmarking suite for parallel applications on the JVM
Abstract
Established benchmark suites for the Java Virtual Machine (JVM), such as DaCapo, ScalaBench, and SPECjvm2008, lack workloads that take advantage of the parallel programming abstractions and concurrency primitives offered by the JVM and the Java Class Library. However, such workloads are fundamental for understanding the way in which modern applications and data-processing frameworks use the JVM's concurrency features, and for validating new just-in-time (JIT) compiler optimizations that enable more efficient execution of such workloads. We present Renaissance, a new benchmark suite composed of modern, real-world, concurrent, and object-oriented workloads that exercise various concurrency primitives of the JVM. We show that the use of concurrency primitives in these workloads reveals optimization opportunities that were not visible with the existing workloads. We use Renaissance to compare performance of two state-of-the-art, production-quality JIT compilers (HotSpot C2 and Graal), and show that the performance differences are more significant than on existing suites such as DaCapo and SPECjvm2008. We also use Renaissance to expose four new compiler optimizations, and we analyze the behavior of several existing ones. We use Renaissance to compare performance of two state-of-the-art, production-quality JIT compilers (HotSpot C2 and Graal), and show that the performance differences are more significant than on existing suites such as DaCapo and SPECjvm2008. We also use Renaissance to expose four new compiler optimizations, and we analyze the behavior of several existing ones.
Year
DOI
Venue
2019
10.1145/3314221.3314637
Proceedings of the 40th ACM SIGPLAN Conference on Programming Language Design and Implementation
Keywords
Field
DocType
Big Data benchmarks, JIT compilation, JVM, benchmarks, concurrency, functional programming benchmarks, object-oriented programming benchmarks, parallelism
The Renaissance,Programming language,Suite,Computer science,Concurrency,Theoretical computer science,Compiler,Optimizing compiler,Just-in-time compilation,Java,Benchmarking
Conference
ISBN
Citations 
PageRank 
978-1-4503-6712-7
4
0.44
References 
Authors
0
12
Name
Order
Citations
PageRank
Aleksandar Prokopec116313.56
Andrea Rosà26312.04
David Leopoldseder361.83
Gilles Duboscq421110.10
Petr Tůma510813.38
Martin Studener650.79
Lubomír Bulej716520.20
Yudi Zheng813314.24
Alex Villazón932527.73
Doug Simon101707.58
Thomas Würthinger1139625.63
Walter Binder12107792.58