Title: Parallax: Efficient LLM Inference Service over Decentralized Environment
Primary area: infrastructure, software libraries, hardware, systems, etc.
Keywords: Distributed, Parallel, and Cluster Computing

Abstract: Deploying a large language model (LLM) inference service remains costly because centralized serving depends on specialized GPU clusters and high‑bandwidth interconnects in datacenters. An appealing alternative is to leverage collaborative decentralized GPU pools. However, heterogeneity in GPU and limited interconnected network bandwidth, along with potentially dynamic availability, make efficient scheduling the central challenge in this scenario. In this paper, we present Parallax, a decentralized LLM serving system that turns a pool of heterogeneous GPUs into an efficient inference platform via a two‑phase scheduler. Parallax decomposes planning into (i) model allocation, which places layers of each replica across diverse GPUs to jointly optimize latency and throughput under memory and link‑bandwidth constraints, and (ii) request‑time GPU pipeline selection, which stitches layers from different replicas into end‑to‑end execution chains that balance load and adapt to current conditions. We implement Parallax and evaluate it on open‑source LLMs deployed over real volunteer nodes. Parallax consistently reduces latency and increases throughput relative to decentralized baselines, demonstrating that principled scheduling can make volunteer compute a practical, affordable substrate for LLM inference.