A Conflict Sense Routing Protocol and Its Performance for Hypercubes

We propose a new switching format for multiprocessor networks, which we call conflict sense routing protocol. This switching format is a hybrid of packet and circuit switching, and combines advantages of both. We initially present the protocol in a way applicable to a general topology. We then present an implementation of this protocol for a hypercube computer and a particular routing algorithm. We also analyze the steady-state throughput of the hypercube implementation for random node-to-node communications.

[1]  Leonard Kleinrock,et al.  Virtual Cut-Through: A New Computer Communication Switching Technique , 1979, Comput. Networks.

[2]  A G Greenberg,et al.  Sharp approximation models of adaptive routing in mesh networks (preliminary report) , 1986 .

[3]  Dimitri P. Bertsekas,et al.  Data Networks , 1986 .

[4]  William J. Dally,et al.  Deadlock-Free Message Routing in Multiprocessor Interconnection Networks , 1987, IEEE Transactions on Computers.

[5]  Nicholas F. Maxemchuk,et al.  Comparison of deflection and store-and-forward techniques in the Manhattan Street and Shuffle-Exchange Networks , 1989, IEEE INFOCOM '89, Proceedings of the Eighth Annual Joint Conference of the IEEE Computer and Communications Societies.

[6]  William J. Dally,et al.  Network and processor architecture for message-driven computers , 1990 .

[7]  Nicholas F. Maxemchuk,et al.  Problems Arising from Deflection Routing: Live-lock, Lockout, Congestion and Message Reassembly , 1991 .

[8]  Jack Brassil.  Deflection routing in certain regular networks , 1992 .

[9]  Albert G. Greenberg,et al.  Deflection routing in hypercube networks , 1992, IEEE Trans. Commun..

[10]  Emmanouel A. Varvarigos.  Static and dynamic communication in parallel computing , 1992 .

[11]  Albert G. Greenberg,et al.  Sharp approximate models of deflection routing in mesh networks , 1993, IEEE Trans. Commun..

[12]  Bruce E. Hajek,et al.  On the average delay for routing subject to independent deflections , 1993, IEEE Trans. Inf. Theory.

[13]  Emmanouel A. Varvarigos,et al.  Dynamic Broadcasting in Parallel Computing , 1995, IEEE Trans. Parallel Distributed Syst..

[14]  Rene L. Cruz,et al.  Bounds on Maximum Delay in Networks with Deflection Routing , 1995, IEEE Trans. Parallel Distributed Syst..