Pith. sign in

REVIEW 1 cited by

Stability for Two-class Multiserver-job Systems

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 2010.00631 v1 pith:AGRT5T2U submitted 2020-10-01 cs.PF

classification cs.PF
keywords jobsmultiserver-jobserversservicedistinctfcfssystemsystems
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
read the original abstract

Multiserver-job systems, where jobs require concurrent service at many servers, occur widely in practice. Much is known in the dropping setting, where jobs are immediately discarded if they require more servers than are currently available. However, very little is known in the more practical setting where jobs queue instead. In this paper, we derive a closed-form analytical expression for the stability region of a two-class (non-dropping) multiserver-job system where each class of jobs requires a distinct number of servers and requires a distinct exponential distribution of service time, and jobs are served in first-come-first-served (FCFS) order. This is the first result of any kind for an FCFS multiserver-job system where the classes have distinct service distributions. Our work is based on a technique that leverages the idea of a "saturated" system, in which an unlimited number of jobs are always available. Our analytical formula provides insight into the behavior of FCFS multiserver-job systems, highlighting the huge wastage (idle servers while jobs are in the queue) that can occur, as well as the nonmonotonic effects of the service rates on wastage.

Discussion (0). Continue with ORCID to comment.

Forward citations

Cited by 1 Pith paper

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

  1. Improving Multiresource Job Scheduling with Markovian Service Rate Policies

    cs.PF 2024-12 conditional novelty 7.0 of 10

    A new class of Markov-chain-driven scheduling policies for multiresource jobs is throughput-optimal and admits additively tight mean response time bounds under preemptive, non-preemptive, and setup-time preemption models.

Pith tools