A sequenced hypercube topology for a massively-parallel database computer
Naphtali David Rishe, Doron Tal, Qi Li
Abstract
Naphtali David Rishe, Doron Tal, Qi Li
Abstract
The architecture of a massively parallel multiprocessor and multi-disk database computer is presented. The interprocessor communication network has a hypercube topology. The architecture requires selection of linear ordering of the nodes of a network of processors. A method is developed and presented which can arrange the nodes in sequences efficient for management of data. Among the features of the produced sequences is that the size of the sequence can grow as the size of the hypercube grows, without changing the existing subsequences.>
OpenAlex reports 2 citations for this work. Citation counts describe recorded attention and do not establish research quality.
A contribution statement is not available in the OpenAlex record.
Method details are not available in the OpenAlex metadata.
Findings are not separately available in the OpenAlex metadata.
Limitations are not available in the OpenAlex metadata.
Application details are not available in the OpenAlex metadata.
The architecture of a massively parallel multiprocessor and multi-disk database computer is presented. The interprocessor communication network has a hypercube topology. The architecture requires selection of linear ordering of the nodes of a network of processors. A method is developed and presented which can arrange the nodes in sequences efficient for management of data. Among the features of the produced sequences is that the size of the sequence can grow as the size of the hypercube grows, without changing the existing subsequences.>
Key concepts: Hypercube, Massively parallel, Computer science, Parallel computing, Network topology, Architecture, Sequence (biology), Topology (electrical circuits)