Skip to main content
SpringerLink
Log in

Multiple Spin-Block Decisions

  • Conference paper
  • First Online:
Book cover Algorithms and Computation (ISAAC 1999)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 1741))

Included in the following conference series:

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).

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. A. Borodin, R. El-Yaniv: Online Computation and Competitive Analysis, Cambridge Univ. Press 1998

    Google Scholar 

  2. T. Damaschke: private communication on the business component software project DamBuKo

    Google Scholar 

  3. D.R. Dooly, S.A. Goldman, S.D. Scott: TCP dynamic acknowledgment delay: theory and practice, 30th STOC’98, 389–398

    Google 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–194

    Google Scholar 

  5. A.R. Karlin, M.S. Manasse, L.A. McGeoch, S. Owicki: Competitive randomized algorithms for non-uniform problems, Algorithmica 11 (1994), 542–571

    Google 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 1995

    Google Scholar 

  7. R. Motwani, S. Phillips, E. Torng: Nonclairvoyant scheduling, Theor. Comp. Sc. 130 (1994), 17–47; extended abstract in: 4th SODA’93, 422-431

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Theoretische Informatik II, Fern Universität, 58084, Hagen, Germany

    Peter Damaschke

Authors
  1. Peter Damaschke
    View author publications

    You can also search for this author in PubMed Google Scholar

Rights and permissions

Reprints 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

Publish with us

Policies and ethics

Search

Navigation