Storage allocation under processor sharing. I: Exact solutions and asymptotics

DOI10.1007/S11134-010-9164-3MaRDI QIDQ972685zbMATH OpenOpenAlexFDO

Authors Eunju Sohn, Charles Knessl

Publication date 21 May 2010

Published in Queueing Systems (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/0907.3693

zbMATH Keywords

asymptoticsheavy trafficprocessor sharingstorage allocationjoint probability distribution of occupied spacesranked server models

Mathematics Subject Classification ID

Queues and service in operations research (90B22) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20)

Abstract: 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). All of the spaces are numbered and ordered. An arriving customer takes the lowest available space. We define the traffic intensity rho to be lambda/mu where lambda is the customers' arrival rate and mu is the service rate of the processor. We study the joint probability distribution of the numbers of occupied primary and secondary spaces. For 0 < rho < 1, we obtain the exact solutions for m = 1 and m = 2. For arbitrary m we study the problem in the asymptotic limit rho -> 1 with m fixed. We also develop a semi-numerical semi-analytic method for computing the joint distribution.

Recommendations

• Storage allocation under processor sharing. II: Further asymptotic results
• Some exact and asymptotic solutions to single server models of dynamic storage
• A diffusion limit for a finite capacity storage allocation model
• On a storage allocation model with finite capacity
• Asymptotic analysis of a storage allocation model with finite capacity: joint distribution

Cites work

• scientific article; zbMATH DE number 879787 (Why is no real title available?)
• A Stochastic Model of Fragmentation in Dynamic Storage Allocation
• A perpetuity and the M/M/∞ ranked server system
• A provably efficient algorithm for dynamic storage allocation
• A simple direct solution to a storage allocation model
• Asymptotic expansions for a stochastic model of queue storage
• Calculating the equilibrium distribution in level dependent quasi-birth-and-death processes
• First-fit allocation of queues: Tight probabilistic bounds on wasted space
• Geometrical Optics and Models of Computer Memory Fragmentation
• Some asymptotic results for the \(M/M/\infty\) queue with ranked servers
• Some interesting processes arising as heavy traffic limits in an M/M/\(\infty\) storage process
• Storage allocation under processor sharing. II: Further asymptotic results
• The M/M/\(\infty\) service system with ranked servers in heavy traffic. With a preface by Franz Ferschl
• The distribution of wasted spaces in the M/M/∞ queue with ranked servers

Cited in

(9)

• On a Problem Concerning a Central Storage Device Served by Multiple Terminals
• scientific article; zbMATH DE number 7042402 (Why is no real title available?)
• Distribution of Processor-Sharing Customers for a Large Closed System with Multiple Classes
• A diffusion limit for a finite capacity storage allocation model
• On a storage allocation model with finite capacity
• Some exact and asymptotic solutions to single server models of dynamic storage
• Storage allocation under processor sharing. II: Further asymptotic results
• Asymptotic analysis of a storage allocation model with finite capacity: marginal and conditional distributions
• Stochastic Models of Queue Storage

This page was built for publication: Storage allocation under processor sharing. I: Exact solutions and asymptotics

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q972685)