2016
DOI: 10.1016/j.jpdc.2016.01.002
|View full text |Cite
|
Sign up to set email alerts
|

Improving the network scalability of Erlang

Abstract: As the number of cores grows in commodity architectures so does the likelihood of failures. A distributed actor model potentially facilitates the development of reliable and scalable software on these architectures. Key components include lightweight processes which 'share nothing' and hence can fail independently. Erlang is not only increasingly widely used, but the underlying actor model has been a beacon for programming language design, influencing for example Scala, Clojure and Cloud Haskell.While the Erla… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

1
23
0
1

Year Published

2016
2016
2021
2021

Publication Types

Select...
3
3

Relationship

5
1

Authors

Journals

citations
Cited by 11 publications
(25 citation statements)
references
References 15 publications
(12 reference statements)
1
23
0
1
Order By: Relevance
“…It would be intriguing to thoroughly explore the determinism properties of transparent fault tolerance in languages like HdpH-RS. The implementation could be improved in various ways: by integrating HdpH-RS with the the topology aware HdpH implementation (Section 6.4); by extending the communication layer to allow nodes to join a computation; and by avoiding the scalability limitation imposed by instantiating a fully connected graph of nodes during execution as in SD Erlang (Chechina et al, 2014). The current implementation re-evaluates any tasks created by a lost task, and this may be very expensive e.g.…”
Section: Resultsmentioning
confidence: 99%
“…It would be intriguing to thoroughly explore the determinism properties of transparent fault tolerance in languages like HdpH-RS. The implementation could be improved in various ways: by integrating HdpH-RS with the the topology aware HdpH implementation (Section 6.4); by extending the communication layer to allow nodes to join a computation; and by avoiding the scalability limitation imposed by instantiating a fully connected graph of nodes during execution as in SD Erlang (Chechina et al, 2014). The current implementation re-evaluates any tasks created by a lost task, and this may be very expensive e.g.…”
Section: Resultsmentioning
confidence: 99%
“…The Kalkyl results are discussed by [21], and Figure 29 in Section i shows representative results for distributed Erlang computing orbits with 2M and 5M elements on Athos. In all cases performance degrades beyond some scale (40 nodes for the 5M orbit, and 140 nodes for the 2M orbit).…”
Section: Distributed Erlang Scalabilitymentioning
confidence: 99%
“…This section outlines the Scalable Distributed (SD) Erlang libraries [21] we have designed and implemented to address the distributed Erlang scalability issues identified in Section ii. SD Erlang introduces two concepts to improve scalability.…”
Section: Improving Language Scalabilitymentioning
confidence: 99%
See 2 more Smart Citations