A new ordering for stochastic majorization: theory and applications

In this paper, we develop a unified approach for stochastic load balancing on various multiserver systems. We expand the four partial orderings defined in Marshall and Olkin, by defining a new ordering based on the set of functions that are symmetric, L-subadditive and convex in each variable. This new partial ordering is shown to be equivalent to the previous four orderings for comparing deterministic vectors but differs for random vectors. Sample-path criteria and a probability enumeration method for the new stochastic ordering are established and the ordering is applied to various fork-join queues, routing and scheduling problems. Our results generalize previous work and can be extended to multivariate stochastic majorization which includes tandem queues and queues with finite buffers.

[1]  Cheng-Shang Chang,et al.  On the optimality of LEPT and cµ rules for machines in parallel , 1992, Journal of Applied Probability.

[2]  David D. Yao,et al.  Spatiotemporal Convexity of Stochastic Processes and Applications , 1992, Probability in the Engineering and Informational Sciences.

[3]  Michael Pinedo,et al.  Stochastic convexity for multidimensional processes and its applications , 1991 .

[4]  M. Vidyasagar,et al.  Comments on "A state-space interpretation of simultaneous stabilization , 1991 .

[5]  Michael Pinedo,et al.  Monotonicity results for queues with doubly stochastic Poisson arrivals: Ross's conjecture , 1991, Advances in Applied Probability.

[6]  D. Yao,et al.  Strong stochastic convexity: closure properties and applications , 1991, Journal of Applied Probability.

[7]  Michael Pinedo,et al.  Bounds and inequalities for single server loss systems , 1990, Queueing Syst. Theory Appl..

[8]  Michael Pinedo,et al.  Integration of Discrete-Time Correlated Markov Processes in a TDM System , 1990, Probability in the Engineering and Informational Sciences.

[9]  F. Baccelli,et al.  The fork-join queue and related systems with synchronization constraints: stochastic ordering and computable bounds , 1989, Advances in Applied Probability.

[10]  Thomas Kämpke,et al.  Optimal Scheduling of Jobs with Exponential Service Times on Identical Parallel Processors , 1989, Oper. Res..

[11]  J. Shanthikumar,et al.  Stochastic convexity and its applications , 1988, Advances in Applied Probability.

[12]  Asser N. Tantawi,et al.  Approximate Analysis of Fork/Join Synchronization in Parallel Queues , 1988, IEEE Trans. Computers.

[13]  J. Shanthikumar.  Stochastic majorization of random variables by proportional equilibrium rates , 1987 .

[14]  Ronald Menich,et al.  Optimally of shortest queue routing for dependent service stations , 1987, 26th IEEE Conference on Decision and Control.

[15]  T. Kämpke.  On the optimality of static priority policies in stochastic scheduling on parallel machines , 1987, Journal of Applied Probability.

[16]  Tomasz Rolski,et al.  Upper Bounds for Single Server Queues with Doubly Stochastic Poisson Arrivals , 1986, Math. Oper. Res..

[17]  Ward Whitt,et al.  Comparison methods for queues and other stochastic models , 1986 .

[18]  Moshe Shaked,et al.  Some partial orderings of exchangeable random variables by positive dependence , 1985 .

[19]  N. L. Lawrie,et al.  Comparison Methods for Queues and Other Stochastic Models , 1984 .

[20]  Richard R. Weber,et al.  Technical Note - A Note on Waiting Times in Single Server Queues , 1983, Oper. Res..

[21]  Kevin Mahon,et al.  Deterministic and Stochastic Scheduling , 1983 .

[22]  T. Rolski.  Queues with non-stationary input stream: Ross's conjecture , 1981, Advances in Applied Probability.

[23]  Ludo van der Heyden,et al.  Scheduling Jobs with Exponential Processing and Arrival Times on Identical Processors so as to Minimize the Expected Makespan , 1981, Math. Oper. Res..

[24]  Shun-Chen Niu.  Bounds for the expected delays in some tandem queues , 1980, Journal of Applied Probability.

[25]  Anthony Ephremides,et al.  A simple dynamic routing problem , 1980 .

[26]  Michael Pinedo,et al.  Scheduling tasks with exponential service times on non-identical processors to minimize various cost functions , 1980, Journal of Applied Probability.

[27]  I. Olkin,et al.  Inequalities: Theory of Majorization and Its Applications , 1980 .

[28]  R. Weber.  On the optimal assignment of customers to parallel servers , 1978, Journal of Applied Probability.

[29]  Yossef Rinott.  Multivariate majorization and rearrangement inequalities with some applications to probability and statistics , 1973 .

[30]  D. Walkup,et al.  Association of Random Variables, with Applications , 1967 .

[31]  Armand M. Makowski,et al.  Convexity Results for Parallel Queues with Bernoulli Routing , 1990 .

[32]  P. Tsoucas.  Stochastic Monotonicity of the Output Process of Parallel Queues. , 1989 .

[33]  Armand M. Makowski,et al.  Queueing models for systems with synchronization constraints , 1989, Proc. IEEE.

[34]  Levent Gün,et al.  Performance Evaluation and Optimization of Parallel Systems with Synchronization , 1989 .

[35]  Moshe Shaked,et al.  Temporal stochastic convexity and concavity , 1987 .

[36]  Ward Whitt,et al.  Deciding Which Queue to Join: Some Counterexamples , 1986, Oper. Res..

[37]  Tapani Lehtonen,et al.  On the optimality of the shortest line discipline , 1984 .

[38]  Gideon Weiss,et al.  Multiserver Stochastic Scheduling , 1982 .

[39]  Greg N. Frederickson,et al.  Sequencing Tasks with Exponential Service Times to Minimize the Expected Flow Time or Makespan , 1981, JACM.

[40]  J. Keilson.  Markov Chain Models--Rarity And Exponentiality , 1979 .

[41]  H. Teicher,et al.  Probability theory: Independence, interchangeability, martingales , 1978 .