Multiple shared memory switch
One of the problems that shared memory switches have is that in order to build large switches the memory access requirements become stringent. One way to overcome this is to utilize multiple buffers which space division multiplex the input lines and thereby alleviate the memory access requirements. However, previous attempts to implement multibuffered shared memory switches have suffered from serious limitations. We describe in this work a multibuffered architecture that offers tremendous potential. It is able to fully share the buffer, it guarantees the minimum delay switching of all cells, it can accomplish multicast and multi-channel switching, it can accommodate various priorities and classes of traffic while maintaining high performance on account of very efficient buffer utilization.
Publication Source (Journal or Book title)
Proceedings of the Annual Southeastern Symposium on System Theory
Naraghi-Pour, M., Hegde, M., & Reddy, B. (1996). Multiple shared memory switch. Proceedings of the Annual Southeastern Symposium on System Theory, 50-54. Retrieved from https://repository.lsu.edu/eecs_pubs/1081