Fault-tolerant and Transactional Stateful Serverless Workflows (extended version)

10/13/2020
by   Haoran Zhang, et al.
0

This paper introduces Beldi, a library and runtime system for writing and composing fault-tolerant and transactional stateful serverless functions. Beldi runs on existing providers and lets developers write complex stateful applications that require fault tolerance and transactional semantics without the need to deal with tasks such as load balancing or maintaining virtual machines. Beldi's contributions include extending the log-based fault-tolerant approach in Olive (OSDI 2016) with new data structures, transaction protocols, function invocations, and garbage collection. They also include adapting the resulting framework to work over a federated environment where each serverless function has sovereignty over its own data. We implement three applications on Beldi, including a movie review service, a travel reservation system, and a social media site. Our evaluation on 1,000 AWS Lambdas shows that Beldi's approach is effective and affordable.

READ FULL TEXT

page 4

page 7

page 8

page 9

page 13

page 15

page 17

page 18

research
04/22/2019

Pangolin: A Fault-Tolerant Persistent Memory Programming Library

Non-volatile main memory (NVMM) allows programmers to build complex, per...
research
06/11/2017

Fault Tolerant Consensus Agreement Algorithm

Recently a new fault tolerant and simple mechanism was designed for solv...
research
05/10/2022

Constant approximation for fault-tolerant median problems via iterative rounding

In this paper, we study the fault-tolerant matroid median and fault-tole...
research
07/14/2021

A Byzantine Fault-Tolerant Consensus Library for Hyperledger Fabric

Hyperledger Fabric is an enterprise grade permissioned distributed ledge...
research
01/10/2020

RMWPaxos: Fault-Tolerant In-Place Consensus Sequences

Building consensus sequences based on distributed, fault-tolerant consen...
research
04/22/2022

Deterministic Sensitivity Oracles for Diameter, Eccentricities and All Pairs Distances

We construct data structures for extremal and pairwise distances in dire...
research
12/28/2017

ASYMP: Fault-tolerant Mining of Massive Graphs

We present ASYMP, a distributed graph processing system developed for th...

Please sign up or login with your details

Forgot password? Click here to reset