Skip to main content
Kent Academic Repository

Scaling Reliably: Improving the Scalability of the Erlang Distributed Actor Platform

Thompson, Simon, Li, Huiqing, Baker, Robert, Adams, Stephen, Trinder, Phil, Chechina, Natalia, Papaspyrou, Nikolaos, Sagonas, Konstantinos, Aronis, Stavros, Bihari, Eva, and others. (2017) Scaling Reliably: Improving the Scalability of the Erlang Distributed Actor Platform. ACM Transactions on Programming Languages and Systems, 39 (4). Article Number 17. ISSN 0164-0925. E-ISSN 1558-4593. (doi:10.1145/3107937) (KAR id:63197)


Distributed actor languages are an effective means of constructing scalable reliable systems, and the Erlang programming language has a well-established and influential model. While the Erlang model conceptually provides reliable scalability, it has some inherent scalability limits and these force developers to depart from the model at scale. This article establishes the scalability limits of Erlang systems and reports the work of the EU RELEASE project to improve the scalability and understandability of the Erlang reliable distributed actor model.

We systematically study the scalability limits of Erlang and then address the issues at the virtual machine, language, and tool levels. More specifically: (1) We have evolved the Erlang virtual machine so that it can work effectively in large-scale single-host multicore and NUMA architectures. We have made important changes and architectural improvements to the widely used Erlang/OTP release. (2) We have designed and implemented Scalable Distributed (SD) Erlang libraries to address language-level scalability issues and provided and validated a set of semantics for the new language constructs. (3) To make large Erlang systems easier to deploy, monitor, and debug, we have developed and made open source releases of five complementary tools, some specific to SD Erlang.

Throughout the article we use two case studies to investigate the capabilities of our new technologies and tools: a distributed hash table based Orbit calculation and Ant Colony Optimisation (ACO). Chaos Monkey experiments show that two versions of ACO survive random process failure and hence that SD Erlang preserves the Erlang reliability model. While we report measurements on a range of NUMA and cluster architectures, the key scalability experiments are conducted on the Athos cluster with 256 hosts (6,144 cores). Even for programs with no global recovery data to maintain, SD Erlang partitions the network to reduce network traffic and hence improves performance of the Orbit and ACO benchmarks above 80 hosts. ACO measurements show that maintaining global recovery data dramatically limits scalability; however, scalability is recovered by partitioning the recovery data. We exceed the established scalability limits of distributed Erlang, and do not reach the limits of SD Erlang for these benchmarks at this scale (256 hosts, 6,144 cores).

Item Type: Article
DOI/Identification number: 10.1145/3107937
Uncontrolled keywords: Distributed programming languages, Functional languages, Runtime environments, Concurrent programming structures, Erlang, scalability, reliability
Subjects: Q Science > QA Mathematics (inc Computing science) > QA 76 Software, computer programming, > QA76.76 Computer software
Divisions: Divisions > Division of Computing, Engineering and Mathematical Sciences > School of Computing
Funders: [37325] UNSPECIFIED
Depositing User: S. Thompson
Date Deposited: 01 Sep 2017 18:56 UTC
Last Modified: 04 Mar 2024 16:05 UTC
Resource URI: (The current URI for this page, for reference purposes)

University of Kent Author Information

Thompson, Simon.

Creator's ORCID:
CReDIT Contributor Roles:

Li, Huiqing.

Creator's ORCID:
CReDIT Contributor Roles:

Adams, Stephen.

Creator's ORCID:
CReDIT Contributor Roles:
  • Depositors only (login required):

Total unique views for this document in KAR since July 2020. For more details click on the image.