Reducing the diameters of computer networks

Journal Article · Fri Aug 01 04:00:00 EDT 1986 · IEEE Trans. Comput.; (United States)

DOI:https://doi.org/10.1109/TC.1986.1676827· OSTI ID:5449307

Bokhari, S H; Raza, A D

The authors 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. 1) A tree of N nodes may be augmented such that the resulting graph has diameter no greater than 4(log/sub 2/((N + 2)/3)) - 2. This O(N/sup 2/) algorithms can be applied to any spanning tree of a connected graph to reduce the diameter of that graph to O(log N). 2) Given a binary tree T and a chain C of N nodes each, C may be augmented to produce C' so that T is a subgraph of C'. This algorithms is O(N) and may be used to produce augmented chains or rings that have diameter no greater than 2(log/sub 2/((N + 2)/3)) and are planar. 3) Any rectangular two-dimensional 4 (8) nearest-neighbor array of size N = 2/sup k/ may be augmented so that it can emulate a single-stage shuffle-exchange network of size N/2 in 3 (2) time steps.

• Research Organization: Institute for Computer Applications in Science and Engineering, Langley Research Center, Hampton, VA 23665
• OSTI ID: 5449307
• Journal Information: IEEE Trans. Comput.; (United States), Journal Name: IEEE Trans. Comput.; (United States) Vol. C-35:8; ISSN ITCOB
• Country of Publication: United States
• Language: English

Related Subjects

99 GENERAL AND MISCELLANEOUS
990200* -- Mathematics & Computers
ALGORITHMS
ARRAY PROCESSORS
COMPUTER GRAPHICS
COMPUTER NETWORKS
EQUIPMENT INTERFACES
GRAPHS
MATHEMATICAL LOGIC