arXiv (All)
open access
Load Balancing with Partial Queue Information - Threshold Optimality and Indexability
We consider the problem of load balancing in a system with one dispatcher and $N$ parallel servers. The dispatcher must select one server to dispatch new jobs at every time-step and each server buffers incoming jobs in a queue. However, the dispatcher does not know the servers' backlogs and must mak
Conceptio Open Archive
Analyze & explore related research in Conceptio
Connect this record directly into your research workflow or AI agent. Explore citations across open repositories, query full text, and export structured proof bundles.
This document is indexed with metadata only: full text is not available in the archive for this record. Open the official source ↗
Related documents
- An interpretable universal bound for multiserver queues via a leave-one-out technique#665551
- An interpretable universal bound for multiserver queues via a leave-one-out technique#664051
- PASCAL: A Phase-Aware Shared-Cache Model for Parallel Scans#997387
- The Flow Queue CoDel Packet Scheduler and Active Queue Management Algorithm#502813
- Same Book, Different Fills: Partial Identification of FIFO Execution from Aggregate Order Books#1013694
Record · ID 1064763
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Bring this data into your agent: Connect via MCP or API · 20 free credits to start · no card required
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive