2016
DOI: 10.1145/3093334.2989232
|View full text |Cite
|
Sign up to set email alerts
|

Cross-language compiler benchmarking: are we fast yet?

Abstract: Comparing the performance of programming languages is difficult because they differ in many aspects including preferred programming abstractions, available frameworks, and their runtime systems. Nonetheless, the question about relative performance comes up repeatedly in the research community, industry, and wider audience of enthusiasts.This paper presents 14 benchmarks and a novel methodology to assess the compiler effectiveness across language implementations. Using a set of common language abstractions, the… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1

Citation Types

0
3
0

Year Published

2016
2016
2023
2023

Publication Types

Select...
4
1

Relationship

3
2

Authors

Journals

citations
Cited by 6 publications
(3 citation statements)
references
References 18 publications
0
3
0
Order By: Relevance
“…We use benchmarks from the SciMark benchmark suite, 4 benchmarks from the Are We Fast Yet suite [18] and others. More speciically, our benchmarks consist of a micro benchmark that uses a bubble-sort algorithm and larger benchmarks including a Fast Fourier Transformation (FFT ), a dense LU matrix factorization (LU ), array permutations (Permute, Fannkuch), an n-queens problem solver (Queens), a Jacobi successive overrelaxation (SOR), and a sparse matrix multiplication (SparseMatMult).…”
Section: Discussionmentioning
confidence: 99%
“…We use benchmarks from the SciMark benchmark suite, 4 benchmarks from the Are We Fast Yet suite [18] and others. More speciically, our benchmarks consist of a micro benchmark that uses a bubble-sort algorithm and larger benchmarks including a Fast Fourier Transformation (FFT ), a dense LU matrix factorization (LU ), array permutations (Permute, Fannkuch), an n-queens problem solver (Queens), a Jacobi successive overrelaxation (SOR), and a sparse matrix multiplication (SparseMatMult).…”
Section: Discussionmentioning
confidence: 99%
“…For this work, we rely on the benchmark suite compiled for previous work [36]. It is a collection of 21 benchmarks in total, derived from the Are We Fast Yet benchmark suite [29] and other benchmarks from the gradual-typing literature.…”
Section: The Benchmarksmentioning
confidence: 99%
“…For that purpose, we take a set of twelve benchmarks that have been implemented for Java, JavaScript, and Ruby to enable a comparison of a set of core features of object-oriented languages [20]. This includes objects, closures, arrays, method dispatch, and basic operations.…”
Section: Baseline Performance Of Jruby+trufflementioning
confidence: 99%