research-article

Open access

Quantified abstract configurations of distributed systems

Authors:

Jesús Correas,

Germán Puebla,

Guillermo Román-DíezAuthors Info & Claims

Formal Aspects of Computing, Volume 27, Issue 4

Pages 665 - 699

https://doi.org/10.1007/s00165-014-0321-z

Published: 01 July 2015 Publication History

Abstract

When reasoning about distributed systems, it is essential to have information about the different kinds of nodes that compose the system, how many instances of each kind exist, and how nodes communicate with other nodes. In this paper we present a static-analysis-based approach which is able to provide information about the questions above. In order to cope with an unbounded number of nodes and an unbounded number of calls among them, the analysis performs an abstraction of the system producing a graph whose nodes may represent (infinitely) many concrete nodes and arcs represent any number of (infinitely) many calls among nodes. The crux of our approach is that the abstraction is enriched with upper bounds inferred by resource analysis that limit the number of concrete instances that the nodes and arcs represent and their resource consumption. The information available in our quantified abstract configurations allows us to define performance indicators which measure the quality of the system. In particular, we present several indicators that assess the level of distribution in the system, the amount of communication among distributed nodes that it requires, and how balanced the load of the distributed nodes that compose the system is. Our performance indicators are given as functions on the input data sizes, and they can be used to automate the comparison of different distributed settings and guide towards finding the optimal configuration.

References

References

[1]

Albert E, Arenas P, Genaim S, Puebla G, Zanardini D (2007) Cost analysis of Java bytecode. In: De Nicola R (ed) Proceedings of the 16th European symposium on programming (ESOP’07). Lecture notes in computer science, vol 4421. Springer, New York, pp 157–172

[2]

Albert E, Arenas P, Genaim S, Herraiz I, Puebla G (2010) Comparing cost functions in resource analysis. In: 1st International workshop on foundational and practical aspects of resource analysis (FOPARA’09). Lecture notes in computer science, vol 6234. Springer, New York, pp 1–17

[3]

Albert E, Arenas P, Genaim S, Gómez-Zamalloa M, Puebla G (2011) Cost analysis of concurrent oo programs. In: Proceedings of APLAS’11. LNCS, vol 7078. Springer, New York, pp 238–254

[4]

Albert E, Arenas P, Genaim S, Gómez-Zamalloa M, Puebla G (2012) COSTABS: a cost and termination analyzer for ABS. In: Proceedings of PEPM’12. ACM Press, New York, pp 151–154

[5]

Albert E, Arenas P, Genaim S, Puebla G, and Zanardini D Cost analysis of object-oriented bytecode programs Theor Comput Sci (Spec Issue Quant Asp Program Lang) 2012 413 1 142-159

Digital Library

[6]

Albert E, Arenas P, Genaim S, Puebla G (2008) Automatic inference of upper bounds for recurrence relations in cost analysis. In: Proceedings of SAS’08. Lecture notes in computer science, vol 5079. Springer, New York, pp 221–237

[7]

Albert E, Arenas P, Genaim S, and Puebla G Closed-form upper bounds in static cost analysis J Autom Reason 2011 46 2 161-203

Digital Library

[8]

Albert E, Correas J, Puebla G, Román-Díez G (2013) Quantified abstractions of distributed systems. In: Proceedings of iFM’13. LNCS, vol 7940. Springer, New York, pp 285–300

[9]

Albert E, Flores-Montoya A, Genaim S, Martin-Martin E (2013) Termination and cost analysis of loops with concurrent interleavings. In: ATVA’13, LNCS, vol 8172. Springer, New York, pp 349–364

[10]

America P Issues in the design of a parallel object-oriented language Form Asp Comput 1989 1 366-411

Digital Library

[11]

Albert E, Arenas P, Correas J, Gómez-Zamalloa M, Genaim S, Puebla G, Román-Díez G (2012) Object-sensitive cost analysis for concurrent objects. http://costa.ls.fi.upm.es/papers/costa/AlbertACGGPRtr.pdf. Accessed 15 May 2014

