DocumentCode
3064616
Title
A Strategy for Routing Messages Between Elements in a Hypercube with Faulty Links
Author
Gichev, Dinko
Author_Institution
Burgas Free University, San Stefano, Bulgaria
fYear
2005
fDate
05-08 Dec. 2005
Firstpage
708
Lastpage
710
Abstract
An algorithm for routing messages between processing elements in a multiprocessor system is proposed. As a basic architecture an n-dimensional hypercube is applied. Only one of the processors in the hypercube is connected with an external user. The external machine is called host processor. Bidirectional one-port links, some of them faulty at same time are applied. The algorithm can be applied on an arbitrary connected multiprocessor system.
Keywords
Electronic mail; Hamming distance; Hypercubes; Multiprocessing systems; Registers; Routing; Terminology;
fLanguage
English
Publisher
ieee
Conference_Titel
Parallel and Distributed Computing, Applications and Technologies, 2005. PDCAT 2005. Sixth International Conference on
Print_ISBN
0-7695-2405-2
Type
conf
DOI
10.1109/PDCAT.2005.49
Filename
1579012
Link To Document