Re: Connection Machine Argument

Article View: comp.arch

Article #12771

#12771

From: Wayne A. Christopher
Date: Fri, 05 Dec 1986 23:35

6 lines
844 bytes

Maybe I'm missing something, but why is the cost of interconnect in a 
hypercube O(n^2) instead of O(n log n)?  I can understand that in 2D
you can't just connect each processor to its log n "nearest neighbors"
because they aren't so near anymore, but why should the cost be quadratic?

	Wayne

Technical Details

Message-ID: <1157@ucbcad.BERKELEY.EDU>

Path: arc1-ca.pugleaf.net!utzoo!mnetor!seismo!rutgers!ames!ucbcad!faustus

References: <745@husc6.UUCP> <246@think.COM> <827@husc6.UUCP>

Show Full Headers

Complete Article Headers

Relay-Version: version B 2.10 5/3/83; site utzoo.UUCP
Path: arc1-ca.pugleaf.net!utzoo!mnetor!seismo!rutgers!ames!ucbcad!faustus
From: faustus@ucbcad.BERKELEY.EDU (Wayne A. Christopher)
Newsgroups: comp.arch
Subject: Re: Connection Machine Argument
Message-ID: <1157@ucbcad.BERKELEY.EDU>
Date: Fri, 5-Dec-86 18:35:55 EST
Article-I.D.: ucbcad.1157
Posted: Fri Dec  5 18:35:55 1986
Date-Received: Fri, 5-Dec-86 22:51:10 EST
References: <745@husc6.UUCP> <246@think.COM> <827@husc6.UUCP>
Distribution: na
Organization: CAD Group, U.C. Berkeley
Lines: 6

Reply to Parent Message