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). All of the spaces are numbered and ordered. An arriving customer takes the lowest available space. We define...

Full description

Saved in:
Bibliographic Details
Main Authors Sohn, Eunju, Knessl, Charles
Format Journal Article
LanguageEnglish
Published 21.07.2009
Subjects
Mathematics - Classical Analysis and ODEs
Online AccessGet full text

Cover

More Information
Summary: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.
DOI:10.48550/arxiv.0907.3693