Reducing response latency of composite functions-as-a-service through scheduling

计算机科学 调度(生产过程) 延迟(音频) 响应时间 复合数 分布式计算 并行计算 操作系统 电信 数学优化 算法 数学
作者
Paweł Żuk,Krzysztof Rządca
出处
期刊:Journal of Parallel and Distributed Computing [Elsevier]
卷期号:167: 18-30 被引量:5
标识
DOI:10.1016/j.jpdc.2022.04.011
摘要

• Function composition is a recent addition to Function-as-a-Service model. • Scheduling algorithms can be adjusted to the FaaS composition specificity. • Considering the FaaS composition structure can lead to lower response latencies. In Function-as-a-Service (FaaS) clouds, customers deploy to cloud individual functions, in contrast to complete virtual machines (IaaS) or Linux containers (PaaS). FaaS offerings are available in the largest public clouds (Amazon Lambda, Google Cloud Functions, Azure Serverless); there are also popular open-source implementations (Apache OpenWhisk) with commercial offerings (Adobe I/O Runtime, IBM Cloud Functions). A recent addition to FaaS is the ability to compose functions: a function may call another functions, which, in turn, may call yet another function — forming a directed acyclic graph (DAG) of invocations. From the perspective of the infrastructure, a composed function is less opaque than a virtual machine or a container. We show that this additional information about the internal structure of the function enables the infrastructure provider to reduce the response latency. In particular, knowing the successors of a function in a DAG, the infrastructure can schedule these future invocations along with necessary preparation of environments. We model resource management in FaaS as a scheduling problem combining (1) sequencing of invocations; (2) deploying execution environments on machines; and (3) allocating invocations to deployed environments. For each aspect, we propose heuristics that employ FaaS-specific features. We explore their performance by simulation on a range of synthetic workloads and on workloads inspired by trace from existing system. Our results show that if the setup times are long compared to invocation times, algorithms that use information about the composition of functions consistently outperform greedy, myopic algorithms, leading to significant decrease in response latency.
最长约 10秒,即可获得该文献文件

科研通智能强力驱动
Strongly Powered by AbleSci AI
更新
大幅提高文件上传限制,最高150M (2024-4-1)

科研通是完全免费的文献互助平台,具备全网最快的应助速度,最高的求助完成率。 对每一个文献求助,科研通都将尽心尽力,给求助人一个满意的交代。
实时播报
苗条羞花完成签到,获得积分20
2秒前
Meveee发布了新的文献求助10
3秒前
酸化土壤改良应助Jing采纳,获得10
7秒前
小辉辉同学完成签到 ,获得积分10
10秒前
12秒前
研友_nEj9DZ完成签到,获得积分10
12秒前
汉堡包应助鱼海寻俞采纳,获得10
13秒前
十三完成签到,获得积分20
14秒前
15秒前
18秒前
COCO发布了新的文献求助10
20秒前
桐桐应助Meveee采纳,获得10
20秒前
25秒前
DDT完成签到,获得积分10
25秒前
莫荆发布了新的文献求助10
30秒前
DQ2pi完成签到 ,获得积分10
31秒前
XJ完成签到 ,获得积分20
34秒前
共享精神应助41采纳,获得10
35秒前
科目三应助文静盼烟采纳,获得10
35秒前
rocky15应助南与晚霞采纳,获得30
36秒前
滴答完成签到,获得积分10
37秒前
莫荆完成签到,获得积分10
40秒前
小冯完成签到,获得积分10
41秒前
43秒前
菜籽完成签到,获得积分10
43秒前
日富一日的fighter完成签到,获得积分10
44秒前
45秒前
天天快乐应助COCO采纳,获得10
45秒前
充电宝应助苗条羞花采纳,获得10
46秒前
46秒前
rocky15应助刘刘刘采纳,获得20
48秒前
九十发布了新的文献求助10
49秒前
大乐发布了新的文献求助10
53秒前
Ava应助杨羕采纳,获得10
55秒前
56秒前
fuxiao完成签到 ,获得积分10
56秒前
57秒前
CodeCraft应助曾梦采纳,获得10
57秒前
wanci应助毛毛采纳,获得10
59秒前
汤姆发布了新的文献求助10
1分钟前
高分求助中
Un calendrier babylonien des travaux, des signes et des mois: Séries iqqur îpuš 1036
Sustainable Land Management: Strategies to Cope with the Marginalisation of Agriculture 1000
Corrosion and Oxygen Control 600
Heterocyclic Stilbene and Bibenzyl Derivatives in Liverworts: Distribution, Structures, Total Synthesis and Biological Activity 500
重庆市新能源汽车产业大数据招商指南(两链两图两池两库两平台两清单两报告) 400
Division and square root. Digit-recurrence algorithms and implementations 400
行動データの計算論モデリング 強化学習モデルを例として 400
热门求助领域 (近24小时)
化学 材料科学 医学 生物 有机化学 工程类 生物化学 纳米技术 物理 内科学 计算机科学 化学工程 复合材料 遗传学 基因 物理化学 催化作用 电极 光电子学 量子力学
热门帖子
关注 科研通微信公众号,转发送积分 2544335
求助须知:如何正确求助?哪些是违规求助? 2175156
关于积分的说明 5598358
捐赠科研通 1895960
什么是DOI,文献DOI怎么找? 945739
版权声明 565319
科研通“疑难数据库(出版商)”最低求助积分说明 503489