This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Dynamically-Allocated Multi-Queue Buffers for VLSI Communication Switches
June 1992 (vol. 41 no. 6)
pp. 725-737

Small n*n switches are key components of interconnection networks used in multiprocessors and multicomputers. The architecture of these n*n switches, particularly their internal buffers, is critical for achieving high-throughput low-latency communication with cost-effective implementations. Several buffer structures are discussed and compared in terms of implementation complexity, inter-switch handshaking requirements, and their ability to deal with variations in traffic patterns and message lengths. A design for buffers that provide non-FIFO message handling and efficient storage allocation for variable size packets using linked lists managed by a simple on-chip controller is presented. The new buffer design is evaluated by comparing it to several alternative designs in the context of a multistage interconnection network. The modeling and simulation show that the new buffer outperforms alternative buffers and can thus be used to improve the performance of a wide variety of systems currently using less efficient buffers.

[1] D. Bersekas and R. Gallager,Data Networks. Englewood Cliffs, NJ: Prentice-Hall, 1987.
[2] W. Crowther, J. Goodhue, R. Gurwitz, R. Rettberg, and R. Thomas, "The butterfly parallel processor,"IEEE Comput. Architecture Newsletter, pp. 18-45, Sept./Dec. 1985.
[3] W. J. Dally and C. L. Seitz, "The Torus routing chip,"Distributed Comput., vol. 1, no. 4, pp. 187-196, Oct. 1986.
[4] W. J. Dally, "Fine-grain message passing concurrent computers," inProc. Third Conf. Hypercube Concurrent Comput., vol. 1, Pasadena, CA, pp. 2-12, Jan. 1988.
[5] D. M. Dias and J. R. Jump, "Packet switching interconnection networks for modular systems,"IEEE Comput. Mag., vol. 14, no. 12, pp. 43-53, Dec. 1981.
[6] G. L. Frazier and Y. Tamir, "The design and implementation of a multiqueue buffer for VLSI communication switches," inProc. Int. Conf. Comput. Design, Cambridge, MA, Oct. 1989, pp. 466-471.
[7] R. M. Fujimoto, "VLSI communication components for multicomputer networks," CS Division Rep. UCB/CSD 83/136, Univ. of California, Berkeley, CA 1983.
[8] A. Gottlieb, R. Grishman, C. P. Kruskal, K. P. McAuliffe, L. Rudolph, and M. Snir, "The NYU Ultracomputer--Designing an MIMD shared memory parallel computer,"IEEE Trans. Comput., vol. C-32, pp. 175-189, Feb. 1983.
[9] Intel Corporation,82596 User's Manual, 1989.
[10] M. I. Irland, "Buffer management in a packet switch,"IEEE Trans. Commun., vol. COM-26, pp. 328-337, Mar. 1978.
[11] M. J. Karol, M. G. Hluchyj, and S. P. Morgan, "Input vs. output queueing on a space-division packet switch," inProc. IEEE Global Telecommun. Conf., Houston, TX, Dec. 1986, pp. 659-665.
[12] P. Kermani and L. Kleinrock, "Virtual cut through: A new computer communication switching technique,"Comput. Networks, vol. 3, no. 4, pp. 267-286, Sept. 1979.
[13] M. Kumar and J. R. Jump, "Performance enhancement in buffered Delta networks using crossbar switches and multiple links,"J. Parallel Distributed Comput., vol. 1, no. 1, pp. 81-103, 1984.
[14] D. H. Lawrie, "Access and alignment of data in an array processor,"IEEE Trans. Comput., vol. C-24, pp. 1145-1155, Dec. 1975.
[15] R. J. McMillen and J. Siegel, "The hybrid cube network," inProc. Distributed Data Acquisition, Comput, Contr. Symp., Dec. 1980, pp. 11-22.
[16] G. F. Pfister and V. A. Norton, "Hot spot contention and combining in multistage interconnection networks,"IEEE Trans. Comput., vol. C-34, pp. 943-948, Oct. 1985.
[17] G. F. Pfister, W. C. Brantley, D. A. George, S. L. Harvey, W. J. Kleinfelder, K. P. McAuliffe, E. A. Melton, V. A. Norton, and J. Weiss, "The IBM Research Parallel Processor Prototype (RP3): Introduction and architecture," inProc. 1985 Int. Conf. Parallel Processing, Aug. 1985, pp. 764-771.
[18] D. A. Reed and R. M. Fujimoto,Multicomputer Networks, Message-Based Parallel Processing. Cambridge, MA: MIT Press, 1987.
[19] Y. Rimoni, I. Zisman, R. Ginosar, and U. Weiser, "Communication element for the versatile multicomputer," inProc. 15th IEEE Conf. in Israel, Apr. 1987.
[20] S. L. Scott and G. S. Sohi, "The use of feedback in multiprocessors and its application to tree saturation control,"IEEE Trans. Parallel Distributed Syst., vol. 1, pp. 385-398, Oct. 1990.
[21] C. L. Seitz, "The Cosmic Cube,"Commun. ACM, pp. 22-33, Jan. 1985.
[22] K. S. Stevens, S. V. Robinson, and A. L. Davis, "The post office--Communication support for distributed ensemble architectures," inProc. 6th Conf. Distributed Comput. Syst., Cambridge, MA, May 1986, pp. 160-166.
[23] Y. Tamir and G. L. Frazier, "High-performance multi-queue buffers for VLSI communication switches," inProc. 15th Annu. Int. Symp. Comput. Architecture, Honolulu, HI, May 1988, pp. 343-354.
[24] Y. Tamir and J. C. Cho, "Design and implementation of high-speed asynchronous communication ports for VLSI multicomputer nodes," inProc. Int. Symp. Circuits and Syst., Espoo, Finland, June 1988, pp. 805-809.
[25] Y. Tamir and Y. F. Turner, "High-performance adaptive routing in multicomputers using dynamic virtual circuits," inProc. 6th Distributed Memory Comput. Conf., Portland, OR Apr. 1991, pp. 404-411.
[26] C. Whitby-Strevens, "The Transputer," inProc. 12th Annu. Symp. Comput. Architecture, Boston, MA, June 1985, pp. 292-300.
[27] H. Yoon, K. Y. Lee, and M. T. Liu, "Performance analysis of multibuffered packet-switching networks in multiprocessor systems,"IEEE Trans. Comput., vol. 39, pp. 319-327, Mar. 1990.

Index Terms:
multi-queue buffers; interconnection networks; multiprocessors; low-latency communication; buffer structures; implementation complexity; buffer storage; multiprocessor interconnection networks.
Citation:
Y. Tamir, G.L. Frazier, "Dynamically-Allocated Multi-Queue Buffers for VLSI Communication Switches," IEEE Transactions on Computers, vol. 41, no. 6, pp. 725-737, June 1992, doi:10.1109/12.144624
Usage of this product signifies your acceptance of the Terms of Use.