SearcharxivSearch

arXiv subjects

Stefan Nastic

Publications and source records attributed to Stefan Nastic.

3 recordsLinked to original sources

Atlas: Optimizing Deployment of Compound AI Workflows on Heterogeneous Clusters

Compound AI workflows are increasingly used to serve complex AI tasks by coordinating multiple AI models and software components. This approach enables deployment flexibility, as each workflow stage can expose different model variants and resource requirements, but it also expands the deployment choices. A deployment must choose an execution plan that selects AI models for each compound AI workflow stage and places them on a heterogeneous cluster in order to satisfy SLOs. Deployment optimizers therefore need estimates to compare many candidate plans and identify feasible ones. System metrics can often be profiled per stage and composed according to workflow topology, but accuracy cannot, as errors and information loss at upstream stages affect the accuracy of downstream stages. Existing approaches either profile complete configurations end to end, which scales poorly, or use product-based accuracy surrogates that treat stages as independent and can misrank candidate plans. We introduce Atlas, a framework for optimizing compound AI deployments under SLO constraints. Atlas uses MAP, a Markovian Accuracy Predictor, to estimate configuration accuracy from local conditional accuracy transitions between adjacent workflow stages. MAP discretizes intermediate outputs into accuracy buckets and composes transition profiles according to workflow topology, giving the optimizer an accuracy estimate without exhaustive end-to-end profiling. Atlas formulates execution-plan selection as a mixed-integer linear program that maximizes predicted accuracy subject to SLOs. Across four compound AI workflows, MAP achieves Spearman correlation up to 0.947 while reducing profiling cost by up to 2.6x relative to exhaustive end-to-end profiling. Guided by MAP, the Atlas optimizer selects execution plans within 0.03 of oracle accuracy while reducing deployment cost by up to 42% through heterogeneous placement.

cs.DC

Constella: A Novel Framework for Cost-Efficient Distributed AI Inference in LEO Space Data Centers

Space data centers built from Low-Earth Orbit (LEO) satellite constellations are gaining increasing attention as a scalable computing infrastructure. With access to abundant solar energy and high-throughput optical inter-satellite links, such constellations can run AI workloads directly in orbit, enabling new in-space application types while optimizing existing ones such as Earth observation. However, managing satellite constellations that combine heterogeneous satellite roles introduces a cost optimization challenge. Determining the appropriate constellation size and satellite role ratio for a given workload is challenging, as over-provisioning processing satellites increases system cost, while under-provisioning limits system efficiency. To enable cost-efficient execution of AI inference workloads in such space data centers, we present Constella, a novel framework that leverages DNN splitting for distributed AI inference in LEO satellite constellations. Constella comprises an offline resource identifier that determines the optimal ratio of processor-to-communicator satellites and an online assignment algorithm. The algorithm utilizes constellation telemetry to adaptively route data within the constellation and to ground stations. We evaluate Constella on a real-world satellite dataset across scenarios of increasing complexity. Results demonstrate a reduction in system cost by up to two orders of magnitude and lower end-to-end inference latency by up to 2.7x compared to other approaches, while maintaining no less than 81.9% inference success rate.

cs.DC

STORE: Self-Provisioning Storage-as-a-Service for Serverless Functions

Serverless computing provides on-demand elasticity, pay-per-use, and simplified deployment. However, serverless functions are typically stateless and depend on external storage services such as object stores or databases to exchange data or support stateful functions. Provisioning and configuring these storage systems still requires manual setup or declarative scripts, introducing complexity, slowing development, and increasing the risk of configuration errors. To address these challenges, in this paper, we introduce \textsc{STORE}, a self-provisioning storage architecture for serverless functions. STORE automatically selects the optimal storage backend and eliminates developer effort through zero-touch and zero-configuration provisioning, achieved by moving the self-provisioning logic to the platform level. Our evaluation results show that STORE reduces implementation effort by up to 84% compared to well-established Infrastructure-as-Code frameworks such as Terraform and Pulumi while maintaining low latency and linear scalability under realistic workloads, without introducing performance overhead.

cs.DC