mlsanityData to 7 Oct 2026

Alto: Orchestrating Distributed Compound AI Systems with Nested Ancestry

arXiv 2403.04311 ↗First posted 7 Mar 2024cs.AI cs.CL cs.DCcited by 7

Not on the map. Why?

Abstract (arXiv)

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%.

Key facts. Cited by 7 papers in the map (data through 7 Oct 2026). Builds on 17 of its 52 references that are in the map. First posted on arXiv 7 Mar 2024.

Builds on

17 of 52 references.

References · 17

  1. 2020Retrieval-Augmented Generation for Knowledge-Intensive NLP Taskscited by 9,160
  2. 2022ReAct: Synergizing Reasoning and Acting in Language Modelscited by 8,355
  3. 2023Efficient Memory Management for Large Language Model Serving with PagedAttentioncited by 5,767
  4. 2016SQuAD: 100,000+ Questions for Machine Comprehension of Textcited by 4,115
  5. 2016Efficient and robust approximate nearest neighbor search using Hierarchical Navigable Small World graphscited by 853
  6. 2023DSPy: Compiling Declarative Language Model Calls into Self-Improving Pipelinescited by 803
  7. 2017Ray: A Distributed Framework for Emerging AI Applicationscited by 516
  8. 2024Taming Throughput-Latency Tradeoff in LLM Inference with Sarathi-Servecited by 507
  9. 2021ColBERTv2: Effective and Efficient Retrieval via Lightweight Late Interactioncited by 464
  10. 2021SPLADE: Sparse Lexical and Expansion Model for First Stage Rankingcited by 283
  11. 2023FacTool: Factuality Detection in Generative AI -- A Tool Augmented Framework for Multi-Task and Multi-Domain Scenarioscited by 247
  12. 2019Multi-Stage Document Ranking with BERTcited by 200
5 more
  1. 2024Assisting in Writing Wikipedia-like Articles From Scratch with Large Language Modelscited by 150
  2. 2023Complex Claim Verification with Evidence Retrieved in the Wildcited by 110
  3. 2023BOLAA: Benchmarking and Orchestrating LLM-augmented Autonomous Agentscited by 83
  4. 2023WikiChat: Stopping the Hallucination of Large Language Model Chatbots by Few-Shot Grounding on Wikipediacited by 67
  5. 2024InferCept: Efficient Intercept Support for Augmented Large Language Model Inferencecited by 32

Built on by

Cited by year (2026 to 7 Oct)

Citing papers per year: 2024: 1; 2025: 4; 2026: 2.

7 papers.