arXiv (All)
open access
Stability of Fork-Join Systems with Redundancy and Heterogeneous Servers
We consider the stability problem of fork-join systems with redundancy (FJR) and heterogeneous servers under both static and dynamic capacity-allocation policies. In an $(n,k)$ FJR system, each arriving job is split into $n$ independent tasks, with one task assigned to each of $n$ parallel servers.
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
- Impossibility of Distributed Consensus with One Faulty Process#326668
- Efficiency and Cost Alignment in Batched LLM Serving via Resource-Fair Scheduling#423922
- D4a.2 Further exploration of balancing options and system design#313944
- SafarDB: FPGA-Accelerated Distributed Transactions via Replicated Data Types#821805
- Fast Multidimensional Approximate Agreement with Optimal Resilience Using Ball Validity#984510
Record · ID 987003
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