Use this resource - and many more! - in your textbook!
AcademicPub holds over eight million pieces of educational content for you to mix-and-match your way.
Not an educator but still interested in using this content? No problem! Visit our provider's page to contact the publisher and get permission directly.
Reducing the Diameters of Computer Networks
By: Bokhari, S.H.; Raza, A.D.;
1986 / IEEE
Description
This item was taken from the IEEE Periodical ' Reducing the Diameters of Computer Networks ' 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.
Related Topics
Array Processors
Augmented Networks
Binary Trees
Diameter Reduction
Nearest-neighbor Arrays
Perfect Shuffle
Array Processors
Augmented Networks
Binary Trees
Diameter Reduction
Mapping Problem
Nearest-neighbor Arrays
Perfect Shuffle
Computing And Processing
Engineering
Mapping Problem
