Efficient String Representation in Erlang/OTP

Examensarbete för masterexamen

Please use this identifier to cite or link to this item: https://hdl.handle.net/20.500.12380/245711
Download file(s):
File Description SizeFormat 
245711.pdfFulltext3.32 MBAdobe PDFView/Open
Type: Examensarbete för masterexamen
Master Thesis
Title: Efficient String Representation in Erlang/OTP
Authors: Lamov, Andrej
Abstract: A string in Erlang is implemented as a linked list of integers. This leads to a large memory overhead on modern hardware (64 bits) causing each character to take 16 bytes, especially compared to the natural representation where each character takes 1 byte. In this report we show and compare alternative string representations to achieve less overhead. Furthermore, we explore the memory management in Erlang’s abstract machine (BEAM), and show how to measure and reason about its memory usage. As a case-study we use Ericsson’s SGSN-MME, a massively concurrent Erlang system running hundreds of thousands of Erlang processes. We have chosen a part of the system where the existing code has performance issues involving hostname processing and representation. In particular we analyse the behaviour of an existing algorithm used for selecting gateway hostnames by performing suffix matching. We give examples of improvements of this, both algorithmic and storage-wise.
Keywords: Data- och informationsvetenskap;Computer and Information Science
Issue Date: 2016
Publisher: Chalmers tekniska högskola / Institutionen för data- och informationsteknik (Chalmers)
Chalmers University of Technology / Department of Computer Science and Engineering (Chalmers)
URI: https://hdl.handle.net/20.500.12380/245711
Collection:Examensarbeten för masterexamen // Master Theses

Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.