Skip to main content

Abstract

Aggregate Programming (AP) is a paradigm for developing applications that execute on a fully distributed network of communicating, resource-constrained, spatially-situated nodes (e.g., drones, wireless sensors, etc.). In this paper, we address running an AP application on a high-performance, centralized computer such as the ones available in a cloud environment. As a proof of concept, we present preliminary results on the computation of graph statistics for centralised data sets, by extending FCPP, a C++ library implementing AP. This: (i) opens the way to the application of the AP paradigm to problems on large centralised graph-based data structures, enabling massive parallelisation across multiple machines, dynamically joining and leaving the computation; and (ii) represents a first step towards developing collective adaptive systems where computations dynamically move across the IoT/edge/fog/cloud continuum, based on mutable conditions such as availability of resources and network infrastructures.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 59.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 79.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

References

  1. Web crawl of the Italian cnr domain in year 2000. https://law.di.unimi.it/webdata/cnr-2000. Accessed 26 May 2022

  2. Alongi, F., Ghielmetti, N., Pau, D., Terraneo, F., Fornaciari, W.: Tiny neural networks for environmental predictions: an integrated approach with miosix. In: IEEE International Conference on Smart Computing, (SMARTCOMP), pp. 350–355. IEEE (2020). https://doi.org/10.1109/SMARTCOMP50058.2020.00076

  3. Audrito, G.: FCPP: an efficient and extensible field calculus framework. In: International Conference on Autonomic Computing and Self-Organizing Systems (ACSOS), pp. 153–159. IEEE (2020). https://doi.org/10.1109/ACSOS49614.2020.00037

  4. Audrito, G., Casadei, R., Damiani, F., Pianini, D., Viroli, M.: Optimal resilient distributed data collection in mobile edge environments. Comput. Electr. Eng. 96(Part), 107580 (2021). https://doi.org/10.1016/j.compeleceng.2021.107580

  5. Audrito, G., Casadei, R., Torta, G.: Fostering resilient execution of multi-agent plans through self-organisation. In: ACSOS Companion Volume, pp. 81–86. IEEE (2021). https://doi.org/10.1109/ACSOS-C52956.2021.00076

  6. Audrito, G., Casadei, R., Torta, G.: Towards integration of multi-agent planning with self-organising collective processes. In: ACSOS Companion Volume, pp. 297–298. IEEE (2021). https://doi.org/10.1109/ACSOS-C52956.2021.00042

  7. Audrito, G., et al.: RM for users’ safety and security in the built environment. In: VORTEX, pp. 13–16. ACM (2021). https://doi.org/10.1145/3464974.3468445

  8. Audrito, G., Damiani, F., Stolz, V., Torta, G., Viroli, M.: Distributed runtime verification by past-ctl and the field calculus. J. Syst. Softw. 187, 111251 (2022). https://doi.org/10.1016/j.jss.2022.111251

  9. Audrito, G., Pianini, D., Damiani, F., Viroli, M.: Aggregate centrality measures for IOT-based coordination. Sci. Comput. Program. 203, 102584 (2021). https://doi.org/10.1016/j.scico.2020.102584

    Article  Google Scholar 

  10. Audrito, G., Rapetta, L., Torta, G.: Extensible 3d simulation of aggregated systems with FCPP. In: COORDINATION. Lecture Notes in Computer Science, vol. 13271, pp. 55–71. Springer (2022). https://doi.org/10.1007/978-3-031-08143-9_4

  11. Audrito, G., Torta, G.: Towards aggregate monitoring of spatio-temporal properties. In: VORTEX, pp. 26–29. ACM (2021). https://doi.org/10.1145/3464974.3468448

  12. Audrito, G., Viroli, M., Damiani, F., Pianini, D., Beal, J.: A higher-order calculus of computational fields. ACM Trans. Comput. Log. 20(1), 5:1–5:55 (2019). https://doi.org/10.1145/3285956

  13. Backstrom, L., Boldi, P., Rosa, M., Ugander, J., Vigna, S.: Four degrees of separation. In: Web Science 2012, WebSci 2012, Evanston, IL, USA, 22–24 June 2012, pp. 33–42 (2012). https://doi.org/10.1145/2380718.2380723

  14. Beal, J., Pianini, D., Viroli, M.: Aggregate programming for the internet of things. IEEE Comput. 48(9), 22–30 (2015). https://doi.org/10.1109/MC.2015.261

    Article  Google Scholar 

  15. Boldi, P., Rosa, M., Santini, M., Vigna, S.: Layered label propagation: a multiresolution coordinate-free ordering for compressing social networks. In: World Wide Web (WWW), pp. 587–596. ACM (2011). https://doi.org/10.1145/1963405.1963488

  16. Boldi, P., Rosa, M., Vigna, S.: Hyperanf: approximating the neighbourhood function of very large graphs on a budget. In: World Wide Web (WWW), pp. 625–634 (2011). https://doi.org/10.1145/1963405.1963493

  17. Boldi, P., Vigna, S.: The webgraph framework I: compression techniques. In: World Wide Web (WWW), pp. 595–602. ACM (2004). https://doi.org/10.1145/988672.988752

  18. Brin, S., Page, L.: The anatomy of a large-scale hypertextual web search engine. Comput. Netw. 30(1–7), 107–117 (1998). https://doi.org/10.1016/S0169-7552(98)00110-X

    Article  Google Scholar 

  19. Canning, P.S., Cook, W.R., Hill, W.L., Olthoff, W.G., Mitchell, J.C.: F-bounded polymorphism for object-oriented programming. In: 4th International Conference on Functional Programming Languages and Computer Architecture (FPCA), pp. 273–280. ACM (1989). https://doi.org/10.1145/99370.99392

  20. Casadei, R., Viroli, M., Audrito, G., Damiani, F.: FScaFi : a core calculus for collective adaptive systems programming. In: Margaria, T., Steffen, B. (eds.) ISoLA 2020. LNCS, vol. 12477, pp. 344–360. Springer, Cham (2020). https://doi.org/10.1007/978-3-030-61470-6_21

    Chapter  Google Scholar 

  21. Casadei, R., Viroli, M., Audrito, G., Pianini, D., Damiani, F.: Engineering collective intelligence at the edge with aggregate processes. Eng. Appl. Artif. Intell. 97, 104081 (2021). https://doi.org/10.1016/j.engappai.2020.104081

    Article  Google Scholar 

  22. Datta, S.K., Bonnet, C.: An edge computing architecture integrating virtual iot devices. In: Global Conference on Consumer Electronics (GCCE), pp. 1–3 (2017). https://doi.org/10.1109/GCCE.2017.8229253

  23. Flajolet, P., Fusy, É., Gandouet, O., Meunier, F.: Hyperloglog: the analysis of a near-optimal cardinality estimation algorithm. In: Analysis of Algorithms 2007 (AofA07), pp. 127–146 (2007)

    Google Scholar 

  24. Li, L., Fan, Y., Tse, M., Lin, K.Y.: A review of applications in federated learning. Comput. Ind. Eng. 149 (2020). https://doi.org/10.1016/j.cie.2020.106854

  25. Liu, X., Zhou, Y., Guan, X., Shen, C.: A feasible graph partition framework for parallel computing of big graph. Knowl.-Based Syst. 134, 228–239 (2017). https://doi.org/10.1016/j.knosys.2017.08.001

    Article  Google Scholar 

  26. Page, L.: Method for node ranking in a linked database, 4 Sep 2001. US Patent 6,285,999

    Google Scholar 

  27. Palmer, C.R., Gibbons, P.B., Faloutsos, C.: ANF: a fast and scalable tool for data mining in massive graphs. In: International Conference on Knowledge Discovery and Data Mining (SIGKDD), pp. 81–90 (2002). https://doi.org/10.1145/775047.775059

  28. Pianini, D., Montagna, S., Viroli, M.: Chemical-oriented simulation of computational systems with ALCHEMIST. J. Simul. 7(3), 202–215 (2013). https://doi.org/10.1057/jos.2012.27

    Article  Google Scholar 

  29. Pianini, D., Viroli, M., Beal, J.: Protelis: practical aggregate programming. In: Symposium on Applied Computing (SAC), pp. 1846–1853. ACM (2015). https://doi.org/10.1145/2695664.2695913

  30. Sahlmann, K., Schwotzer, T.: Ontology-based virtual iot devices for edge computing. In: International Conference on the Internet of Things. Association for Computing Machinery (2018). https://doi.org/10.1145/3277593.3277597

  31. Testa, L., Audrito, G., Damiani, F., Torta, G.: Aggregate processes as distributed adaptive services for the industrial internet of things. Pervasive Mob. Comput. 85 (2022). https://doi.org/10.1016/j.pmcj.2022.101658

  32. Viroli, M., Beal, J., Damiani, F., Audrito, G., Casadei, R., Pianini, D.: From distributed coordination to field calculus and aggregate computing. J. Log. Algebraic Meth. Program. 109 (2019). https://doi.org/10.1016/j.jlamp.2019.100486

  33. Viroli, M., Casadei, R., Pianini, D.: Simulating large-scale aggregate mass with alchemist and scala. In: Federated Conference on Computer Science and Information Systems (FedCSIS). Annals of Computer Science and Information Systems, vol. 8, pp. 1495–1504. IEEE (2016). https://doi.org/10.15439/2016F407

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Ferruccio Damiani .

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2022 The Author(s), under exclusive license to Springer Nature Switzerland AG

About this paper

Check for updates. Verify currency and authenticity via CrossMark

Cite this paper

Audrito, G., Damiani, F., Torta, G. (2022). Bringing Aggregate Programming Towards the Cloud. In: Margaria, T., Steffen, B. (eds) Leveraging Applications of Formal Methods, Verification and Validation. Adaptation and Learning. ISoLA 2022. Lecture Notes in Computer Science, vol 13703. Springer, Cham. https://doi.org/10.1007/978-3-031-19759-8_19

Download citation

  • DOI: https://doi.org/10.1007/978-3-031-19759-8_19

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-031-19758-1

  • Online ISBN: 978-3-031-19759-8

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics