Filters








11,286 Hits in 4.8 sec

Traffic- and Thermal-aware Adaptive Beltway Routing for three dimensional Network-on-Chip systems

Kun-Chih Chen, Che-Chuan Kuo, Hui-Shun Hung, An-Yeu Andy Wu
2013 2013 IEEE International Symposium on Circuits and Systems (ISCAS2013)  
In this paper, a Traffic-and Thermal-aware Adaptive Beltway Routing (TTABR) is proposed to balance both the distribution of the traffic and temperature in the network.  ...  The distribution of traffic and temperature in a highperformance three dimensional Network-on-Chip (3D NoC) system become more unbalanced because of chip stacking and applied minimal routing algorithms  ...  The performance behaviors of TLAR and TTMRA are identical, because the two routing algorithms, which are designed for the NSI-Mesh, both become West-First adaptive routing in regular mesh. B.  ... 
doi:10.1109/iscas.2013.6572182 dblp:conf/iscas/ChenKHW13 fatcat:h67jvr3k2fgs5b2v2sejn666wq

Macs: A Minimal Adaptive routing circuit-switched architecture for scalable and parametric NoCs

Rohit Kumar, Ann Gordon-Ross
2009 2009 International Conference on Field Programmable Logic and Applications  
Compared to previous work, MACS offers a 5x increase in operating frequency and a 2x reduction in area overhead.  ...  Networks-on-Chips (NoCs) are an emerging communication topology paradigm in single chip VLSI design, enhancing parallelism and system scalability.  ...  ACKNOWLEDGEMENTS This work was supported in part by the I/UCRC Program of the National Science Foundation under Grant No. EEC-0642422. We gratefully acknowledge tools provided by Xilinx.  ... 
doi:10.1109/fpl.2009.5272440 dblp:conf/fpl/KumarG09 fatcat:54375snigrcedinex7rucslbau

Energy characteristic of a processor allocator and a network-on-chip

Dawid Zydek, Henry Selvaraj, Grzegorz Borowik, Tadeusz Łuba
2011 International Journal of Applied Mathematics and Computer Science  
Simulation results show that a PA with an IFF allocation algorithm for mesh systems and a torus-based NoC with express-virtual-channel flow control are very energy efficient.  ...  In this paper, the authors propose an energy model for NoCs with 2D-mesh and 2D-torus topologies. All important NoC architectures are described and discussed. Energy estimation is presented for PAs.  ...  Acknowledgment This work has been supported by the European Union in the framework of the European Social Fund through the Warsaw University of Technology Development Programme, and by the Ministry of  ... 
doi:10.2478/v10006-011-0029-7 fatcat:cby3q2ucczczzpdknrm5lwk2ly

Evaluation Scheme for NoC-based CMP with Integrated Processor Management System

Dawid Zydek, Henry Selvaraj, Leszek Koszałka, Iwona Poźniak-Koszałka
2010 International Journal of Electronics and Telecommunications  
As decision making criteria, we consider energy efficiency of Processor Allocator (PA) and NoC, as well as NoC traffic characteristic (load balance).  ...  Analyzed results reveal that CMP with a PA controlled by IFF allocation algorithm for mesh systems and torus-based NoC driven by DORLB routing with express-virtual-channel flow control achieved the best  ...  to high-dimensional networks (like e.g. high dimensional kary n-cubes and meshes) [7] .  ... 
doi:10.2478/v10177-010-0021-4 fatcat:cqeqzba2vrgi7lovnnxw475svq

Page 1154 of IEEE Transactions on Computers Vol. 52, Issue 9 [page]

2003 IEEE Transactions on Computers  
X-Y routing is an example of dimension-order routing used in two-dimensional (2D) meshes and tori.  ...  propose a deterministic fault-tolerant and deadiock-free routing protocol in two-dimensional (2D) meshes based on dimension-order routing and the odd-even turn model.  ... 

GSASRA: A Globally Self-Adaptive and Scalable Routing Algorithm for Network-on-Chips Architecture Using Particle Swarm Optimization

Sani Abba, Jeong-A Lee
2013 2013 1st International Conference on Artificial Intelligence, Modelling and Simulation  
Our algorithm makes global routing decisions using particle swarm optimization technique to find global congestion information and to efficiently and intelligently decide the path to route the packet in  ...  Results from our experiment and simulations show that, our approach proves to be efficient in terms of throughput, latency and energy consumption for self-adaptive and scalable network-on-chip architectures  ...  It further load balances the network by routing in the selected directions adaptively.  ... 
doi:10.1109/aims.2013.72 fatcat:rnucshhrtngq3kt4otzck55lxa

Randomized Partially-Minimal Routing: Near-Optimal Oblivious Routing for 3-D Mesh Networks

Rohit Sunkam Ramanujam, Bill Lin
2012 IEEE Transactions on Very Large Scale Integration (vlsi) Systems  
For 3-D and higher dimensional meshes, the worst-case throughput of O1TURN degrades tremendously.  ...  One direction is in the extension of 2-D mesh-based tiled chip-multiprocessor architectures into three dimensions. This paper focuses on efficient routing algorithms for such 3-D mesh networks.  ...  Given the two-phase load balancing in the Z dimension, the one-dimensional (1D) traffic along any Z line is twice uniform.  ... 
doi:10.1109/tvlsi.2011.2167361 fatcat:64pom6acq5e2vih4nvns6picii

Near-optimal oblivious routing on three-dimensional mesh networks

Rohit Sunkam Ramanujam, Bill Lin
2008 2008 IEEE International Conference on Computer Design  
In this paper, we focus on efficient routing algorithms for such 3D mesh networks. As in the case of 2D mesh networks, throughput and latency are important design metrics for routing algorithms.  ...  One direction is in the extension of two-dimensional (2D) mesh-based tiled chip-multiprocessor architectures into three dimensions.  ...  Given the two-phase load balancing in the Z dimension, the one-dimensional (1D) traffic along any Z line is twice uniform.  ... 
doi:10.1109/iccd.2008.4751852 dblp:conf/iccd/RamanujamL08 fatcat:kob7wxywkjgnzpq4canm4wz3a4

A Deadlock-Free Adaptive 3D Network-on-Chips Routing Algorithm with Repetitive Turn Concept

Yuan Cai, Dong Xiang, Xiang Ji
2020 IET Communications  
Repetitive prohibited turns are spread in the row and column of the planes and vertical direction in the MPTM routing algorithm with no virtual channels.  ...  With the emergence of a large number of multi-core systems, many 3D routing schemes have been developed for network-on-chips (NoCs) in order to obtain low overhead and high-performance.  ...  The efficiency of this method is reflected as better evenness of routing adaptiveness and higher performance.  ... 
doi:10.1049/iet-com.2019.0269 fatcat:jnsql4gopngutgmzefkigdvngy

BARP-a dynamic routing protocol for balanced distribution of traffic in NoCs

Pejman Lotfi-Kamran, Masoud Daneshtalab, Caro Lucas, Zainalabedin Navabi
2008 Proceedings of the conference on Design, automation and test in Europe - DATE '08  
A novel routing algorithm, named Balanced Adaptive Routing Protocol (BARP), is proposed for NoCs to provide adaptive routing and ensure deadlock-free and livelock-free routing at the same time.  ...  It is observed that BARP can achieve better performance compared to static XY routing, oddeven routing and dynamic XY routing.  ...  Static routing algorithm XY for two-dimensional meshes is introduced in [8] . In this routing algorithm, each packet first travels along X and then Y direction to reach the destination.  ... 
doi:10.1145/1403375.1403716 fatcat:4zpn2emhjfdjdj4ugjdtu4n2su

BARP-A Dynamic Routing Protocol for Balanced Distribution of Traffic in NoCs

Pejman Lotfi-Kamran, Masoud Daneshtalab, Caro Lucas, Zainalabedin Navabi
2008 2008 Design, Automation and Test in Europe  
A novel routing algorithm, named Balanced Adaptive Routing Protocol (BARP), is proposed for NoCs to provide adaptive routing and ensure deadlock-free and livelock-free routing at the same time.  ...  It is observed that BARP can achieve better performance compared to static XY routing, oddeven routing and dynamic XY routing.  ...  Static routing algorithm XY for two-dimensional meshes is introduced in [8] . In this routing algorithm, each packet first travels along X and then Y direction to reach the destination.  ... 
doi:10.1109/date.2008.4484871 dblp:conf/date/Lotfi-KamranDLN08 fatcat:pyiclqmy4zbl3dvjyhhnz6irl4

A low overhead, fault tolerant and congestion aware routing algorithm for 3D mesh-based Network-on-Chips

Hoda Naghibi Jouybari, Karim Mohammadi
2014 Microprocessors and microsystems  
In this paper, we propose FT-DyXYZ, an adaptive fault tolerant routing to tolerate permanent faulty links in 3D mesh based NOCs that uses proximity congestion information to balance traffic.  ...  Nowadays, three dimensional Network-On-Chips (NOCs) have emerged as most efficient and scalable communication structures for complex and high performance System-on-Chips (SOCs).  ...  In this paper, we propose an adaptive routing algorithm for 3D mesh based NOCs that can tolerate permanent faulty links and uses congestion information to balance network load.  ... 
doi:10.1016/j.micpro.2014.09.005 fatcat:32uptbsg5jgfnnemuomh5y5kcy

Partial-LastZ: An optimized hybridization technique for 3D NoC architecture enabling adaptive inter-layer communication

Amir-Mohammad Rahmani, Pasi Liljeberg, Juha Plosila, Ka Lok Man, Youngmin Kim, Hannu Tenhunen
2012 2012 International SoC Design Conference (ISOCC)  
We further improve this design by proposing partial-LastZ-based 3D NoC-bus hybrid architecture to provide adaptivity for implementing congestion-aware and fault-tolerant inter-layer routing algorithms.  ...  In this paper, we propose a novel hybridization scheme for inter-layer communication using efficient 5-input routers to enhance the overall system power, performance, and area characteristics of the existing  ...  ACKNOWLEDGMENT The authors wish to acknowledge the financial support by the Academy of Finland, Ulla Tuominen Foundation and Nokia Foundation during the course of this project.  ... 
doi:10.1109/isocc.2012.6407095 dblp:conf/isocc/RahmaniLPMKT12 fatcat:lp46wffq5ve4djyg3skl32p76u

Wormhole routing techniques for directly connected multicomputer systems

Prasant Mohapatra
1998 ACM Computing Surveys  
Depending on the usage of paths between the source and the destination, routing algorithms are classified as deterministic, fully adaptive, and partially adaptive.  ...  We present a detailed survey of various techniques for enhancing the performance and reliability of wormhole-routing schemes in directly connected networks.  ...  ACKNOWLEDGMENTS The author is grateful to Jatin Upadhyay and Vara Varavithya for their help in preparing this article: the comments and suggestions by Professor Lionel Ni have also improved its quality  ... 
doi:10.1145/292469.292472 fatcat:awgtqfbqvjfmvfibgxf3aeqlay

An innovative routing scheme to reduce communication delay in DMesh networks

Xinyu Wang, Zhigang Yu, Kele Shen, Moyuan Wang
2015 IEICE Electronics Express  
Diameter and average distance are two important metrics in topology selection for on-chip networks. In order to lower down them in Mesh, DMesh is proposed by introducing diagonal links.  ...  Though quasi-minimal routing algorithm provides some adaptivity, it limits packets routing in the rectangular defined by source and destination nodes.  ...  Load balancing and routing adaptivity are key aspects to achieve maximum throughput [12] .  ... 
doi:10.1587/elex.12.20150353 fatcat:hw2zg5fsfveozkxr36dqcwbf4m
« Previous Showing results 1 — 15 out of 11,286 results