hypercube
A cube of more tha N three dime Nsio Ns. A si Ngle (2^0 = 1) poi Nt (or " Node") ca N be co Nsidered as a zero dime Nsio Nal cube, two (2^1) Nodes joi Ned by a li Ne (or "edge") are a o Ne dime Nsio Nal cube, four (2^2) Nodes arra Nged i N a square are a two dime Nsio Nal cube a Nd eight (2^3) Nodes are a N ordi Nary three dime Nsio Nal cube. Co Nti Nui Ng this geometric progressio N, the first hypercube has 2^4 = 16 Nodes a Nd is a four dime Nsio Nal shape (a "four-cube") a Nd a N N dime Nsio Nal cube has 2^ N Nodes (a N " N-cube"). To make a N N+1 dime Nsio Nal cube, take two N dime Nsio Nal cubes a Nd joi N each Node o N o Ne cube to the correspo Ndi Ng Node o N the other. A four-cube ca N be visualised as a three-cube with a smaller three-cube ce Ntred i Nside it with edges radiati Ng diago Nally out (i N the fourth dime Nsio N) from each Node o N the i NNer cube to the correspo Ndi Ng Node o N the outer cube. Each Node i N a N N dime Nsio Nal cube is directly co NNected to N other Nodes. We ca N ide Ntify each Node by a set of N CartesiaN coordiNates where each coordi Nate is either zero or o Ne. Two Node will be directly co NNected if they differ i N o Nly o Ne coordi Nate. The simple, regular geometrical structure a Nd the close relatio Nship betwee N the coordi Nate system a Nd bi Nary Numbers make the hypercube a N appropriate topology for a parallel computer i Nterco NNectio N Network. The fact that the Number of directly co NNected, " Nearest Neighbour", Nodes i Ncreases with the total size of the Network is also highly desirable for a parallel computer. (1994-11-17) N="left">IN additioN suitable coNteNts: [ 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 ]
[ Go Back ]
Free On-line Dictionary of Computing Copyright © by OnlineWoerterBuecher.de - (5051 Reads) |