[12]

Al-Saleh MF and Yousif AE Properties of the standard deviation that are rarely mentioned in classrooms Austrian J Stat 2009 38 3 193-202

[13]

Armstrong J, Virding R, Wistrom C, and Williams M Concurrent programming in Erlang 1996 USA Prentice Hall

Digital Library

[14]

Bruynooghe M, Codish M, Gallagher J, Genaim S, and Vanhoof W Termination analysis of logic programs through combination of type-based norms TOPLAS 2007 29 2 10

Digital Library

[15]

Bjørk J, de Boer FS, Broch Johnsen E, Schlatte R, and Tapia Tarifa SL User-defined schedulers for real-time concurrent objects ISSE 2013 9 1 29-43

[16]

Buyya R, Yeo CS, Venugopal S, Broberg J, and Brandic I Cloud computing and emerging IT platforms: vision, hype, and reality for delivering computing as the 5th utility Future Gener Comput Syst 2009 25 6 599-616

Digital Library

[17]

Caromel D Towards a method of object-oriented concurrent programming Commun ACM 1993 36 9 90-102

Digital Library

[18]

de Boer FS, Grabe I, and Steffen M Termination detection for active objects J Log Algebr Program 2012 81 4 541-557

[19]

Di Pierro A, Hankin C, and Wiklicky H Quantitative static analysis of distributed systems J Funct Program 2005 1 37-81

[20]

Feret J Occurrence counting analysis for the pi-calculus Electron Notes Theor Comput Sci 2001 39 2 1-18

[21]

Flores-Montoya A, Albert E, Genaim S (2013) May-happen-in-parallel based deadlock analysis for concurrent objects. In: FORTE’13. LNCS. Springer, New York, pp 273–288

[22]

Gori R, Levi F (2005) A new occurrence counting analysis for bioambients. In: APLAS. LNCS, vol 3780. Springer, New York, pp 381–400

[23]

Haller P and Odersky M Scala actors: unifying thread-based and event-based programming Theor Comput Sci 2009 410 2–3 202-220

Digital Library

[24]

Johnsen EB, Hähnle R, Schäfer J, Schlatte R, Steffen M (2012) ABS: a core language for abstract behavioral specification. In: Proceedings of FMCO’10 (revised papers). LNCS, vol 6957. Springer, New York, pp 142–164

[25]

Milanova A, Rountev A, and Ryder BG Parameterized object sensitivity for points-to analysis for Java ACM Trans Softw Eng Methodol 2005 14 1-41

Digital Library

[26]

Smaragdakis Y, Bravenboer M, Lhoták O (2011) Pick your contexts well: understanding object-sensitivity. In: Proceedings of POPL’11. ACM, New York, pp 17–30

[27]

Schäfer J, Poetzsch-Heffter A (2010) JCobox: generalizing active objects to concurrent components. In: Proceedings of ECOOP’10. LNCS. Springer, New York, pp 275–299

[28]

Yonezawa A, Briot JP, Shibayama E (1986) Object-oriented concurrent programming ABCL/1. In: Proceedings of OOPLSA’86. ACM, New York, pp 258–268

Cited By

Uhrmacher AFrazier PHähnle RKlügl FLorig FLudäscher BNenzi LRuiz-Martin CRumpe BSzabo CWainer GWilsdorf P(2024)Context, Composition, Automation, and Communication: The C2AC Roadmap for Modeling and SimulationACM Transactions on Modeling and Computer Simulation10.1145/367322634:4(1-51)Online publication date: 13-Aug-2024
https://dl.acm.org/doi/10.1145/3673226
Albert EFlores-Montoya AGenaim SMartin-Martin E(2017)Rely-Guarantee Termination and Cost Analyses of Loops with Concurrent InterleavingsJournal of Automated Reasoning10.1007/s10817-016-9400-659:1(47-85)Online publication date: 1-Jun-2017
https://dl.acm.org/doi/10.1007/s10817-016-9400-6
Albert ECorreas JRomán-Díez G(2016)Resource Analysis of Distributed SystemsEssays Dedicated to Frank de Boer on Theory and Practice of Formal Methods - Volume 966010.1007/978-3-319-30734-3_5(33-46)Online publication date: 1-Jan-2016
https://dl.acm.org/doi/10.1007/978-3-319-30734-3_5
Show More Cited By

