Cardiff University | Prifysgol Caerdydd ORCA
Online Research @ Cardiff 
WelshClear Cookie - decide language by browser settings

Modelling serverless function behaviours

Tolosana-Calasanz, Rafael, Castañé, Gabriel G., Bañares, José Á. and Rana, Omer ORCID: 2021. Modelling serverless function behaviours. Presented at: International Conference on the Economics of Grids, Clouds, Systems, and Services 2021, Virtual, 21-23 September 2021. Proceedings of Economics of Grids, Clouds, Systems, and Services. Lecture Notes in Computer Science. Lecture Notes in Computer Science , vol.13072 Springer, pp. 109-122. 10.1007/978-3-030-92916-9_9

[thumbnail of GECON21_Serverless (1).pdf]
PDF - Accepted Post-Print Version
Download (837kB) | Preview


The serverless computing model extends potential deployment options for cloud applications, by allowing users to focus on building and deploying their code without needing to configure or manage the underlying computational resources. Cost and latency constraints in stream processing user applications often push computations closer to the sources of data, leading to challenges for dynamically distributing stream operators across the edge/fog/cloud heterogeneous nodes and the routing of data flows. Various approaches to support operator placement across edge and cloud resources and data routing are beginning to be addressed through the serverless model. Understanding how stream processing operators can be mapped into serverless functions also offers cost incentives for users – as charging is now on a subsecond basis (rather than hourly). A dynamic Petri net model of serverless functions is proposed in this work, which takes account of the computational requirements of functions, the resources on which these functions are hosted, and key parameters that impact the behaviour of serverless functions – such as warm/cold start up times. The model can be used by developers/users of serverless functions to understand how deployment optimisation can be used to reduce application time, and to analyse various scenarios on choosing function granularity, data size and cost.

Item Type: Conference or Workshop Item (Paper)
Date Type: Published Online
Status: Published
Schools: Computer Science & Informatics
Publisher: Springer
ISBN: 9783030929152
ISSN: 0302-9743
Date of First Compliant Deposit: 9 December 2021
Date of Acceptance: 9 December 2021
Last Modified: 09 Dec 2022 02:30

Actions (repository staff only)

Edit Item Edit Item


Downloads per month over past year

View more statistics