Change search
ReferencesLink to record
Permanent link

Direct link
UTS: A Portable Benchmark for Erlang/OTP
KTH, School of Information and Communication Technology (ICT).
2010 (English)Independent thesis Advanced level (professional degree), 10 credits / 15 HE creditsStudent thesis
Abstract [en]

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.

Place, publisher, year, edition, pages
2010. , 30 p.
URN: urn:nbn:se:kth:diva-26323OAI: diva2:371752
Available from: 2010-11-22 Created: 2010-11-22 Last updated: 2010-11-22Bibliographically approved

Open Access in DiVA

fulltext(1175 kB)262 downloads
File information
File name FULLTEXT01.pdfFile size 1175 kBChecksum SHA-512
Type fulltextMimetype application/pdf

By organisation
School of Information and Communication Technology (ICT)

Search outside of DiVA

GoogleGoogle Scholar
Total: 262 downloads
The number of downloads is the sum of all downloads of full texts. It may include eg previous versions that are now no longer available

Total: 142 hits
ReferencesLink to record
Permanent link

Direct link