Instruct: Identify the main and secondary category of Arxiv papers based on the titles and abstracts
Query: 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 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.

16
The categories of this paper are: stat
22
The categories of this paper are: chao-dyn
17
The categories of this paper are: q-fin
26
The categories of this paper are: bayes-an
37
The categories of this paper are: supr-con
13
The categories of this paper are: quant-ph
20
The categories of this paper are: acc-phys
36
The categories of this paper are: cmp-lg
5
The categories of this paper are: gr-qc
8
The categories of this paper are: hep-ex
12
The categories of this paper are: nucl-th
6
The categories of this paper are: astro-ph
19
The categories of this paper are: eess
34
The categories of this paper are: chem-ph
24
The categories of this paper are: dg-ga
32
The categories of this paper are: atom-ph