English

Serverless Abstractions for Short-Running, Lightweight Streams

Distributed, Parallel, and Cluster Computing 2026-03-04 v1

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.

Keywords

Cite

@article{arxiv.2603.03089,
  title  = {Serverless Abstractions for Short-Running, Lightweight Streams},
  author = {Natalie Carl and Niklas Kowallik and Constantin Stahl and Trever Schirmer and Tobias Pfandzelter and David Bermbach},
  journal= {arXiv preprint arXiv:2603.03089},
  year   = {2026}
}

Comments

Accepted for publication at the 4th Workshop on SErverless Systems, Applications and MEthodologies (SESAME '26)

R2 v1 2026-07-01T11:01:16.142Z