2021
DOI: 10.1109/tpds.2020.3028841
|View full text |Cite
|
Sign up to set email alerts
|

Modeling and Optimization of Performance and Cost of Serverless Applications

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

1
54
0

Year Published

2021
2021
2023
2023

Publication Types

Select...
6
2

Relationship

0
8

Authors

Journals

citations
Cited by 94 publications
(62 citation statements)
references
References 24 publications
1
54
0
Order By: Relevance
“…These performance and cost models enable application developers to plan and budget their deployments in the most cost efective manner. Lin et al propose an analytical model to predict response time and cost for worklow execution in serverless platforms [81]. They consider variations in response time and cost with the allocated memory in building these models.…”
Section: Elements Of Resource Managementmentioning
confidence: 99%
“…These performance and cost models enable application developers to plan and budget their deployments in the most cost efective manner. Lin et al propose an analytical model to predict response time and cost for worklow execution in serverless platforms [81]. They consider variations in response time and cost with the allocated memory in building these models.…”
Section: Elements Of Resource Managementmentioning
confidence: 99%
“…In addition, using YAWL to analyze the properties of the model requires constructing the model with YAWL and using the YAWL engine [18]. In [19], the serverless application workflow is defined as a weighted directed graph. The performance and cost of the serverless application can be predicted through the analysis of the workflow model.…”
Section: Related Workmentioning
confidence: 99%
“…Reachability graph is a main tool to analyse the property of Petri net [19]. Each point is a marking in the reachability graph.…”
Section: The Soundness Of the System Frameworkmentioning
confidence: 99%
“…In this way, a value such as execution time or cost of a conditional branch is calculated as an expected value. Lin et al [21] used this method to model performance and the cost of a workflow that contained branches.…”
Section: Conditional Branchmentioning
confidence: 99%
“…Many optimization methods for complex workflows have been proposed in recent studies. In [21], authors define common patterns for workflows (i.e., self-loop, cycle, parallel, branch) as probabilistic direct acyclic graphs to model various types of workflows. Their method optimizes the performance of the cost of a workflow using a greedy heuristic that adjusts memory configuration based on the critical path.…”
Section: Workflows Management and Optimizations For Serverless Computingmentioning
confidence: 99%