Storage Allocation Under Processor Sharing I: Exact Solutions and Asymptotics

Details Storage Allocation Under Processor Sharing I: Exact Solutions and Asymptotics Storage Allocation Under Processor Sharing I: Exact Solutions and Asymptotics

2009-07-21

arxiv.org/abs/0907.3693v1

Mathematics

Classical Analysis and ODEs

40 pages, one figure, two tables

Scientific paper

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.

Affiliated with

Also associated with

No associations

Rating

Storage Allocation Under Processor Sharing I: Exact Solutions and Asymptotics does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Storage Allocation Under Processor Sharing I: Exact Solutions and Asymptotics, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Storage Allocation Under Processor Sharing I: Exact Solutions and Asymptotics will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-176515