Online server allocation in a server farm via benefit task systems

DOI10.1145/380752.380849MaRDI QIDQ5176012zbMATH OpenOpenAlexFDO

Authors T. S. Jayram, Robert Krauthgamer, Baruch Schieber, Maxim Sviridenko, Tracy Kimbrel

Publication date 27 February 2015

Published in Proceedings of the thirty-third annual ACM symposium on Theory of computing (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1145/380752.380849

Mathematics Subject Classification ID

Internet topics (68M11) Analysis of algorithms and problem complexity (68Q25) Resource and cost allocation (including fair division, apportionment, etc.) (91B32)

Recommendations

• scientific article; zbMATH DE number 1256657
• On-line load balancing
• New Ressults on Server Problems
• Competitive algorithms for server problems
• On-line load balancing in a hierarchical server topology

Cites work

• A constant-factor approximation algorithm for the \(k\)-median problem (extended abstract)

Cited in

(4)

• Server allocation algorithms for tiered systems
• scientific article; zbMATH DE number 2080881 (Why is no real title available?)
• Experimental and Efficient Algorithms
• Computing and Combinatorics

This page was built for publication: Online server allocation in a server farm via benefit task systems

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