A study of Erlang ETS table implementations and performance

Fritchie, Scott Lystig

doi:10.1145/940880.940887

Cited by 10 publications

(4 citation statements)

References 6 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…The list of pairs that the algorithm initially gets is the list of the investigated form nodes. The TableOfDifferences variable refers to the ETS table [7] in which the difference nodes are stored. While analyzing a new version of a file RefactorErl recognizes the new, deleted and modified forms of the source code based on the hash value of the forms.…”

Section: Updatementioning

confidence: 99%

Towards Version Controlling in RefactorErl

2021

View full text Add to dashboard Cite

Static source code analyser tools are operating on an intermediate representation of the source code that is usually a tree or a graph. Those representations need to be updated according to the different versions of the source code. However, the developers might be interested in the changes or might need information about previous versions, therefore, keeping different versions of the source code analysed by the tools are required. RefactorErl is an open-source static analysis and transformation tool for Erlang that uses a graph representation to store and manipulate the source code. The aim of our research was to create an extension of the Semantic Program Graph of RefactorErl that is able to store different versions of the source code in a single graph. The new method resulted in 30% memory footprint decrease compared to the available workaround solutions.

show abstract

Section: Updatementioning

confidence: 99%

Towards Version Controlling in RefactorErl

2021

View full text Add to dashboard Cite

show abstract

“…Fritchie has published a study about the ETS table implementations and their performance where he also compares the then current implementations of ETS with B-trees and Judy arrays [10]. However, Fritchie's study was concerned only with sequential performance and did not contain any discussion about concurrent execution.…”

Section: Related Workmentioning

confidence: 99%

More scalable ordered set for ETS using adaptation

Sagonas

Winblad

2014

Proceedings of the Thirteenth ACM SIGPLAN Workshop on Erlang

View full text Add to dashboard Cite

The Erlang Term Storage (ETS) is a key component of the runtime system and standard library of Erlang/OTP. In particular, on big multicores, the performance of many applications that use ETS as a shared key-value store heavily depends on the scalability of ETS. In this work, we investigate an alternative implementation for the ETS table type ordered _ set based on a contention adapting search tree. The new implementation performs many times better than the current one in contended scenarios and scales better than the ETS table types implemented using hashing and fine-grained locking when several processor chips are used. We evaluate the new implementation with a set of experiments that show its scalability in relation to the current ETS implementation as well as its low sequential overhead.

show abstract

“…However, as a bidder cannot revise downwards its bid, the largest bid from the same bidder is always assumed to be the latest. ETS was chosen because it can handle large amounts of data with constant access time . For fallback from failures purpose, the online ETS is replicated in file based disk ETS tables.…”

Section: Concept and Architecturementioning

confidence: 99%

A scalable architecture for concurrent online auctions

Karakostas

2013

Concurrency and Computation

View full text Add to dashboard Cite

SUMMARY Online auction systems are characterised by a number of functional and performance management requirements, caused by the potentially very large numbers of distributed concurrent bidders, as well as by the auction rules. Such systems are typically implemented as three tier, thread‐based architectures, whose performance does not scale up well with an increase in the number of concurrent bidders. Nor such systems can take advantage of new Cloud based environments. In this paper, we propose an architectural framework for online auctions developed on top of a soft real‐time platform (Open Telecom Platform) using a concurrent language (Erlang) and an embedded Web server (Yaws). The proposed framework can scale up to hundreds of thousands of concurrent users while its performance can benefit from multicore and symmetric multiprocessing computer architectures. We demonstrate the capabilities of the framework by developing prototypes for two auction types known as ‘unique bid’ and ‘penny’, analyse their performance characteristics and compare them with that of existing auction systems. Copyright © 2013 John Wiley & Sons, Ltd.

show abstract

A study of Erlang ETS table implementations and performance

Cited by 10 publications

References 6 publications

Towards Version Controlling in RefactorErl

Towards Version Controlling in RefactorErl

More scalable ordered set for ETS using adaptation

A scalable architecture for concurrent online auctions

Contact Info

Product

Resources

About