Efficient String Representation in Erlang/OTP

dc.contributor.authorLamov, Andrej
dc.contributor.departmentChalmers tekniska högskola / Institutionen för data- och informationsteknik (Chalmers)sv
dc.contributor.departmentChalmers University of Technology / Department of Computer Science and Engineering (Chalmers)en
dc.date.accessioned2019-07-03T14:24:01Z
dc.date.available2019-07-03T14:24:01Z
dc.date.issued2016
dc.description.abstractA 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.
dc.identifier.urihttps://hdl.handle.net/20.500.12380/245711
dc.language.isoeng
dc.setspec.uppsokTechnology
dc.subjectData- och informationsvetenskap
dc.subjectComputer and Information Science
dc.titleEfficient String Representation in Erlang/OTP
dc.type.degreeExamensarbete för masterexamensv
dc.type.degreeMaster Thesisen
dc.type.uppsokH
local.programmeComputer science – algorithms, languages and logic (MPALG), MSc
Ladda ner
Original bundle
Visar 1 - 1 av 1
Hämtar...
Bild (thumbnail)
Namn:
245711.pdf
Storlek:
3.24 MB
Format:
Adobe Portable Document Format
Beskrivning:
Fulltext