5/11/2023 0 Comments Hyperswitch facebook![]() Microelectronics and Computer Technology Corperation, 9430 Research Blvd, AwLon TX, 1986. Schwetmm, CSIM Reference M.nu.l (Revision 9). ![]() Gruowald, "The performwxe of multicomputer interconnection network". for Industrial and applied Mathematics, 1987. Heath, editor, Hypcrcube Multiproceswr, pages 169-177, Society. Reed, "Benchmarking hypercube hnrdware end mftware". ![]() Class of Multistage lnterconoeetion Network," IEEE Trans. "The Mark 111 Hypercube Ensemble Concurrent Computer," Proc. Pease, "The Indirect Binary nubc Microproeerrar Array.' IEEE Trans. Seitz, "The Torus Routing Chip," Department of Computer Science, California Institute of Tecbnology, Technology Report, 5208:TR:86, January 1986. Seitz, "Deadlock-Free Message Routing in MulliproceJvlr Interconnection Networks" IEEE Trans. The simulation results also show that the hyperswitch network has equivalent latency overhead for messages with localized and antilocal destinations (i.e., less then a 25% difference between diameter 1 and 5). Detailed simulation results show that the hyperswitch network is consistently more efficient than fixed path routing for large message traffic conditions. This method can be accomplished in a static topology such as the hypercube network if the nodes have switching elements which are capable of performing the necessary routing header revisions dynamically. Here, available or fault free paths need not be specified by a source because the routing header can be modified in response to congestion or faults encountered as a path is established. The method presented in this paper realizes a kind of interconnection network, called a hyperswitch network, that is achieved using a mixture of static and dynamic topologies. The performance of a parallel algorithm depends in a large part on the interconnection topology of the multicomputer system.
0 Comments
Leave a Reply. |