On some simple single server models of dynamic storage
Pages 161 - 168
Abstract
We consider models of queue storage, where items arrive accordingly to a Poisson process of rate λ and each item takes up one cell in a linear array of cells, which are numbered {1, 2, 3,...}. The arriving item is placed in the lowest numbered available cell. The total service rate provided to the items is the constant μ (with ρ = λ/μ), but service may be provided simultaneously to more than one item. If there are N items stored and each is serviced at the rate μ/N, this corresponds to processor sharing (PS). We analyze two models of this type, which have been shown to provide bounds on the PS model. We shall assume that (1) the server works only on the left-most item, or (2) on the two rightmost items. The set of occupied cells at any time is {i1, i2,...,iN} where i1 < i2 <... < iN and we are interested in the wasted space (iN − N), the maximum occupied cell (iN), and the joint distribution of the wasted space and the number of items in the system (N). We study these exactly and asymptotically, especially in the heavy traffic limit where ρ ↑ 1.
References
[1]
Aldous, D., Some interesting processes arising as heavy traffic limits in an M/M/∞ storage process, Stochastic Processes and their Applications 22 (1986), 291--313.
[2]
Coffman, E. G., Jr., An introduction to combinatorial models of dynamic storage allocation, SIAM Review 25 (1983), 311--325.
[3]
Coffman, E. G., Jr., Flatto, L. and Leighton, F. T., First fit allocation of queues: tight probabilistic bounds on wasted space, Stochastic Processes and their Applications 36 (1990), 311--330.
[4]
Coffman, E. G., Jr., Flatto, L. and Leighton, F. T., First-fit storage of linear lists: tight probabilistic bounds on wasted space, Proceedings of the first annual ACM -- SIAM symposium on discrete algorithms, Society for Industrial and Applied Mathematics, Philadelphia, PA (1990), 272--279.
[5]
Coffman, E. G., Jr., Flatto, L., Mitrani, I., Shepp, L. A., and Knessl, C., Stochastic models of queue storage, Probability in the Engineering and Information Sciences 2 (1988), 75--93.
[6]
Coffman, E. G., Jr., Kadota, T. T. and Shepp, L. A., A stochastic model of fragmentation in dynamic storage allocation, SIAM J. Comput. 14 (1985), 416--425.
[7]
Coffman, E. G., Jr., Kadota, T. T. and Shepp, L. A., On the asymptotic optimality of first-fit storage allocation, IEEE Trans. on Software Eng. SE-11 (1985), 235--239.
[8]
Coffman, E. G., Jr. and Leighton, F. T., A provably efficient algorithm for dynamic storage allocation, J. Comput. System Sci. 8 (1989), 2--35.
[9]
Coffman, E. G., Jr. and Mitrani, I., Storage of the single-server queue, in Queueing Theory and its Applications, Liber Amicorum for J. W. Cohen, edited by O. J. Boxma and R. Syski, CWI Monogr., 7, North-Holland, Amsterdam (1988), 193--205.
[10]
Knessl, C., Asymptotic expansions for a stochastic model of queue storage, Annals of Applied Probability 10 (2000), 592--615.
[11]
Knessl, C., Geometrical optics and models of computer memory fragmentation, Studies in Applied Mathematics 111 (2003), 185--238.
[12]
Knessl, C., Some asymptotic results for the M/M/∞ queue with ranked servers, Queueing Systems 47 (2004), 201--250.
[13]
Kosten, L., Uber Sperrungswahrscheinlichkeiten bei Staffelschaltungen, Electra Nachrichten - Technik 14 (1937), 5--12.
[14]
Knuth, D. E., Fundamental Algorithms, Vol. 1, 3rd ed. Addison-Wesley, Reading, MA (1997).
[15]
Newell, G. F., The M/M/∞ Service System with Ranked Servers in Heavy Traffic, Springer, New York (1984).
[16]
Preater, J., A perpetuity and the M/M/∞ ranked server system, Journal of Applied Probability 34 (1997), 508--513.
[17]
Sohn, E. and Knessl, C., A simple direct solution to a storage allocation model, Applied Mathematics Letters 21 (2008), 172--175.
[18]
Sohn, E. and Knessl, C., The distribution of wasted spaces in the M/M/∞ queue with ranked servers Advances in Applied Probability 40 (2008), 835--855.
[19]
Sohn, E. and Knessl, C., Storage allocation under processor sharing I: Exact solutions and asymptotics Queueing Systems 65 (2010), 1--18. http://arxiv.org/PS_cache/arxiv/pdf/0907/0907.3693v1.pdf.
[20]
Sohn, E. and Knessl, C., Storage allocation under processor sharing II: Further asymptotic results European Journal of Applied Math, 22 (2010), 45--82 http://arxiv.org/PS_cache/arxiv/pdf/0907/0907.3683v1.pdf.
[21]
Sohn, E. and Knessl, C., Some exact and asymptotic solutions to single server models of dynamic storage submitted to Stochastic Models.
[22]
Standish, T. A., Data Structure Techniques Addison-Wesley, Reading, MA (1980).
Index Terms
- On some simple single server models of dynamic storage
Recommendations
Processor sharing for two queues with vastly different rates
We consider a 2-class queueing system, operating under a generalized processor-sharing discipline, in an asymptotic regime where the arrival and service rates of the two classes are vastly different. We use regular and singular perturbation analyses in ...
Asymptotic expansions for the conditional sojourn time distribution in the M/M/1-PS queue
We consider the M / M /1 queue with processor sharing. We study the conditional sojourn time distribution, conditioned on the customer's service requirement, in various asymptotic limits. These include large time and/or large service request, and ...
Storage allocation under processor sharing I: exact solutions and asymptotics
We consider a processor-sharing storage allocation model, which has m primary holding spaces and infinitely many secondary ones, and a single processor servicing the stored items (customers). An arriving customer takes a primary space, if one is ...
Comments
Information & Contributors
Information
Published In
August 2011
234 pages
ISBN:9781450307581
DOI:10.1145/2021216
- Conference Chairs:
- Bara Kim,
- Ho Woo Lee,
- Program Chairs:
- Gang Uk Hwang,
- Yang Woo Shin
Copyright © 2011 ACM.
Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]
Sponsors
- Korea University
In-Cooperation
Publisher
Association for Computing Machinery
New York, NY, United States
Publication History
Published: 23 August 2011
Check for updates
Author Tags
Qualifiers
- Research-article
Funding Sources
- NSA
Conference
QTNA '11
Sponsor:
QTNA '11: 6th International Conference on Queueing Theory and Network Applications
August 23 - 26, 2011
Seoul, Korea
Contributors
Other Metrics
Bibliometrics & Citations
Bibliometrics
Article Metrics
- 0Total Citations
- 54Total Downloads
- Downloads (Last 12 months)1
- Downloads (Last 6 weeks)0
Reflects downloads up to 22 Sep 2024
Other Metrics
Citations
View Options
Get Access
Login options
Check if you have access through your login credentials or your institution to get full access on this article.
Sign in