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

DOI10.1007/S11134-010-9164-3zbMATH Open1187.90103arXiv0907.3693OpenAlexW2080918453MaRDI QIDQ972685FDOQ972685

Authors: Eunju Sohn, Charles Knessl 

Publication date: 21 May 2010

Published in: Queueing Systems (Search for Journal in Brave)

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.

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

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

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)

Cites Work

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

Cited In (6)

• Stochastic Models of Queue Storage
• Some exact and asymptotic solutions to single server models of dynamic storage
• Storage allocation under processor sharing. II: Further asymptotic results
• Distribution of Processor-Sharing Customers for a Large Closed System with Multiple Classes
• Title not available (Why is that?)
• On a Problem Concerning a Central Storage Device Served by Multiple Terminals

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)