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 di- screte algorithms with competitive ratio arbitrarily close to e/(e − 1).
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
A. Borodin, R. El-Yaniv: Online Computation and Competitive Analysis, Cambridge Univ. Press 1998
T. Damaschke: private communication on the business component software project DamBuKo
D.R. Dooly, S.A. Goldman, S.D. Scott: TCP dynamic acknowledgment delay: theory and practice, 30th STOC’98, 389–398
J.A. Garay, I.S. Gopal, S. Kutten, Y. Mansour, M. Yung: Efficient on-line call control algorithms, J. of Algorithms 23 (1997), 180–194
A.R. Karlin, M.S. Manasse, L.A. McGeoch, S. Owicki: Competitive randomized algorithms for non-uniform problems, Algorithmica 11 (1994), 542–571
P. Krishnan, P.M. Long, J.S. Vitter: Adaptive disk spindown via optimal rent-to-buy in probabilistic environments, Algorithmica, to appear. Extended abstract in: 12th Int. Conf. on Machine Learning, Morgan Kaufmann 1995
R. Motwani, S. Phillips, E. Torng: Nonclairvoyant scheduling, Theor. Comp. Sc. 130 (1994), 17–47; extended abstract in: 4th SODA’93, 422-431
Author information
Authors and Affiliations
Rights and permissions
Copyright information
© 1999 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Damaschke, P. (1999). Multiple Spin-Block Decisions. In: Algorithms and Computation. ISAAC 1999. Lecture Notes in Computer Science, vol 1741. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-46632-0_4
Download citation
DOI: https://doi.org/10.1007/3-540-46632-0_4
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-66916-6
Online ISBN: 978-3-540-46632-1
eBook Packages: Springer Book Archive