Queueing models for systems with synchronization constraints

The authors consider queueing that occur naturally in the study of a class of resource-sharing problems under synchronization constraints such as resequencing and fork-join primitives. These queueing models are amenable to a representation in terms of a state recursion. The proposed methods of analysis are complementary and draw on classical ideas of queuing theory as well as on mathematical tools from the theory of stochastic ordering and ergodic theory. The state recursion is at the center of all aspects of the analysis, be it for developing the exact solutions, obtaining bounds on system performance or establishing the stability conditions. The ideas are illustrated on simple models of resequencing and fork-join synchronization, which emphasis put on deriving computable bounds on the performance measures. >

[1]  Ward Whitt,et al.  Minimizing Delays in the GI/G/1 Queue , 1984, Oper. Res..

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

[3]  Armand M. Makowski,et al.  Simple computable bounds for the fork-join queue , 1985 .

[4]  B. A. Rogozin.  Some Extremal Problems in the Theory of Mass Service , 1966 .

[5]  Bruce E. Hajek,et al.  The Proof of a Folk Theorem on Queuing Delay with Applications to Routing in Networks , 1983, JACM.

[6]  Erol Gelenbe,et al.  An End-to-End Approach to the Resequencing Problem , 1984, JACM.

[7]  François Baccelli,et al.  A Queueing Model of Timestamp Ordering in a Distributed System , 1987, International Symposium on Computer Modeling, Measurement and Evaluation.

[8]  Tak-Shing Peter Yum,et al.  Resequencing of messages in communication networks , 1986, IEEE Trans. Commun..

[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]  Asser N. Tantawi,et al.  Performance Analysis of Parallel Processing Systems , 1988, IEEE Trans. Software Eng..

[11]  Don Towsley,et al.  Bounds for Two Server Fork-Join Queueing Systems , 1987 .

[12]  Philip A. Bernstein,et al.  Concurrency Control in Distributed Database Systems , 1986, CSUR.

[13]  Gérard Le Lann,et al.  Algorithms for Distributed Data-Sharing Systems Which Use Tickets , 1978, Berkeley Workshop.

[14]  H. Robbins,et al.  A class of dependent random variables and their maxima , 1978 .

[15]  R. M. Loynes,et al.  The stability of a queue with non-independent inter-arrival and service times , 1962, Mathematical Proceedings of the Cambridge Philosophical Society.

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

[17]  L. Flatto,et al.  Two parallel queues created by arrivals with two demands. II , 1984 .

[18]  Brigitte Plateau,et al.  Queueing Analysis of a Reordering Issue , 1982, IEEE Transactions on Software Engineering.

[19]  Per Brinch Hansen,et al.  The programming language Concurrent Pascal , 1975, IEEE Transactions on Software Engineering.

[20]  J. Kiefer,et al.  On the theory of queues with many servers , 1955 .

[21]  David R. Jacobs,et al.  Stochastic Order Relationships Between GI/G/k Systems , 1972 .

[22]  K. Mani Chandy,et al.  Open, Closed, and Mixed Networks of Queues with Different Classes of Customers , 1975, JACM.

[23]  Alain Jean-Marie.  Load Balancing in a System of Two Queues with Resequencing , 1987, Performance.