The Computer Language Benchmarks Game Explained
The Computer Language Benchmarks Game (formerly called The Great Computer Language Shootout) is a free software project for comparing how a given subset of simple algorithms can be implemented in various popular programming languages.
The project consists of:
- A set of very simple algorithmic problems
- Various implementations to the above problems in various programming languages
- A set of unit tests to verify that the submitted implementations solve the problem statement
- A framework for running and timing the implementations
- A website to facilitate the interactive comparison of the results
Supported languages
Due to resource constraints, only a small subset of common programming languages are supported, up to the discretion of the game's operator.[1]
Metrics
The following aspects of each given implementation are measured:[2]
It is common to see multiple solutions in the same programming language for the same problem. This highlights that within the constraints of a given language, a solution can be given which is either of high abstraction, is memory efficient, is fast, or can be parallelized better.
Benchmark programs
It was a design choice from the start to only include very simple toy problems, each providing a different kind of programming challenge.[3] This provides users of the Benchmark Game the opportunity to scrutinize the various implementations.[4]
History
The project was known as The Great Computer Language Shootout until 2007.[5]
A port for Windows was maintained separately between 2002 and 2003.[6]
The sources have been archived on GitLab.[7]
There are also older forks on GitHub.[8]
The project is continuously evolving. The list of supported programming languages is updated approximately once per year, following market trends. Users can also submit improved solutions to any of the problems or suggest testing methodology refinement.[9]
Caveats
The developers themselves highlight the fact that those doing research should exercise caution when using such microbenchmarks:
Impact
The benchmark results have uncovered various compiler issues. Sometimes a given compiler failed to process unusual, but otherwise grammatically valid constructs. At other times, runtime performance was shown to be below expectations, which prompted compiler developers to revise their optimization capabilities.
Various research articles have been based on the benchmarks, its results and its methodology.[10] [11] [12] [13] [14] [15] [16] [17] [18] [19] [20] [21] [22]
See also
Notes and References
- Web site: The Computer Language Benchmarks Game. benchmarksgame-team.pages.debian.net/benchmarksgame. 29 May 2018.
- Web site: How programs are measured – The Computer Language Benchmarks Game. benchmarksgame-team.pages.debian.net/benchmarksgame/. 29 May 2018.
- Web site: Why toy programs? – The Computer Language Benchmarks Game. benchmarksgame-team.pages.debian.net/benchmarksgame. 29 May 2018.
- Web site: n-body description (64-bit Ubuntu quad core) – Computer Language Benchmarks Game. benchmarksgame-team.pages.debian.net/benchmarksgame. 29 May 2018.
- Web site: Trust, and verify – Computer Language Benchmarks Game. benchmarksgame-team.pages.debian.net/benchmarksgame. 29 May 2018.
- Web site: The Great Win32 Computer Language Shootout. Dada.perl.it. 13 December 2017.
- Web site: archive-alioth-benchmarksgame. salsa.debian.org/benchmarksgame-team. 29 May 2018.
- Web site: benchmarksgame-cvs-mirror: A git mirror of the benchmarksgame cvs repository. Sebastian. Thiel. 24 October 2017. GitHub. 13 December 2017.
- Web site: Contribute your own program – Computer Language Benchmarks Game. benchmarksgame-team.pages.debian.net/benchmarksgame. 29 May 2018.
- Kevin Williams. Jason McCandless. David Gregg. Dynamic Interpretation for Dynamic Scripting Languages. 2009. 25 March 2017.
- Tobias Wrigstad. Francesco Zappa Nardelli. Sylvain Lebresne Johan. Ostlund Jan Vitek. Integrating Typed and Untyped Code in a Scripting Language. January 17–23, 2009. POPL’10. 25 March 2017. Madrid, Spain.
- Lerche. Carl. Write Fast Ruby: It's All About the Science. Golden Gate Ruby Conference. April 17–18, 2009. 25 March 2017. San Francisco, California.
- J. Shirako. D. M. Peixotto. V. Sarkar. W. N. Scherer III. Phaser Accumulators: a New Reduction Construct for Dynamic Parallelism. 2009. IEEE International Symposium on Parallel & Distributed Processing. 25 March 2017.
- Rajesh Karmani and Amin Shali and Gul Agha . Actor frameworks for the JVM platform: A Comparative Analysis . In Proceedings of the 7th International Conference on the Principles and Practice of Programming in Java . 2009 . 26 March 2017.
- Brunthaler Stefan. Inline Caching Meets Quickening. 2010. Object-Oriented Programming. European Conference on Object-Oriented Programming (ECOOP). 429–451. 10.1007/978-3-642-14107-2_21.
- Prodromos Gerakios. Nikolaos Papaspyrou. Konstantinos Sagonas. Race-free and Memory-safe Multithreading: Design and Implementation in Cyclone. January 23, 2010. Proceedings of the 5th ACM SIGPLAN workshop on Types in language design and implementation. 15–26. 25 March 2017. Madrid, Spain.
- Slava Pestov. Daniel Ehrenberg. Joe Groff. Factor: A Dynamic Stack-based Programming Language. October 18, 2010. DLS 2010. 25 March 2017. Reno/Tahoe, Nevada, USA.
- Andrei Homescu. Alex Suhan. HappyJIT: A Tracing JIT Compiler for PHP. October 24, 2011. DLS’11. 25 March 2017. Portland, Oregon, USA.
- Vincent St-Amour. Sam Tobin-Hochstadt. Matthias Felleisen. Optimization Coaching – Optimizers Learn to Communicate with Programmers. October 19–26, 2012. OOPSLA’12. 25 March 2017. Tucson, Arizona, USA.
- Wing Hang Li. David R. White. Jeremy Singer. JVM-Hosted Languages: They Talk the Talk, but do they Walk the Walk?. September 11–13, 2013. Proceedings of the 2013 International Conference on Principles and Practices of Programming on the Java Platform: Virtual Machines, Languages, and Tools. 101–112. 25 March 2017. Stuttgart, Germany.
- Aibek Sarimbekov. Andrej Podzimek. Lubomir Bulej. Yudi Zheng. Nathan Ricci. Walter Binder. Characteristics of Dynamic JVM Languages. October 28, 2013. VMIL ’13. 25 March 2017. Indianapolis, Indiana, USA.
- Bradford L. Chamberlain. Ben Albrecht. Lydia Duncan. Ben Harshbarger. Entering the Fray: Chapel's Computer Language Benchmark Game Entry. 2017. 25 March 2017.