Path: utzoo!utgpu!news-server.csri.toronto.edu!rpi!zaphod.mps.ohio-state.edu!swrinde!elroy.jpl.nasa.gov!zardoz.cpd.com!dhw68k!stein
From: stein@dhw68k.cts.com (Rick 'Transputer' Stein)
Newsgroups: comp.arch
Subject: Re: Networking for Distributed Computing
Summary: Reference wanted for Kung's "law"
Message-ID: <1991Apr12.015503.28001@dhw68k.cts.com>
Date: 12 Apr 91 01:55:03 GMT
References: <1991Apr5.182853.20728@hubcap.clemson.edu> <12606@pt.cs.cmu.edu>
Organization: Wolfskill & Dowling residence; Anaheim, CA (USA)
Lines: 13

In article <12606@pt.cs.cmu.edu> lindsay@gandalf.cs.cmu.edu (Donald Lindsay) writes:
>Kung's "Law" says that if you scale node performance, without
>increasing communication bandwidth, then nodes require more memory:
>N, N^2 or even N^3 as much, depending on algorithm. Before choosing a
>communications setup, I would want to study your application's
>characteristics, and work up some ratios and granularities.
>-- 
>Don		D.C.Lindsay .. temporarily at Carnegie Mellon Robotics
Can you provide a literature reference on this "law?"
-- 
Richard M. Stein (aka, Rick 'Transputer' Stein)
Sole proprietor of Rick's Software Toxic Waste Dump and Kitty Litter Co.
"You build 'em, we bury 'em." uucp: ...{spsd, zardoz, felix}!dhw68k!stein