The Community for Technology Leaders
RSS Icon
Issue No.03 - March (2009 vol.20)
pp: 316-330
Maurizio Palesi , Univeristy of Catania, Catania
Rickard Holsmark , Jönköping University, Jönköping
Shashi Kumar , Jönköping University , Jönköping
Vincenzo Catania , University of Catania, Catania
In this paper we present a methodology to develop efficient and deadlock free routing algorithms for Network-on-Chip (NoC) platforms which are specialized for an application or a set of concurrent applications. The proposed methodology, called Application Specific Routing Algorithm (APSRA), exploits the application specific information regarding pairs of cores which communicate and other pairs which never communicate in the NoC platform to maximize communication adaptivity and performance. The methodology also exploits the known information regarding concurrency/non-concurrency of communication transactions among cores for the same purpose. We demonstrate, through analysis of adaptivity as well as simulation based evaluation of latency and throughput, that algorithms produced by the proposed methodology give significantly higher performance as compared to other deadlock free algorithms for both homogeneous as well as heterogeneous 2D mesh topology NoC systems. For example, for homogeneous mesh NoC, APSRA results in approximately 30% less average delay as compared to Odd-Even algorithm just below saturation load. Similarly the saturation load point for APSRA is significantly higher as compared to other adaptive routing algorithms for both homogeneous and non-homogeneous mesh networks.
Performance Analysis and Design Aids, Interconnections (Subsystems), I/O and Data Communications
Maurizio Palesi, Rickard Holsmark, Shashi Kumar, Vincenzo Catania, "Application Specific Routing Algorithms for Networks on Chip", IEEE Transactions on Parallel & Distributed Systems, vol.20, no. 3, pp. 316-330, March 2009, doi:10.1109/TPDS.2008.106
[1] A. Ivanov and G.D. Micheli, “The Network-on-Chip Paradigm in Practice and Research,” IEEE Design and Test of Computers, vol. 22, no. 5, pp. 399-403, Sept.-Oct. 2005.
[2] S. Kumar, A. Jantsch, J.-P. Soininen, M. Forsell, M. Millberg, J. Oberg, K. Tiensyrja, and A. Hemani, “A Network on Chip Architecture and Design Methodology,” Proc. IEEE CS Ann. Symp. VLSI, p. 117, 2002.
[3] W.J. Dally and B. Towles, “Route Packets, Not Wires: On-Chip Interconnection Networks,” Proc. 38th Design Automation Conf. (DAC '01), pp. 684-689, 2001.
[4] F. Karim, A. Nguyen, and S. Dey, “An Interconnect Architecture for Networking Systems on Chips,” IEEE Micro, vol. 22, no. 5, pp. 36-45, Sept.-Oct. 2002.
[5] P.P. Pande, C. Grecu, A. Ivanov, and R. Saleh, “Design of a Switch for Network on Chip Applications,” Proc. IEEE Int'l Symp. Circuits and Systems (ISCAS '03), vol. 5, pp. 217-220, May 2003.
[6] T. Bjerregaard and S. Mahadevan, “A Survey of Research and Practices of Network-on-Chip,” ACM Computing Surveys, vol. 38, no. 1, pp. 1-51, 2006.
[7] P.P. Pande, C. Grecu, M. Jones, A. Ivanov, and R. Saleh, “Performance Evaluation and Design Trade-Offs for Network-on-Chip Interconnect Architectures,” IEEE Trans. Computers, vol. 54, no. 8, pp. 1025-1040, Aug. 2005.
[8] D. Linder and J. Harden, “An Adaptive and Fault-Tolerant Wormhole Routing Strategy for k-Ary n-Cubes,” IEEE Trans. Computers, vol. 40, no. 1, pp. 2-12, Jan. 1991.
[9] C.J. Glass and L.M. Ni, “The Turn Model for Adaptive Routing,” J. Assoc. for Computing Machinery, vol. 41, no. 5, pp. 874-902, Sept. 1994.
[10] A.A. Chien and J.H. Kim, “Planar-Adaptive Routing: Low-Cost Adaptive Networks for Multiprocessors,” J. ACM, vol. 42, no. 1, pp. 91-123, Jan. 1995.
[11] J. Upadhyay, V. Varavithya, and P. Mohapatra, “A Traffic-Balanced Adaptive Wormhole Routing Scheme for Two-Dimensional Meshes,” IEEE Trans. Computers, vol. 46, no. 2, pp. 190-197, Feb. 1997.
[12] G.-M. Chiu, “The Odd-Even Turn Model for Adaptive Routing,” IEEE Trans. Parallel and Distributed Systems, vol. 11, no. 7, pp. 729-738, July 2000.
[13] J. Hu and R. Marculescu, “DyAD—Smart Routing for Networks-on-Chip,” Proc. 41st Design Automation Conf. (DAC '04), pp.260-263, June 2004.
[14] A. Hansson, K. Goossens, and A. Rădulescu, “A Unified Approach to Mapping and Routing on a Network-on-Chip for Both Best-Effort and Guaranteed Service Traffic,” VLSI Design, vol. 2007, 2007.
[15] T. Skeie, O. Lysne, J. Flich, P. Lépez, A. Robles, and J. Duato, “LASH-TOR: A Generic Transition-Oriented Routing Algorithm,” Proc. 10th Int'l Conf. Parallel and Distributed Systems (ICPADS '04), pp. 595-604, 2004.
[16] S. Kaist, Bone: Network on Chip, Real Chip Implementation,, 2008.
[17] F. Angiolini, P. Meloni, S.M. Carta, L. Raffo, and L. Benini, “A Layout-Aware Analysis of Networks-on-Chip and Traditional Interconnects for MPSoCs,” IEEE Trans. Computer Aided Design of Integrated Circuits and Systems, vol. 26, no. 3, pp. 421-434, Mar. 2007.
[18] T. Ahonen, D.A. Sigüenza-Tortosa, H. Bin, and J. Nurmi, “Topology Optimization for Application-Specific Networks-on-Chip,” Proc. Sixth Int'l Workshop System-Level Interconnect Prediction (SLIP '04), pp. 53-60, 2004.
[19] A. Pullini, F. Angiolini, P. Meloni, D. Atienza, S. Murali, L. Raffo, G.D. Micheli, and L. Benini, “NoC Design and Implementation in65 nm Technology,” Proc. First Int'l Symp. Networks-on-Chip (NOCS '07), pp. 273-282, 2007.
[20] M. Dall'Osso, G. Biccari, L. Giovannini, D. Bertozzi, and L. Benini, “$\times$ Pipes: A Latency Insensitive Parameterized Network-on-Chip Architecture for Multi-Processor SoCs,” Proc. 21st Int'l Conf. Computer Design (ICCD '03), pp. 536-541, 2003.
[21] S. Stergiou, F. Angiolini, S. Carta, L. Raffo, D. Bertozzi, and G.D. Micheli, “$\times$ Pipes Lite: A Synthesis Oriented Design Library for Networks on Chips,” Proc. Conf. Design, Automation and Test in Europe (DATE '05), vol. 2, pp. 1188-1193, 2005.
[22] A. Mello, L. Tedesco, N. Calazans, and F. Moraes, “Virtual Channels in Networks on Chip: Implementation and Evaluation on Hermes NoC,” Proc. 18th Symp. Integrated Circuits and System Design, pp. 178-183, 2005.
[23] J.-P. Soininen and H. Heusala, “Networks on Chip,” A Design Methodology for NoC-Based Systems, chapter 2, pp. 19-38, Kluwer Academic Publishers, 2004.
[24] J. Duato, “A New Theory of Deadlock-Free Adaptive Routing in Wormhole Networks,” IEEE Trans. Parallel and Distributed Systems, vol. 4, no. 12, pp. 1320-1331, Dec. 1993.
[25] J. Duato, “A Necessary and Sufficient Condition for Deadlock-Free Routing in Wormhole Networks,” IEEE Trans. Parallel and Distributed Systems, vol. 6, no. 10, pp. 1055-1067, Oct. 1995.
[26] T.T. Ye, L. Benini, and G.D. Micheli, “Packetization and Routing Analysis of On-Chip Multiprocessor Networks,” J. System Architectures, vol. 50, no. 2-3, pp. 81-104, 2004.
[27] E. Nilsson, M. Millberg, J. Oberg, and A. Jantsch, “Load Distribution with the Proximity Congestion Awareness in a Network on Chip,” Proc. Conf. Design, Automation and Test in Europe (DATE '03), pp. 1126-1127, 2003.
[28] G. Ascia, V. Catania, M. Palesi, and D. Patti, “Implementation and Analysis of a New Selection Strategy for Adaptive Routing in Networks-on-Chip,” IEEE Trans. Computers, vol. 57, no. 6, pp.809-820, June 2008.
[29] R. Holsmark and S. Kumar, “Design Issues and Performance Evaluation of Mesh NoC with Regions,” Proc. 23rd IEEE Norchip Conf., pp. 40-43, Nov. 2005.
[30] A. Jouraku, M. Koibuchi, and H. Amano, “L-Turn Routing: An Adaptive Routing in Irregular Networks,” Technical Report 59, IEICE, Apr. 2001.
[31] L. Cherkasova, V. Kotov, and T. Rokicki, “Fibre Channel Fabrics: Evaluation and Design,” Proc. 29th Hawaii Int'l Conf. System Sciences (HICSS '96), pp. 53-58, 1996.
[32] J.C. Sancho, A. Robles, and J. Duato, “A Flexible Routing Scheme for Networks of Workstations,” Proc. Third Int'l Symp. High Performance Computing (ISHPC '00), pp. 260-267, 2000.
[33] A. Mejia, J. Flich, J. Duato, S.-A. Reinemo, and T. Skeie, “Segment-Based Routing: An Efficient Fault-Tolerant Routing Algorithm for Meshes and Tori,” Proc. 20th Int'l Parallel and Distributed Processing Symp. (IPDPS '06), Apr. 2006.
[34] W.J. Dally and C. Seitz, “Deadlock-Free Message Routing in Multiprocessor Interconnection Networks,” IEEE Trans. Computers, vol. C, no. 36, pp. 547-553, 1987.
[35] J.-M. Chang and M. Pedram, “Codex-Dp: Co-Design of Communicating Systems Using Dynamic Programming,” IEEE Trans. Computer-Aided Design of Integrated Circuits and Systems, vol. 19, no. 7, pp. 732-744, July 2002.
[36] G. Ascia, V. Catania, and M. Palesi, “Multi-Objective Mapping for Mesh-Based NoC Architectures,” Proc. Second IEEE/ACM/IFIP Int'l Conf. Hardware/Software Codesign and System Synthesis, pp. 182-187, Sept. 2004.
[37] S. Murali and G.D. Micheli, “Bandwidth-Constrained Mapping of Cores onto NoC Architectures,” Proc. Conf. Design, Automation, and Test in Europe (DATE '04), pp. 896-901, Feb. 2004.
[38] J. Hu and R. Marculescu, “Energy- and Performance-Aware Mapping for Regular NoC Architectures,” IEEE Trans. Computer-Aided Design of Integrated Circuits and Systems, vol. 24, no. 4, pp.551-562, Apr. 2005.
[39] U.Y. Ogras and R. Marculescu, “It's a Small World After All: NoC Performance Optimization via Long-Range Link Insertion,” IEEE Trans. Very Large Scale Integration Systems, vol. 14, no. 7, pp. 693-706, July 2006.
[40] S. Murali, D. Atienza, L. Benini, and G.D. Micheli, “A Multi-Path Routing Strategy with Guaranteed In-Order Packet Delivery and Fault-Tolerance for Networks on Chip,” Proc. 43rd Design Automation Conf. (DAC '06), pp. 845-848, July 2006.
[41] J. Duato, O. Lysne, R. Pang, and T.M. Pinkston, “Part I: A Theory for Deadlock-Free Dynamic Network Reconfiguration,” IEEE Trans. Parallel and Distributed Systems, vol. 16, no. 5, pp. 412-427, May 2005.
[42] O. Lysne, T.M. Pinkston, and J. Duato, “Part II: A Methodology for Developing Deadlock-Free Dynamic Network Reconfiguration Processes,” IEEE Trans. Parallel and Distributed Systems, vol. 16, no. 5, pp. 428-443, May 2005.
[43] M. Palesi, S. Kumar, R. Holsmark, and V. Catania, “Exploiting Communication Concurrency for Efficient Deadlock Free Routing in Reconfigurable NoC Platforms,” Proc. 21st Int'l Parallel and Distributed Processing Symp. (IPDPS '07), pp. 1-8, Mar. 2007.
[44] T. Skeie, O. Lysne, and H. Theiss, “Layered Shortest Path (LASH) Routing in Irregular System Area Networks,” Proc. 16th Int'l Parallel and Distributed Processing Symp. (IPDPS '02), pp. 162-169, 2002.
[45] K. Aoyama and A.A. Chien, “The Cost of Adaptivity and Virtual Lanes in a Wormhole Router,” J. VLSI Design, vol. 2, no. 4, pp.315-333, 1995.
[46] A.S. Vaidya, A. Sivasubramaniam, and C.R. Das, “Impact of Virtual Channels and Adaptive Routing on Application Performance,” IEEE Trans. Parallel and Distributed Systems, vol. 12, no. 2, pp. 223-237, Feb. 2001.
[47] T. Marescaux and H. Corporaal, “Introducing the SuperGT Network-on-Chip; SuperGT QoS: More Than Just GT,” Proc. 44th Design Automation Conf. (DAC '07), pp. 116-121, 2007.
[48] K. Goossens, J. Dielissen, and A. Rădulescu, “The Æthereal Network on Chip: Concepts, Architectures, and Implementations,” IEEE Design and Test of Computers, vol. 22, no. 5, pp. 21-31, Sept.-Oct. 2005.
[49] R.V. Boppana and S. Chalasani, “A Comparison of Adaptive Wormhole Routing Algorithms,” Proc. 20th Ann. Int'l Symp. Computer Architecture (ISCA '93), pp. 351-360, May 1993.
[50] F. Fazzino, M. Palesi, and D. Patti, Noxim: Network-on-Chip Simulator, http:/, 2008.
[51] G. Varatkar and R. Marculescu, “Traffic Analysis for On-Chip Networks Design of Multimedia Applications,” Proc. 39th Design Automation Conf. (DAC '02), pp. 510-517, June 2002.
[52] D.R. Avresky, V. Shubranov, R. Horst, and P. Mehra, “Performance Evaluation of the ServerNetR SAN under Self-Similar Traffic,” Proc. 13th Int'l Parallel Processing Symp./10th Symp. Parallel and Distributed Processing (IPPS/SPDP '99), pp. 143-149, Apr. 1999.
[53] M. Monchiero, G. Palermo, C. Silvano, and O. Villa, “Exploration of Distributed Shared Memory Architectures for NoC-Based Multiprocessors,” J. Systems Architecture, vol. 53, no. 10, pp. 719-732, 2007.
[54] L. Benini and D. Bertozzi, “System-on-Chip: Next Generation Electronics,” IEE Circuits, Devices and System Series, chapter 17, Network-on-Chip Architectures and Design Methods, pp. 589-624, 2006.
[55] M. Palesi, S. Kumar, and R. Holsmark, “A Method for Router Table Compression for Application Specific Routing in Mesh Topology NoC Architectures,” Proc. Sixth Int'l Workshop Systems, Architectures, Modeling, and Simulation (SAMOS '06), pp. 373-384, July 2006.
21 ms
(Ver 2.0)

Marketing Automation Platform Marketing Automation Tool