Author:
Coffman E. G.,Flatto L.,Mitrani I.,Shepp L. A.,Knessl C.
Abstract
We study a model of queue storage in which items (requests for single units of storage) arrive in a Poisson stream and are accommodated by the first available location in a linear scan of storage. The processing times of items are independent, exponentially distributed random variables. The set of occupied locations (identified by their indices) at time t forms a random subset Si, of [1,2,.…]. The extent of the fragmentation in Si, i.e., the alternating holes and occupied regions of storage, is measured by Wt, = max St, – |St|.
Publisher
Cambridge University Press (CUP)
Subject
Industrial and Manufacturing Engineering,Management Science and Operations Research,Statistics, Probability and Uncertainty,Statistics and Probability
Reference7 articles.
1. Uber Sperrungswahrscheinlichkeiten bei Staffelschaltungen;Kosten;Electra Nachrichten-Technik,1937
2. Aldous D. , Some interesting processes arising as heavy-traffic limits in a M/M/∞ storage process, Stochastic Process Applications (to appear).
3. The M/M/∞Service System with Ranked Servers in Heavy Traffic
4. Coffman E.G. Jr & Leighton F.T. (1986). A provably efficient algorithm for dynamic storage allocation. Proceedings of the 18th ACM Symposium on Theoretical Computation, pp. 77–90.
Cited by
3 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献