BIB-VERSION:: CS-TR-v2.0
          ID:: STAN//CSL-TR-76-117
       ENTRY:: December 01, 1994
ORGANIZATION:: Stanford University, Computer Systems Laboratory
       TITLE:: AN "ALMOST-EXACT" SOLUTION TO THE N-PROCESSOR, M-MEMORY
               BANDWIDTH PROBLEM
        TYPE:: Technical Report
      AUTHOR:: Rau, B. Ramakrishna
        DATE:: June 1976
       PAGES:: 27
    ABSTRACT:: A closed-form expression is derived for the memory bandwidth
               obtained when N processors are permitted to generate requests
               to M memory modules. Use of generating functions is made, in
               a rather unusual fashion, to obtain this expressio n. The one
               approximation involved is shown to result in only a very
               small error -- and that, too, only for small values of M and
               N. This expression, which is asymptotically exact, is shown
               to be more accurate than existing closed form approximations.
               Lastly, a family of asymptotically exact solutions are
               presented which are easier to evaluate than is the first one.
               Although these expressions are less accurate than the
               previously derived closed-form solution, they are,
               nevertheless, better than existing solutions.
       NOTES:: [Adminitrivia V1/Prg/19941201]
         END:: STAN//CSL-TR-76-117