PerformERL: a performance testing framework for erlang
-
Published:2022-08-01
Issue:5
Volume:35
Page:439-454
-
ISSN:0178-2770
-
Container-title:Distributed Computing
-
language:en
-
Short-container-title:Distrib. Comput.
Author:
Cazzola WalterORCID, Cesarini Francesco, Tansini Luca
Abstract
AbstractThe Erlang programming language is used to build concurrent, distributed, scalable and resilient systems. Every component of these systems has to be thoroughly tested not only for correctness, but also for performance. Performance analysis tools in the Erlang ecosystem, however, do not provide a sufficient level of automation and insight needed to be integrated in modern tool chains. In this paper, we present : an extendable performance testing framework that combines the repeatability of load testing tools with the details on how the resources are internally used typical of the performance monitoring tools. These features allow to be integrated in the early stages of testing pipelines, providing users with a systematic approach to identifying performance issues. This paper introduces the framework, focusing on its features, design and imposed monitoring overhead measured through both theoretical estimates and trial runs on systems in production. The uniqueness of the features offered by , together with its usability and contained overhead prove that the framework can be a valuable resource in the development and maintenance of Erlang applications.
Funder
Ministero dell’Università e della Ricerca
Publisher
Springer Science and Business Media LLC
Subject
Computational Theory and Mathematics,Computer Networks and Communications,Hardware and Architecture,Theoretical Computer Science
Reference35 articles.
1. Aceto, L., Attard, D. P., Francalanza, A., Ingólfsdóttir, A.: On Benchmarking for Concurrent Runtime Verification. In FASE’21, LNCS 12649, pp. 3–23, Luxembourg City, Luxembourg, (2021). Springer 2. Agha, G.: Actors: A Model of Concurrent Computation in Distributed Systems. MIT Press, Cambridge (1986) 3. Andersson, A.: General Balanced Trees. J Algorithms 30(1), 1–18 (1999) 4. Aronis, S., Papaspyrou, N., Roukounaki, K., Sagonas, K., Tsiouris, Y., Venetis, I.E.: A Scalability Benchmark Suite for Erlang/OTP. In Erlang’12, pp. 33–42, Copenhagen, Denmark, (2012). ACM 5. Attard, D.P., Aceto, L., Achilleos, A., Francalanza, A., Ingólfsdóttir, A., Lehtinen, K.: Better Late Than Never or: Verifying Asynchronous Components at Runtime. In FORTE’21, LNCS 12719, pp. 207–225, Valletta, Malta, (2021). Springer
Cited by
1 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献
1. Algebraic Reasoning About Timeliness;Electronic Proceedings in Theoretical Computer Science;2023-08-21
|
|