Pith. sign in

Dirigent: Lightweight Serverless Orchestration

1 Pith paper cite this work. Polarity classification is still indexing.

1 Pith paper citing it
abstract

While Function as a Service (FaaS) platforms can initialize function sandboxes on worker nodes in 10-100s of milliseconds, the latency to schedule functions in real FaaS clusters can be orders of magnitude higher. The current approach of building FaaS cluster managers on top of legacy orchestration systems (e.g., Kubernetes) leads to high scheduling delays when clusters experience high sandbox churn, which is common for FaaS. Generic cluster managers use many hierarchical abstractions and internal components to manage and reconcile cluster state with frequent persistent updates. This becomes a bottleneck for FaaS since the cluster state frequently changes as sandboxes are created on the critical path of requests. Based on our root cause analysis of performance issues in existing FaaS cluster managers, we propose Dirigent, a clean-slate system architecture for FaaS orchestration with three key principles. First, Dirigent optimizes internal cluster manager abstractions to simplify state management. Second, it eliminates persistent state updates on the critical path of function invocations, leveraging the fact that FaaS abstracts sandbox locations from users to relax exact state reconstruction guarantees. Finally, Dirigent runs monolithic control and data planes to minimize internal communication overheads and maximize throughput. We compare Dirigent to state-of-the-art FaaS platforms and show that Dirigent reduces 99th percentile per-function scheduling latency for a production workload by 2.79x compared to AWS Lambda. Dirigent can spin up 2500 sandboxes per second at low latency, which is 1250x more than Knative.

citation-role summary

background 1

citation-polarity summary

fields

cs.DC 1

years

2025 1

verdicts

CONDITIONAL 1

roles

background 1

polarities

unclear 1

representative citing papers

MQFQ-Sticky: Fair Queueing For Serverless GPU Functions

cs.DC · 2025-07-11 · conditional · novelty 6.0

MQFQ-Sticky applies multi-queue fair queuing and anticipatory scheduling to GPU serverless functions, reporting 2x-20x latency reductions and fairer GPU service than FCFS, batching, or SJF policies.

citing papers explorer

Showing 1 of 1 citing paper.

  • MQFQ-Sticky: Fair Queueing For Serverless GPU Functions cs.DC · 2025-07-11 · conditional · none · ref 23 · internal anchor

    MQFQ-Sticky applies multi-queue fair queuing and anticipatory scheduling to GPU serverless functions, reporting 2x-20x latency reductions and fairer GPU service than FCFS, batching, or SJF policies.