Instruct: Identify the main and secondary category of Arxiv papers based on the titles and abstracts
Query: A General Theory of Computational Scalability Based on Rational
  Functions   The universal scalability law of computational capacity is a rational
function C_p = P(p)/Q(p) with P(p) a linear polynomial and Q(p) a second-degree
polynomial in the number of physical processors p, that has been long used for
statistical modeling and prediction of computer system performance. We prove
that C_p is equivalent to the synchronous throughput bound for a
machine-repairman with state-dependent service rate. Simpler rational
functions, such as Amdahl's law and Gustafson speedup, are corollaries of this
queue-theoretic bound. C_p is further shown to be both necessary and sufficient
for modeling all practical characteristics of computational scalability.

6
The categories of this paper are: astro-ph
16
The categories of this paper are: stat
34
The categories of this paper are: chem-ph
11
The categories of this paper are: hep-lat
36
The categories of this paper are: cmp-lg
14
The categories of this paper are: math-ph
0
The categories of this paper are: hep-ph
20
The categories of this paper are: acc-phys
27
The categories of this paper are: comp-gas
12
The categories of this paper are: nucl-th
9
The categories of this paper are: nlin
30
The categories of this paper are: q-alg
33
The categories of this paper are: plasm-ph
3
The categories of this paper are: physics
17
The categories of this paper are: q-fin
25
The categories of this paper are: patt-sol