A cu
Be of more than three dimensions. A single (2^0 = 1) point (or "node") can
Be considered as a zero dimensional cu
Be, two (2^1) nodes joined
By a line (or "edge") are a one dimensional cu
Be, four (2^2) nodes arranged in a square are a two dimensional cu
Be and eight (2^3) nodes are an ordinary three dimensional cu
Be. Continuing this geometric progression, the first hypercu
Be has 2^4 = 16 nodes and is a four dimensional shape (a "four-cu
Be") and an N dimensional cu
Be has 2^N nodes (an "N-cu
Be"). To make an N+1 dimensional cu
Be, take two N dimensional cu
Bes and join each node on one cu
Be to the corresponding node on the other. A four-cu
Be can
Be visualised as a three-cu
Be with a smaller three-cu
Be centred inside it with edges radiating diagonally out (in the fourth dimension) from each node on the inner cu
Be to the corresponding node on the outer cu
Be. Each node in an N dimensional cu
Be is directly connected to N other nodes. We can identify each node
By a set of N
Cartesian coordinates where each coordinate is either zero or one. Two node will
Be directly connected if they differ in only one coordinate. The simple, regular geometrical structure and the close relationship
Between the coordinate system and
Binary num
Bers make the hypercu
Be an appropriate topology for a parallel computer interconnection network. The fact that the num
Ber of directly connected, "nearest neigh
Bour", nodes increases with the total size of the network is also highly desira
Ble for a
parallel computer. (1994-11-17)
In addition suitaBle contents:<Br>[ 2 ] [ = ] [ ad ] [ ag ] [ al ] [ am ] [ an ] [ app ] [ ar ] [ arc ] [ as ] [ at ] [ B ] [ Be ] [ Bi ] [ Binary ] [ Bo ] [ By ] [ C ] [ ca ] [ Cartesian coordinates ] [ ch ] [ cl ] [ co ] [ com ] [ computer ] [ con ] [ connect ] [ cons ] [ coordinate ] [ cr ] [ cu ] [ cuBe ] [ de ] [ diff ] [ ding ] [ du ] [ E ] [ ec ] [ ed ] [ ee ] [ eg ] [ er ] [ es ] [ et ] [ fact ] [ fi ] [ file ] [ fo ] [ for ] [ fr ] [ ge ] [ gh ] [ gl ] [ gr ] [ gu ] [ gy ] [ h ] [ hat ] [ hr ] [ ht ] [ id ] [ iff ] [ il ] [ in ] [ inc ] [ int ] [ io ] [ ir ] [ is ] [ it ] [ jo ] [ join ] [ ke ] [ la ] [ Lex ] [ li ] [ line ] [ lose ] [ ls ] [ ly ] [ ma ] [ mall ] [ metric ] [ mo ] [ mod ] [ module ] [ mp ] [ N ] [ na ] [ nc ] [ ne ] [ net ] [ network ] [ ng ] [ nl ] [ nn ] [ no ] [ node ] [ ns ] [ nu ] [ numBers ] [ om ] [ op ] [ ordinate ] [ pa ] [ parallel computer ] [ pe ] [ ph ] [ pl ] [ point ] [ pr ] [ query ] [ range ] [ rc ] [ re ] [ relation ] [ ro ] [ ru ] [ se ] [ set ] [ sh ] [ si ] [ sm ] [ so ] [ st ] [ struct ] [ su ] [ sy ] [ system ] [ T ] [ th ] [ to ] [ topology ] [ tr ] [ tw ] [ ua ] [ um ] [ vi ] [ zero ]