Recommendations

Replica Placement for Route Diversity in Tree-Based Routing Distributed Hash Tables

Distributed hash tables (DHTs) share storage and routing responsibility among all nodes in a peer-to-peer network. These networks have bounded path length unlike unstructured networks. Unfortunately, nodes can deny access to keys or misroute lookups. We ...
Two Hierarchical Dynamic Load Balancing Algorithms in Distributed Systems
ICCEE '09: Proceedings of the 2009 Second International Conference on Computer and Electrical Engineering - Volume 01

In this paper two new methods for load balancing in distributed systems are proposed. Both methods are based on hierarchical structure. Hierarchical structure provides better load management because it allows algorithms to balance the loads in two ...
Complexity and Resource Bound Analysis of Imperative Programs Using Difference Constraints

Difference constraints have been used for termination analysis in the literature, where they denote relational inequalities of the form $$x' \le y + c$$xź≤y+c, and describe that the value of x in the current state is at most the value of y in the ...

Comments

Information & Contributors

Information

Published In

cover image Formal Aspects of Computing

Formal Aspects of Computing Volume 27, Issue 4

Jul 2015

139 pages

ISSN:0934-5043

EISSN:1433-299X

Issue’s Table of Contents

© British Computer Society 2014.

Publisher

Springer-Verlag

Berlin, Heidelberg

Publication History

Published: 01 July 2015

Accepted: 12 September 2014

Revision received: 31 May 2014

Received: 15 November 2013

Published in FAC Volume 27, Issue 4

Author Tags

Qualifiers

Research-article

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

4
Total Citations
View Citations
83
Total Downloads

Downloads (Last 12 months)50
Downloads (Last 6 weeks)10

Reflects downloads up to 08 Feb 2025

Other Metrics

View Author Metrics

Citations

Cited By

Uhrmacher AFrazier PHähnle RKlügl FLorig FLudäscher BNenzi LRuiz-Martin CRumpe BSzabo CWainer GWilsdorf P(2024)Context, Composition, Automation, and Communication: The C2AC Roadmap for Modeling and SimulationACM Transactions on Modeling and Computer Simulation10.1145/367322634:4(1-51)Online publication date: 13-Aug-2024
https://dl.acm.org/doi/10.1145/3673226
Albert EFlores-Montoya AGenaim SMartin-Martin E(2017)Rely-Guarantee Termination and Cost Analyses of Loops with Concurrent InterleavingsJournal of Automated Reasoning10.1007/s10817-016-9400-659:1(47-85)Online publication date: 1-Jun-2017
https://dl.acm.org/doi/10.1007/s10817-016-9400-6
Albert ECorreas JRomán-Díez G(2016)Resource Analysis of Distributed SystemsEssays Dedicated to Frank de Boer on Theory and Practice of Formal Methods - Volume 966010.1007/978-3-319-30734-3_5(33-46)Online publication date: 1-Jan-2016
https://dl.acm.org/doi/10.1007/978-3-319-30734-3_5
Albert EArenas PCorreas JGenaim SGómez-Zamalloa MMartin-Martin EPuebla GRomán-Díez G(2015)Resource Analysis: From Sequential to Concurrent and Distributed ProgramsFM 2015: Formal Methods10.1007/978-3-319-19249-9_1(3-17)Online publication date: 2015
https://doi.org/10.1007/978-3-319-19249-9_1

View Options

View options

PDF

View or Download as a PDF file.

eReader

View online with eReader.

Login options

Check if you have access through your login credentials or your institution to get full access on this article.

Full Access

Get this Article

Figures

Tables

Media

View Issue’s Table of Contents