The ratio of the extreme to the sum in a random sequence |
| |
Authors: | Peter J Downey Paul E Wright |
| |
Institution: | (1) Department of Computer Science, The University of Arizona, Tucson, AZ 85721, USA |
| |
Abstract: | For X
1 , X
2 , ..., X
n
a sequence of non-negative independent random variables with common distribution function F(t), X
(n) denotes the maximum and S
n
denotes the sum. The ratio variate R
n
= X
(n) / S
n
is a quantity arising in the analysis of process speedup and the performance of scheduling. O’Brien (J. Appl. Prob. 17:539–545,
1980) showed that as n → ∞, R
n
→0 almost surely iff is finite. Here we show that, provided either (1) is finite, or (2) 1 − F (t) is a regularly varying function with index ρ < − 1, then . An integral representation for the expected ratio is derived, and lower and upper asymptotic bounds are developed to obtain
the result. Since is often known or estimated asymptotically, this result quantifies the rate of convergence of the ratio’s expected value.
The result is applied to the performance of multiprocessor scheduling.
|
| |
Keywords: | Ratio variate Expected ratio Regular variation Extreme Maximum Asymptotic expansion Multiprocessor scheduling |
本文献已被 SpringerLink 等数据库收录! |
|