Serverless Abstractions for Short-Running, Lightweight Streams

Read full text
Authors: Natalie Carl, Niklas Kowallik, Constantin Stahl, Trever Schirmer, Tobias Pfandzelter, David Bermbach
Cited by: 0
References: 14

Abstract

Serverless computing and stream processing represent two dominant paradigms for event-driven data processing, yet both make assumptions that render them inefficient for short-running, lightweight, and unpredictable streams that require stateful processing. We propose stream functions as a novel extension of the Function-as-a-Serivce model that treat short streams as the unit of execution, state, and scaling. Stream functions process streams via an iterator-based interface, enabling seamless inter-event logic while retaining the elasticity and scale-to-zero capabilities offered by serverless platforms. Our evaluation shows that stream functions reduce the processing overhead by ~99 % compared to a mature stream process- ing engine in a video-processing use case. By providing comparable performance to serverless functions with stream semantics, stream functions provide an effective and efficient abstractions for a class of workloads underserved by existing models.

Fields of Study & Subjects

Cloud Computing and Resource Management Advanced Database Systems and Queries Parallel Computing and Optimization Techniques

Publication details

Journal / source
arXiv (Cornell University)
Publication date
3 March 2026
Language
EN
Document type
Preprint