Abstract

The selection of the computer language to adopt is usually driven by intuition and expertise, since it is very diffcult to compare languages taking into account all their characteristics. In this paper, we analyze the effciency of programming languages through Data Envelopment Analysis. We collected the input data fromThe Computer Language Benchmarks Game: we consider a large set of languages in terms of computational time, memory usage, and source code size. Various benchmark problems are tackled. We analyze the results first of all considering programming languages individually. Then, we evaluate families of them sharing some characteristics, for example, being compiled or interpreted.

Highlights

  • Which programming language is the best one? In general, the answer could be “no guess,”

  • We propose a way for understanding how to widen this answer, suggesting which programming languages should not be chosen after considering a set of different criteria as a whole

  • The first element to observe is the performance of the various programming languages individually

Read more

Summary

Introduction

Which programming language is the best one? In general, the answer could be “no guess,” . We propose a way for understanding how to widen this answer, suggesting which programming languages should not be chosen after considering a set of different criteria as a whole. They are allowed to choose the language to use and the problem to tackle in a set of about twenty benchmarks. If one of them performs worse in terms of at least one criterion and not better in the others, it is dominated and deleted from the program list This way, the survived codes are the ones that behave the best, or that, at least, are not clearly worse than any other. We consider computational time, memory usage, and source code size as input to the DMU/language while we consider the quantities of programs contributed for solving each workload as outputs.

Efficiency Evaluation via DEA
The Dataset
The Programming Languages Considered
The Benchmark Problems
Variability in the Input Data
Experimental Results
D Eiffel Erlang Forth Fortran Haskell Java JavaScript Lisp
Conclusions
Full Text
Paper version not known

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call

Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.