Multiple Spin-Block Decisions
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).
Unable to display preview. Download preview PDF.
- 1.A. Borodin, R. El-Yaniv: Online Computation and Competitive Analysis, Cambridge Univ. Press 1998Google Scholar
- 2.T. Damaschke: private communication on the business component software project DamBuKoGoogle Scholar
- 3.D.R. Dooly, S.A. Goldman, S.D. Scott: TCP dynamic acknowledgment delay: theory and practice, 30th STOC’98, 389–398Google Scholar
- 4.J.A. Garay, I.S. Gopal, S. Kutten, Y. Mansour, M. Yung: Efficient on-line call control algorithms, J. of Algorithms 23 (1997), 180–194Google Scholar
- 5.A.R. Karlin, M.S. Manasse, L.A. McGeoch, S. Owicki: Competitive randomized algorithms for non-uniform problems, Algorithmica 11 (1994), 542–571Google Scholar
- 6.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 1995Google Scholar
- 7.R. Motwani, S. Phillips, E. Torng: Nonclairvoyant scheduling, Theor. Comp. Sc. 130 (1994), 17–47; extended abstract in: 4th SODA’93, 422-431Google Scholar