Title :
Approximate MVA from Markov model of software client/server systems
Author :
Petriu, D.C. ; Woodside, C.M.
Author_Institution :
Dept. of Syst. & Comput. Eng., Carleton Univ., Ottawa, Ont., Canada
Abstract :
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
Keywords :
Markov processes; multiprogramming; performance evaluation; probability; queueing theory; stochastic processes; FIFO queueing; Markov chain model; approximate mean value analysis; arrival instant probabilities; client tasks; intertask communication; iterative decomposition algorithm; multitasking parallel software; performance models; server task; software bottleneck; software client/server systems; stochastic rendezvous networks; Computer networks; Hardware; Interference; Iterative algorithms; Network servers; Performance analysis; Queueing analysis; Software systems; Stochastic systems; Systems engineering and theory;
Conference_Titel :
Parallel and Distributed Processing, 1991. Proceedings of the Third IEEE Symposium on
Conference_Location :
Dallas, TX
Print_ISBN :
0-8186-2310-1
DOI :
10.1109/SPDP.1991.218224
