2021 IEEE International Conference on Autonomic Computing and Self-Organizing Systems (ACSOS) 2021
DOI: 10.1109/acsos52086.2021.00023
|View full text |Cite
|
Sign up to set email alerts
|

FaaSRank: Learning to Schedule Functions in Serverless Platforms

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

0
4
0

Year Published

2022
2022
2023
2023

Publication Types

Select...
5
1
1

Relationship

0
7

Authors

Journals

citations
Cited by 12 publications
(4 citation statements)
references
References 13 publications
0
4
0
Order By: Relevance
“…Previous works showed that the setup time of worker nodes and related supporting infrastructure is expensive [8], [15]. The solutions include preemptively provision network cache and shell-nodes [15], preemptively provision new shell nodes and load-balance existing worker nodes across physical clusters [8], rank and select servers for function scheduling [16], and preemptively provision the worker nodes based on node cache miss rate [17]. Keep-alive policies can be based on operational priorities such as cost, frequencies, time, size [17].…”
Section: A Previous Workmentioning
confidence: 99%
See 1 more Smart Citation
“…Previous works showed that the setup time of worker nodes and related supporting infrastructure is expensive [8], [15]. The solutions include preemptively provision network cache and shell-nodes [15], preemptively provision new shell nodes and load-balance existing worker nodes across physical clusters [8], rank and select servers for function scheduling [16], and preemptively provision the worker nodes based on node cache miss rate [17]. Keep-alive policies can be based on operational priorities such as cost, frequencies, time, size [17].…”
Section: A Previous Workmentioning
confidence: 99%
“…If future demands will not be met, more infrastructure supports and/or shell nodes will be preemptively provisioned per [6], [8], [12], [15], [18]. If future demands can be met, the system will rank existing available resources and orchestrate them per [16]. Resource ranking and infra-structure orchestration schedules will be shared with path B.…”
Section: B the Ensemble Policymentioning
confidence: 99%
“…A policy gradient algorithm is proposed in [34], to identify the best node for scheduling a function request. [35] uses a DRL approach to determine the percentage of user requests to be processed by the cloud and offloaded to the fog layer.…”
Section: B Rl Solutions For Serverless Resource Managementmentioning
confidence: 99%
“…The loadlocality tradeoff we explore is complementary to these CPU scheduling optimizations. The repetitive nature of functions and their workflows can also be used to improve resource utilization and latency [9,19,28,37]: our load-balancer is stateless for the sake of simplicity and can be enhanced with these techniques if necessary.…”
Section: Related Workmentioning
confidence: 99%