Server allocation algorithms for tiered systems

DOI10.1007/S00453-007-0052-0MaRDI QIDQ2384784zbMATH OpenOpenAlexFDO

Authors Kamalika Chaudhuri, Anshul Kothari, R. Swaminathan, Yunhong Zhou, R. A. Pendavingh, Robert E. Tarjan

Publication date 10 October 2007

Published in Algorithmica (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s00453-007-0052-0

zbMATH Keywords

fully polynomial-time approximation schemeQoS metrics

Mathematics Subject Classification ID

Network design and communication in computer systems (68M10) Network protocols (68M12) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Approximation algorithms (68W25)

Recommendations

• Computing and Combinatorics
• Optimal server allocation in general, finite, multi-server queueing networks
• On-line load balancing in a hierarchical server topology
• Allocation of distinguishable servers
• Online server allocation in a server farm via benefit task systems

Cited in

(6)

• Throughput maximization of queueing networks with simultaneous minimization of service rates and buffers
• scientific article; zbMATH DE number 1629912 (Why is no real title available?)
• Server allocation subject to variance constraints
• Computing and Combinatorics
• Convex minization over \(\mathbb Z^2\)
• SLA based resource allocation policies in autonomic environments

This page was built for publication: Server allocation algorithms for tiered systems

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