|
| This Article | ||
| ||
| Share | ||
| Bibliographic References | ||
| Add to: | ||
 Digg  Furl  Spurl  Blink  Simpy  Google  Del.icio.us  Y!MyWeb | ||
| Search | ||
| ||
| ASCII Text | x | ||
| Emmanouel A. Varvarigos, Dimitri P. Bertsekas, "A Conflict Sense Routing Protocol and Its Performance for Hypercubes," IEEE Transactions on Computers, vol. 45, no. 6, pp. 693-703, June, 1996. | |||
| BibTex | x | ||
| @article{ 10.1109/12.506425, author = {Emmanouel A. Varvarigos and Dimitri P. Bertsekas}, title = {A Conflict Sense Routing Protocol and Its Performance for Hypercubes}, journal ={IEEE Transactions on Computers}, volume = {45}, number = {6}, issn = {0018-9340}, year = {1996}, pages = {693-703}, doi = {http://doi.ieeecomputersociety.org/10.1109/12.506425}, publisher = {IEEE Computer Society}, address = {Los Alamitos, CA, USA}, } | |||
| RefWorks Procite/RefMan/Endnote | x | ||
| TY - JOUR JO - IEEE Transactions on Computers TI - A Conflict Sense Routing Protocol and Its Performance for Hypercubes IS - 6 SN - 0018-9340 SP693 EP703 EPD - 693-703 A1 - Emmanouel A. Varvarigos, A1 - Dimitri P. Bertsekas, PY - 1996 KW - Packet and circuit switching KW - hypercubes KW - random one-to-one communications KW - throughput. VL - 45 JA - IEEE Transactions on Computers ER - | |||
Abstract—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] D. Bertzekas and R. Gallager, Data Networks, second ed. Prentice-Hall, 1992.
[2] J.T. Brassil, "Deflection Routing in Certain Regular Networks," PhD thesis, Univ. of California, San Diego, 1991.
[3] W. Dally,"Network and processor architecture for message-driven computer," R. Suaya and G. Birtwistle, eds., VLSI and Parallel Computation.San Mateo, Calif.: Morgan Kaufmann, pp. 140-218, 1990.
[4] W.J. Dally and C.L. Seitz, “Deadlock-Free Message Routing in Multiprocessor Interconnection Networks,” IEEE Trans. Computers, Vol. C-36, No. 5, May 1987, pp. 547-553.
[5] A.G. Greenberg and J. Goodman, "Sharp Approximate Models of Adaptive Routing in Mesh Networks," Teletraffic Analysis and Computer Performance Evaluation, J.W. Cohen, O.J. Boxma, and H.C. Tijms, eds., pp. 255-270.Amsterdam: Elsevier, 1988.
[6] A.G. Greenberg and B. Hajek, "Deflection Routing in Hypercube Networks," IEEE Trans. Comm., vol. 35, no. 6, pp. 1,070-1,081, June 1992.
[7] P. Kermani and L. Kleinrock, "Virtual Cut-Through: A New Computer Communicating Switching Technique," Computer Networks, vol. 3, pp. 267-286, 1979.
[8] N.F. Maxemchuk, "Comparison of Deflection and Store-and-Forward Techniques in the Manhattan Street and Shuffle-Exchange Networks," Proc. INFORCOM '89, vol. 3, pp. 800-809, Apr. 1989.
[9] N.F. Maxemchuk, "Problems Arising from Deflection Routing: Livelock, Lock-Out, Congestion and Message Reassembly," Proc. NATO Workshop Architecture and High Performance Issues of High Capacity Local and Metropolitan Area Networks,France, June 1990.
[10] E.A. Varvarigos, "Static and Dynamic Communication in Parallel Computing," PhD thesis, Dept. of EECS, Massachusetts Inst. of Tech nology, Aug. 1992.