Performance analysis of a rate control throttle where tokens and jobs queue

Abstract

An expanded implementation of a rate control throttle where an arriving job queues in a finite buffer where the token bank is empty is examined. It is shown that the throughput and blocking of jobs depends on the capacity of the job buffer and the capacity of the token bank only via the sum of the two capacities, and not on their individual values. The job buffer is not needed to enhance the robustness of the throughput of the throttle to changes in the exogeneous job arrival rate; however, a job buffer, along with a token bank and with adjustable buffer capacities, does have the potential to shape the departure process and to adapt between a delay control and a work rejection control.>

Cite this work

No public copy is stored for this record, so only the metadata is cited.

Stored only when both papers are in the corpus — 32 citations exist upstream.

Papers that cite the same references — the relational fallback while embeddings are still backfilling.