The reviewed record of science sign in
Pith

arxiv: 2403.04311 · v3 · pith:ONRYMR5M · submitted 2024-03-07 · cs.AI · cs.CL· cs.DC· cs.IR

Alto: Orchestrating Distributed Compound AI Systems with Nested Ancestry

Reviewed by Pith T0 review T1 audit T2 compute T3 formal T4 kernel pith:ONRYMR5Mrecord.jsonopen to challenge →

classification cs.AI cs.CLcs.DCcs.IR
keywords compoundaltosystemsapplicationsdataimplementationsparallelismancestry
0
0 comments X
read the original abstract

Compound AI applications chain together subcomponents such as generative language models, document retrievers, and embedding models. Applying traditional systems optimizations such as parallelism and pipelining in compound AI systems is difficult because each component has different constraints in terms of the granularity and type of data that it ingests. New data is often generated during intermediate computations, and text streams may be split into smaller, independent fragments (such as documents to sentences) which may then be re-aggregated at later parts of the computation. Due to this complexity, existing systems to serve compound AI queries do not fully take advantage of parallelism and pipelining opportunities. We present Alto, a framework that automatically optimizes execution of compound AI queries through streaming and parallelism. Bento introduces a new abstraction called nested ancestry, a metadata hierarchy that allows the system to correctly track partial outputs and aggregate data across the heterogeneous constraints of the components of compound AI applications. This metadata is automatically inferred from the programming model, allowing developers to express complex dataflow patterns without needing to reason manually about the details of routing and aggregation. Implementations of four applications in Alto outperform or match implementations in LangGraph, a popular existing AI programming framework. Alto implementations match or improve latency by between 10-30%.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.