Server allocation subject to variance constraints

DOI10.1016/0166-5316(96)00010-7MaRDI QIDQ3122408zbMATH OpenOpenAlexFDO

Authors P. S. Ansell, Kevin D. Glazebrook, I. Mitrani

Publication date 27 February 1997

Published in Performance Evaluation (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/0166-5316(96)00010-7

zbMATH Keywords

Multiclass queuesOptimizationSchedulingThreshold policies

Mathematics Subject Classification ID

Performance evaluation, queueing, and scheduling in the context of computer systems (68M20)

Recommendations

• Server allocation algorithms for tiered systems
• Computing and Combinatorics
• Allocation of distinguishable servers
• scientific article; zbMATH DE number 1194425
• Allocating servers to facilities, when demand is elastic to travel and waiting times
• Static and dynamic server allocation in systems with on/off sources
• Optimal Server Allocation in a System of Multi-Server Stations
• scientific article; zbMATH DE number 1409906
• On Server Allocation in Multiple Center Manufacturing Systems
• Optimal allocation of servers and processing time in a load balancing system

Cited in

(3)

• Allocation of service time in a two-server system
• Allocation of service time in a multiserver system
• On the Variance of the Least Attained Service Policy and Its Use in Multiple Bottleneck Networks

This page was built for publication: Server allocation subject to variance constraints

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3122408)