Off-campus UNL users: To download campus access dissertations, please use the following link to log into our proxy server with your NU ID and password. When you are done browsing please remember to return to this page and log out.
Non-UNL users: Please talk to your librarian about requesting this dissertation through interlibrary loan.
EXPLICIT SOLUTIONS OF GENERALIZED M/G/C//N SYSTEMS INCLUDING AN ANALYSIS OF THE TRANSIENT BEHAVIOR (QUEUEING LOOPS)
Abstract
Explicit solutions for generalized M/G/C//N queueing loops where the outside server is load dependent are found, using the recently developed matrix algebraic technique. Efficient recursive algorithms to compute various properties of such systems are outlined. Time and space computational complexity of these algorithms are discussed. These solutions are extended to open systems. The above technique is also used to find some non-steady state properties such as: e.g., mean time for the queue length to drop by one; mean time for the queue to drain; and mean time for queue length to grow to a given length. An application of the generalized M/G/C//N queueing loops to interactive (time-sharing) multiprogrammed computer systems is discussed with respect to response time and throughput. A program has been written to evaluate performance measures and compare these measures with those of the 'product form solution' and its natural approximation.
Subject Area
Computer science
Recommended Citation
TEHRANIPOUR, ABOLFAZL, "EXPLICIT SOLUTIONS OF GENERALIZED M/G/C//N SYSTEMS INCLUDING AN ANALYSIS OF THE TRANSIENT BEHAVIOR (QUEUEING LOOPS)" (1983). ETD collection for University of Nebraska-Lincoln. AAI8412323.
https://digitalcommons.unl.edu/dissertations/AAI8412323