DocumentCode :
2486250
Title :
Initializing hypercubes
Author :
Katseff, Howard P.
Author_Institution :
AT&T Bell Labs., Holmdel, NJ, USA
fYear :
1989
fDate :
5-9 Jun 1989
Firstpage :
246
Lastpage :
253
Abstract :
Solutions are presented for both complete and incomplete hypercube initialization problems. Current hypercube computers require that the node number and link numbers be hard-wired into each processor and link. The author introduces algorithms for determining node and link numbers on the fly whenever the system is power up. This makes it possible to exchange or replace nodes without the need of manually setting the node number or attaching interconnect cables to particular hardware ports. One assumption made by the algorithms is that each node has a unique identifier, called the processor identifier, that is used to resolve conflicts introduced by symmetry. It is shown to be efficient for each node to know its own link count to determine a numbering. By communicating among themselves, the nodes can determine the total number of nodes in the cube
Keywords :
multiprocessing systems; algorithms; hypercube computers; hypercube initialization problems; link numbers; node number; processor identifier; Broadcasting; Cables; Hardware; Hypercubes; Joining processes; Manufacturing processes; Routing; System recovery; Topology;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
Distributed Computing Systems, 1989., 9th International Conference on
Conference_Location :
Newport Beach, CA
Print_ISBN :
0-8186-1953-8
Type :
conf
DOI :
10.1109/ICDCS.1989.37953
Filename :
37953
Link To Document :
بازگشت