By Topic

Approximate MVA from Markov model of software client/server systems

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
Petriu, D.C. ; Dept. of Syst. & Comput. Eng., Carleton Univ., Ottawa, Ont., Canada ; Woodside, C.M.

Stochastic rendezvous networks (SRVN) are performance models for multitasking parallel software with intertask communication via rendezvous (RV). The paper describes an approximation for the arrival instant probabilities for a class of simple client/server SRVN, based on a rigorous analysis of the Markov chain model describing the interference of different client tasks contending for a single server task with FIFO queueing discipline. The algorithm for a simple client/server SRVN is integrated into an iterative decomposition algorithm for complex SRVN models with any number of servers and multi-layered service. Finally, the SRVN model is used to study an example of software bottleneck

Published in:

Parallel and Distributed Processing, 1991. Proceedings of the Third IEEE Symposium on

Date of Conference:

2-5 Dec 1991