Report Number: CSL-TR-86-306
Institution: Stanford University, Computer Systems Laboratory
Title: Queueing network models for parallel processing of task
Author: Mak, Victor W.K.
Date: September 1986
Abstract: Computer performance modeling of possibly complex computations running on highly concurrent systems is considered. Earlier works in this area either dealt with a very simple program structure or resulted in methods with exponential complexity. A computationally efficient approximate solution method is developed to compute the performance measures for series-parallel-reducible task systems using queueing network models. Numerical results for a number of test cases are presented and compared to those of simulations.