Multiple Spin-Block Decisions

Authors:
Peter Damaschke
Affiliations:
-
Venue:
ISAAC '99 Proceedings of the 10th International Symposium on Algorithms and Computation
Year:
1999

Citing 4
Cited 1

Efficient on-line call control algorithms

Journal of Algorithms
TCP dynamic acknowledgment delay (extended abstract): theory and practice

STOC '98 Proceedings of the thirtieth annual ACM symposium on Theory of computing
Online computation and competitive analysis

Online computation and competitive analysis
Non-clairvoyant scheduling

SODA '93 Proceedings of the fourth annual ACM-SIAM Symposium on Discrete algorithms

Online Strategies for Backups

CIAC '00 Proceedings of the 4th Italian Conference on Algorithms and Complexity

Quantified Score

Hi-index	0.00

Visualization

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