Abstract
We study the online problem of holding a number of idle threads on an application server, which we have ready for processing new requests. The problem stems from the fact that both creating/deleting and holding threads is costly, but future requests and completion times are unpredictable. We propose a practical scheme of barely random discrete algorithms with competitive ratio arbitrarily close to e/(e - 1), where e ≈ 2.718 is Euler's number. The competitive ratio is sharply concentrated for any input. The results are generalizations of the well-known result for the rent-to-buy problem.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
About this article
Cite this article
Damaschke, P. Multiple Spin-Block Decisions. Algorithmica 44, 33–48 (2006). https://doi.org/10.1007/s00453-005-1163-0
Received:
Revised:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s00453-005-1163-0