Pith. sign in

REVIEW 3 cited by

BlockLLM: Multi-tenant Finer-grained Serving for Large Language Models

Not yet reviewed by Pith; the record is open.

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 2404.18322 v2 pith:MIUL55RA submitted 2024-04-28 cs.DC

classification cs.DC
keywords blockllmblocksblockmodelsservingcomputationalefficiencyevaluation
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
read the original abstract

The increasing demand for Large Language Models (LLMs) across various applications has led to a significant shift in the design of deep learning serving systems. Deploying LLMs, particularly in multi-tenant environments, poses substantial challenges due to their high computational and memory demands. We introduce BlockLLM, a serving system that leverages component sharing among fine-tuned LLM models to provide an efficient and flexible solution for LLM workloads. BlockLLM partitions models into finer-grained blocks, enabling the reuse of model components and independent provisioning to improve computation efficiency. BlockLLM comprises an offline block zoo for storing blocks and an online system to serve requests through chains of blocks. It offers multi-fold flexibilities: (1) Adaptive assembly of blocks on-the-fly through equivalence evaluation among blocks in the zoo; (2) Per-block batch size configuration and best-effort KV cache coordination at the individual block level; (3) Speculative execution and locality-aware block placement to reduce communication costs from dynamic block resource allocation. Our evaluation shows that BlockLLM reduces memory and storage footprints and improves computational efficiency, outperforming existing serving approach in 95%ile latency and GPU utilization by 33.5% and 20.1%, respectively, with minimal impact on accuracy

Discussion (0). Sign in to comment.

Forward citations

Cited by 3 Pith papers

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score.

  1. [AAFLOW+] Stateful Operator Abstraction with Zero-Copy Distributed KV Cache Orchestration for Multi-Agent Workflows

    cs.DC 2026-07 conditional novelty 6.0 of 10

    AAFLOW+ elevates KV cache to a first-class distributed state object with materialize/transfer/fork operators, replacing text replay and cutting multi-agent TTFT up to 50× under an analytical cost model.

  2. Distributional Statistics Restore Training Data Auditability in One-step Distilled Diffusion Models

    cs.LG 2025-02 unverdicted novelty 6.0 of 10

    Kernel-based distributional discrepancy enables auditing of upstream training data in distilled one-step diffusion models by detecting preserved distributional alignment rather than per-instance memorization.

  3. FlexPipe: Adapting Dynamic LLM Serving Through Inflight Pipeline Refactoring in Fragmented Serverless Clusters

    cs.DC 2025-10 unverdicted novelty 5.0 of 10

    FlexPipe introduces runtime pipeline refactoring for LLMs to achieve higher resource efficiency and lower latency in serverless GPU clusters with fragmentation.

Pith tools