The Community for Technology Leaders
RSS Icon
Subscribe
Issue No.01 - January-June (2013 vol.12)
pp: 9-12
ABSTRACT
1/2 network capacity is often believed to be the limit of worst-case throughput for mesh networks. However, this letter provides a new worst-case throughput bound, which is higher than 1/2 network capacity, for odd radix two-dimensional mesh networks. In addition, we propose a routing algorithm called U2TURN that can achieve this worst-case throughput bound. U2TURN considers all routing paths with at most 2 turns and distributes the traffic loads uniformly in both X and Y dimensions. Theoretical analysis and simulation results show that U2TURN outperforms existing routing algorithms in worst-case throughput. Moreover, U2TURN achieves good average-throughput at the expense of approximately 1.5x minimal average hop count.
INDEX TERMS
Routing, Throughput, Algorithm design and analysis, Mesh networks, Computer architecture, Parallel algorithms,Worst-case analysis, On-chip interconnection networks, Routing protocols, Interconnection architectures
CITATION
Guang Sun, Chia-Wei Chang, B. Lin, "A New Worst-Case Throughput Bound for Oblivious Routing in Odd Radix Mesh Network", IEEE Computer Architecture Letters, vol.12, no. 1, pp. 9-12, January-June 2013, doi:10.1109/L-CA.2012.5
REFERENCES
1. W. Dally and B. Towles., Principles and practices of interconnection networks. Morgan Kaufmann, 2004.
2. S. Guang,L. Shijun,J. Depeng,L. Yong,S. Li,Y. Zhang,, and Z. Lieguang., Performance-aware hybrid algorithm for mapping ips onto mesh-based network on chip. IEICE TRANSACTIONS on Information and Systems, 94(5): 1000-1007, 2011.
3. T. Nesson and S. Johnsson., Romm routing on mesh and torus networks. In Proceedings of the seventh annual ACM symposium on Parallel algorithms and architectures. pages 275-287. ACM, 1995.
4. D. Seo,A. Ali,W. Lim,N. Rafique,, and M. Thottethodi., Near-optimal worst-case throughput routing for two-dimensional mesh networks. In ACM SIGARCH Computer Architecture News, volume 33, pages 432-443. IEEE Computer Society, 2005.
5. H. Sullivan and T. Bashkow., A large scale, homogeneous, fully distributed parallel machine, i. In ACM SIGARCH Computer Architecture News, volume 5, pages 105-117. ACM, 1977.
6. R. Sunkam Ramanujam and B. Lin., Randomized partially-minimal routing on three-dimensional mesh networks. Computer Architecture Letters, 7(2): 37-40, 2008.
7. R. Sunkam Ramanujam and B. Lin., Weighted random oblivious routing on torus networks. In Proceedings of the 5th ACM/IEEE Symposium on Architectures for Networking and Communications Systems, pages 104-112. ACM, 2009.
8. B. Towles and W. Dally., Worst-case traffic for oblivious routing functions. In Proceedings of the fourteenth annual ACM symposium on Parallel algorithms and architectures, pages 1-8. ACM, 2002.
9. B. Towles,W. Dally,, and S. Boyd., Throughput-centric routing algorithm design. In Proceedings of the fifteenth annual ACM symposium on Parallel algorithms and architectures, pages 200-209. ACM, 2003.
10. L. Valiant and G. Brebner., Universal schemes for parallel communication. In Proceedings of the thirteenth annual ACM symposium on Theory of computing, pages 263-277. ACM, 1981.
84 ms
(Ver 2.0)

Marketing Automation Platform Marketing Automation Tool