The Stochastic Rendezvous Network Model for Performance of Synchronous Client-Server-like Distributed Software

  • Authors:

  • C. Murray Woodside;John E. Neilson;Dorina C. Petriu;Shikharesh Majumdar

  • Affiliations:

  • Carleton Univ., Ottawa, Ont., Canada;Carleton Univ., Ottawa, Ont., Canada;Carleton Univ., Ottawa, Ont., Canada;Carleton Univ., Ottawa, Ont., Canada

  • Venue:
  • IEEE Transactions on Computers
  • Year:
  • 1995

Quantified Score

Hi-index 14.98

Visualization

Abstract

Distributed or parallel software with synchronous communication via rendezvous is found in client-server systems and in proposed open distributed systems, in implementation environments such as Ada, V, remote procedure call systems, in transputer systems, and in specification techniques such as CSP, CCS and LOTOS. The delays induced by rendezvous can cause serious performance problems, which are not easy to estimate using conventional models which focus on hardware contention, or on a restricted view of the parallelism which ignores implementation constraints. Stochastic rendezvous networks are queueing networks of a new type which have been proposed as a modelling framework for these systems. They incorporate the two key phenomena of included service and a second phase of service. This paper extends the model to also incorporate different services or entries associated with each task. Approximations to arrival-instant probabilities are employed with a mean-value analysis framework, to give approximate performance estimates. The method has been applied to moderately large industrial software systems