DocumentCode
1154181
Title
Reducing the Diameters of Computer Networks
Author
Bokhari, Shahid H. ; Raza, A.D.
Author_Institution
Institute for Computer Applications in Science and Engineering, Langley Research Center
Issue
8
fYear
1986
Firstpage
757
Lastpage
761
Abstract
We discuss three methods of reducing the diameters of computer networks by adding additional processor to processor links under the constraint that no more than one I/O port be added to each processor. This is equivalent to adding edges to a given graph under the constraint that the degree of any node be increased, at most, by one.
Keywords
Array processors; augmented networks; binary trees; diameter reduction; mapping problem; nearest-neighbor arrays; perfect shuffle; Binary trees; Circuit synthesis; Computer networks; Cranes; Electrons; Large scale integration; Logic circuits; Multiplexing; Signal processing; Tree graphs; Array processors; augmented networks; binary trees; diameter reduction; mapping problem; nearest-neighbor arrays; perfect shuffle;
fLanguage
English
Journal_Title
Computers, IEEE Transactions on
Publisher
ieee
ISSN
0018-9340
Type
jour
DOI
10.1109/TC.1986.1676827
Filename
1676827
Link To Document