BIB-VERSION:: CS-TR-v2.0
          ID:: STAN//CSL-TR-86-306
       ENTRY:: November 08, 1994
ORGANIZATION:: Stanford University, Computer Systems Laboratory
       TITLE:: QUEUEING NETWORK MODELS FOR PARALLEL PROCESSING OF TASK
               SYSTEMS: AN OPERATIONAL APPROACH
        TYPE:: Technical Report
      AUTHOR:: Mak, Victor W.K.
        DATE:: September 1986
       PAGES:: 27
    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.
       NOTES:: [Adminitrivia V1/Prg/19941108]
         END:: STAN//CSL-TR-86-306