UTS: A Portable Benchmark for Erlang/OTP

Abstract: In this paper the benchmark Unbalanced Tree Search (UTS) is ported and evaluated to the functional programming language Erlang. The purpose is to provide a portable benchmark that scales as the number of cores do in a system. Since Erlang is language built around concurrency language the speedup should prove to be interesting comparing to its competitors as the number of cores rise. This paper is written to describe how the algorithm works as well as what it has performed on a few different systems at SICS and presents the conclusions that can be drawn from them. Some questions remain unanswered however such as how well the benchmark performed on the Tilera64 because of some technical difficulties during the project. Also the results proved quite odd since there are possible bottlenecks in the performance making the speedup per added processor core somewhat limited. As a consequence of the strange behavior of the software some of the conclusions drawn from this thesis are mostly speculations.