论文标题
无服务器最终游戏:分类实现透明度
Serverless End Game: Disaggregation enabling Transparency
论文作者
论文摘要
多年来,分布式系统社区一直在努力平滑从本地计算到远程计算的过渡。透明度意味着掩盖分布式编程的复杂性,例如远程位置,失败或缩放。对我们来说,完整的透明度意味着我们可以在有效的无限计算,存储和内存资源上编译,调试和运行未修改的单机器代码。我们在本文中详细说明了为什么资源在无服务器计算中分类是实现云中完全透明度的确定催化剂。我们通过两个实验证明,我们可以通过分解无服务器资源来实现透明度,并获得与本地执行的可比性能。我们还表明,对于许多问题,不能忽略局部性,我们提出了五个开放的研究挑战:颗粒中间件和地方,内存分解,虚拟化,弹性编程模型和优化的部署。如果可以完全透明度,那么如果您可以将远程实体视为本地实体,则需要明确使用中间件?我们可以关闭大多数用户的分布式系统复杂性的窗帘吗?
For many years, the distributed systems community has struggled to smooth the transition from local to remote computing. Transparency means concealing the complexities of distributed programming like remote locations, failures or scaling. For us, full transparency implies that we can compile, debug and run unmodified single-machine code over effectively unlimited compute, storage, and memory resources. We elaborate in this article why resource disaggregation in serverless computing is the definitive catalyst to enable full transparency in the Cloud. We demonstrate with two experiments that we can achieve transparency today over disaggregated serverless resources and obtain comparable performance to local executions. We also show that locality cannot be neglected for many problems and we present five open research challenges: granular middleware and locality, memory disaggregation, virtualization, elastic programming models, and optimized deployment. If full transparency is possible, who needs explicit use of middleware if you can treat remote entities as local ones? Can we close the curtains of distributed systems complexity for the majority of users?