Multiple Spin-Block Decisions |
| |
Authors: | Peter Damaschke |
| |
Affiliation: | (1) School of Computer Science and Engineering, Chalmers University, 41296 Goteborg, Sweden |
| |
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. |
| |
Keywords: | Multithreading Spin--block problem Online algorithms Randomization Implementation\linebreak[4] issues |
本文献已被 SpringerLink 等数据库收录! |
|