Murakkab: Resource-Efficient Agentic Workflow Orchestration in Cloud Platforms
- URL: http://arxiv.org/abs/2508.18298v2
- Date: Wed, 03 Sep 2025 16:28:25 GMT
- Title: Murakkab: Resource-Efficient Agentic Workflow Orchestration in Cloud Platforms
- Abstract summary: Murakkab is a resource-efficient serving system for agentic AI applications.<n>We show that Murakkab reduces usage by up to 2.8$times$, energy consumption by 3.7$times$, and cost by 4.3$times$ while maintaining service-level objectives (SLOs)<n>Our evaluation on diverse GPU shows that Murakkab reduces GPU usage by up to 2.8$times$, energy consumption by 3.7$times$, and cost by 4.3$times$ while maintaining SLOs.
- Score: 7.6151320996822625
- License: http://creativecommons.org/licenses/by-nc-sa/4.0/
- Abstract: Agentic workflows commonly coordinate multiple models and tools with complex control logic. They are quickly becoming the dominant paradigm for AI applications. However, serving them remains inefficient with today's frameworks. The key problem is that they expose workflows as opaque sequences of model and tool calls that tightly couple agent logic with model and hardware choices. Often, these workflow components are fragmented across different entities, preventing systems from reasoning about trade-offs across accuracy, latency, energy, and cost. This leads to resource waste and degraded service-level objectives (SLOs). We present Murakkab, a resource-efficient serving system for agentic workflows. Murakkab introduces a declarative abstraction that decouples workflow specification from execution configuration. A profile-guided optimizer and adaptive runtime jointly manage the full stack: orchestrating workflow components, mapping them to models and hardware, and dynamically reconfiguring execution to satisfy user-defined SLOs. By exposing the internal structure of agentic workflows, Murakkab enables cross-layer optimization that existing frameworks and cloud schedulers cannot achieve. Our evaluation on diverse workflows shows that Murakkab reduces GPU usage by up to 2.8$\times$, energy consumption by 3.7$\times$, and cost by 4.3$\times$ while maintaining SLOs.
Related papers
- Hybrid Workflow Composition for Extreme-Scale Data Processing: A Case Study on the HL-LHC (Extended Version) [0.5156484100374059]
This paper presents a novel simulation framework for characterizing the interplay between taskset granularity and system-level constraints.<n>Results show that hybrid composition strategies can yield up to 3.8x throughput increase and a 14.9x reduction in network overhead.
arXiv Detail & Related papers (2026-07-29T13:07:31Z) - ComplexMCP: Evaluation of LLM Agents in Dynamic, Interdependent, and Large-Scale Tool Sandbox [61.862814740220806]
$textbfComplexMCP$ is a benchmark designed to evaluate agents in rigorous conditions.<n>Built on the Model Context Protocol (MCP), $textbfComplexMCP$ provides over 300 meticulously tested tools.
arXiv Detail & Related papers (2026-05-11T16:20:51Z) - AgentSlimming: Towards Efficient and Cost-Aware Multi-Agent Systems [19.373173948984626]
AgentSlimming is a plug-and-play compression framework for graph-structured multi-agent systems.<n>It reduces average token cost by up to 78.9% with negligible performance degradation, and sometimes even improves accuracy.
arXiv Detail & Related papers (2026-05-09T09:03:54Z) - Why Search When You Can Transfer? Amortized Agentic Workflow Design from Structural Priors [51.95306551061392]
Automated agentic workflow design currently relies on per-task iterative search.<n>We present SWIFT, a framework that amortizes workflow design into reusable structural priors.<n> SWIFT outperforms the state-of-the-art search-based method on five benchmarks.
arXiv Detail & Related papers (2026-04-27T21:25:00Z) - Learning to Compose for Cross-domain Agentic Workflow Generation [56.630382886594184]
We create an open-source LLM for cross-domain workflow generation.<n>We learn a compact set of reusable workflow capabilities across diverse domains.<n>Our 1-pass generator surpasses SOTA refinement baselines that consume 20 iterations.
arXiv Detail & Related papers (2026-02-11T18:27:22Z) - Do We Always Need Query-Level Workflows? Rethinking Agentic Workflow Generation for Multi-Agent Systems [72.3575737073235]
Multi-Agent Systems (MAS) solve complex tasks by coordinating multiple agents through.<n>Existing approaches generates either at task level or query level, but their relative costs and benefits remain unclear.<n>We show that query-level workflow generation is not always necessary, since a small set of top-K best task-level together already covers equivalent or even more queries.
arXiv Detail & Related papers (2026-01-16T10:05:51Z) - $A^2Flow:$ Automating Agentic Workflow Generation via Self-Adaptive Abstraction Operators [23.67659048792171]
$A2Flow$ is a framework for agentic workflow generation based on self-adaptive abstraction operators.<n>$A2Flow$ employs a three-stage operator extraction process.<n> Experiments on general and embodied benchmarks show that $A2$ achieves a 2.4% and 19.3% average performance improvement.
arXiv Detail & Related papers (2025-11-23T07:32:53Z) - DyFlow: Dynamic Workflow Framework for Agentic Reasoning [79.19799197382478]
DyFlow is a dynamic workflow generation framework that adaptively constructs and adjusts reasoning procedures based on task requirements and real-time intermediate feedback.<n>We systematically evaluate DyFlow across diverse domains, including social reasoning, biomedical tasks, mathematical problem solving, and code generation.<n>Results demonstrate that DyFlow significantly outperforms existing baselines, achieving substantial Pass@k improvements and exhibiting robust generalization across diverse domains.
arXiv Detail & Related papers (2025-09-30T10:36:23Z) - Agent WARPP: Workflow Adherence via Runtime Parallel Personalization [0.0]
Large language models (LLMs) are increasingly applied in task-oriented dialogue (TOD) systems.<n>We present Adherence via Parallel Personalization, or WARPP, a training-free, modular framework that combines multi-agent runtime with orchestration.<n>By dynamically pruning conditional branches based on user attributes, the framework reduces reasoning overhead and narrows tool selection at runtime.
arXiv Detail & Related papers (2025-07-23T23:27:49Z) - Cognify: Supercharging Gen-AI Workflows With Hierarchical Autotuning [6.328780056857816]
gen-AI that involve multiple ML model calls, tool/API calls, data retrieval, or generic code execution are often tuned manually in an ad-hoc way.<n>AdaSeek organizes workflow tuning methods into different layers based on the user-specified total search budget.<n>Cognify improves these workflow's generation quality by up to 2.8x, reduces execution monetary cost by up to 10x, and reduces end-to-end latency by 2.7x.
arXiv Detail & Related papers (2025-02-12T01:36:27Z) - Towards Resource-Efficient Compound AI Systems [4.709762596591902]
Compound AI Systems integrate multiple interacting components like models, retrievers, and external tools.<n>Current implementations suffer from inefficient resource utilization due to tight coupling between application logic and execution details.<n>We propose a declarative workflow programming model and an adaptive runtime system for dynamic scheduling and resource-aware decision-making.
arXiv Detail & Related papers (2025-01-28T02:15:34Z) - Flow: Modularized Agentic Workflow Automation [53.073598156915615]
Multi-agent frameworks powered by large language models (LLMs) have demonstrated great success in automated planning and task execution.<n>However, the effective adjustment of agentic during execution has not been well studied.<n>In this paper, we define an activity-on-vertex (AOV) graph, which allows continuous workflow refinement by agents.<n>Our proposed multi-agent framework achieves efficient concurrent execution of subtasks, effective goal achievement, and enhanced error tolerance.
arXiv Detail & Related papers (2025-01-14T04:35:37Z) - Benchmarking Agentic Workflow Generation [80.74757493266057]
We introduce WorfBench, a unified workflow generation benchmark with multi-faceted scenarios and intricate graph workflow structures.<n>We also present WorfEval, a systemic evaluation protocol utilizing subsequence and subgraph matching algorithms.<n>We observe that the generated can enhance downstream tasks, enabling them to achieve superior performance with less time during inference.
arXiv Detail & Related papers (2024-10-10T12:41:19Z) - SeBS-Flow: Benchmarking Serverless Cloud Function Workflows [51.4200085836966]
We propose the first serverless workflow benchmarking suite SeBS-Flow.<n>SeBS-Flow includes six real-world application benchmarks and four microbenchmarks representing different computational patterns.<n>We conduct comprehensive evaluations on three major cloud platforms, assessing performance, cost, scalability, and runtime deviations.
arXiv Detail & Related papers (2024-10-04T14:52:18Z)
This list is automatically generated from the titles and abstracts of the papers in this site.
This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.