Relay-Version: version B 2.10 5/3/83; site utzoo.UUCP
Posting-Version: version B 2.10.1 6/24/83; site ho95b.UUCP
Path: utzoo!watmath!clyde!burl!ulysses!mhuxr!mhuxt!houxm!ho95b!wcs
From: wcs@ho95b.UUCP (Bill Stewart)
Newsgroups: net.arch
Subject: Re: Hyperhelp, please?
Message-ID: <373@ho95b.UUCP>
Date: Tue, 16-Apr-85 22:48:54 EST
Article-I.D.: ho95b.373
Posted: Tue Apr 16 22:48:54 1985
Date-Received: Wed, 17-Apr-85 06:02:33 EST
References: <545@hou2e.UUCP>
Organization: AT&T Bell Labs, Holmdel NJ
Lines: 13

An n-hypercube can be represented as a complete set of n-vectors of 0's
and 1's (eg {0001, 0010, 0011,..}) forming the vertices, with edges
joining "adjacent" vertices, which differ in only one value.
Each vertex has n edges attached to it.  You can show that the distance
between any two vertices is <=n.

At each node, put a small computer (e.g. 68000 + 1 Meg + Floating Pt.)
with n bus controllers (typically some kind of DMA Ethernet).

You now have an array of 2**n processors, which can communicate in a
fixed  time.  You have to worry a bit about thoughput limitations at
each node, but it's real easy to distribute work to the 2**n nodes.
(A "broadcast" message can reach everyone in time n.)