Serverless computing (also known as functions as a service) is a new cloud computing abstraction that makes it easier to write robust, large-scale web services. In serverless computing, programmers write what are called serverless functions, which are programs that respond to external events. When demand for the serverless function spikes, the platform automatically allocates additional hardware and manages load-balancing; when demand falls, the platform silently deallocates idle resources; and when the platform detects a failure, it transparently retries affected requests. In 2014, Amazon Web Services introduced the first serverless platform, AWS Lambda, and similar abstractions are now available on all major cloud computing platforms.
Unfortunately, the serverless computing abstraction exposes several low-level operational details that make it hard for programmers to write and reason about their code. This paper sheds light on this problem by presenting λ_λ, an operational semantics of the essence of serverless computing. Despite being a small (half a page) core calculus, λ_λ models all the low-level details that serverless functions can observe. To show that λ_λ is useful, we present three applications. First, to ease reasoning about code, we present a simplified naive semantics of serverless execution and precisely characterize when the naive semantics and λ_λ coincide. Second, we augment λ_λ with a key-value store to allow reasoning about stateful serverless functions. Third, since a handful of serverless platforms support serverless function composition, we show how to extend λ_λ with a composition language and show that our implementation can outperform prior work.
Wed 23 Oct Times are displayed in time zone: Beirut change
16:00 - 17:30
|Formal Foundations of Serverless Computing|
Abhinav JangdaUniversity of Massachusetts Amherst, Donald PinckneyUniversity of Massachusetts Amherst, Yuriy BrunUniversity of Massachusetts Amherst, Arjun GuhaUniversity of Massachusetts, AmherstLink to publication DOI Pre-print
|A Formalization of Java’s Concurrent Access Modes|
John BenderUniversity of California, Los Angeles, Jens PalsbergUniversity of California, Los AngelesDOI
|A Path to DOT: Formalizing Fully Path-Dependent Types|
OOPSLADOI Pre-print Media Attached
|Qubit Allocation as a Combination of Subgraph Isomorphism and Token Swapping|
Marcos Yukio SiraichiUFMG, Vinícius Fernandes dos SantosUFMG, Caroline CollangeINRIA, Fernando Magno Quintão PereiraUFMGDOI Pre-print