561 Hits in 2.9 sec

A simple livelock-free algorithm for packet switching

R.K. Shyamasundar
1984 Science of Computer Programming  
In this paper, a deadlock-free algorithm as well as a livelock-free algorithm for packet switching is obtained using the strategy of the banker's algorithm.  ...  Store-and-forward deadlock (SFD) occurs in packet switched computer networks when, among some cycle of packets buffered by the communication system, each packet in the cycle waits for the use of the buffer  ...  Acknowledgment It is a pleasure to thank the referees for their suggestions and critical comments.  ... 
doi:10.1016/0167-6423(84)90002-9 fatcat:hbbfh2czenhwlgvxqwcblzcduu

Fully Reliable Dynamic Routing Logic for a Fault-Tolerant NoC Architecture

Abdulaziz Alhussien, Freek Verbeek, Bernard Van Gastel, Nader Bagherzadeh, Julien Schmaltz
2013 Journal of Integrated Circuits and Systems  
., for any combination of three faults our routing logic remains connected, deadlock-free and livelock-free.  ...  A fault-tolerant adaptive wormhole routing function for Networks-on-Chips (NoCs) is presented.  ...  This paper presents the design of a dynamic fault-tolerant routing function in a complicated network architecture. The routing logic is deadlock-free, livelock-free and completely connected.  ... 
doi:10.29292/jics.v8i1.371 fatcat:ugg3yutsnra4jgedptr3fa2cri

Exploiting the Routing Efficiency for DMesh Networks

Xinyu Wang, Tingting Han, Haikuo Liu
2015 International Journal of Future Generation Communication and Networking  
In this paper, we present a novel deadlock-free and livelock-free routing algorithm based on DMesh network in order to make better use of different channels.  ...  Moreover, the new scheme can be used to both wormhole and virtual-cut-through switched networks.  ...  This work is also supported by the Outstanding Talent Project of Dongbei University of Finance and Economics (No. DUFE2015R06).  ... 
doi:10.14257/ijfgcn.2015.8.6.26 fatcat:kkcohqu3cffbdoofomuzlcss24

Making-a-stop: A new bufferless routing algorithm for on-chip network

Jing Lin, Xiaola Lin, Liang Tang
2012 Journal of Parallel and Distributed Computing  
The proposed routing algorithm is based on the concept of making-a-stop (MaS), aiming to deadlock and livelock freedom in wormhole-switched NoC.  ...  In the deep submicron regime, the power and area consumed by router buffers in network-on-chip (NoC) have become a primary concern.  ...  A packet will become the oldest packet within the network eventually. Hence, freedom of deadlock and livelock is guaranteed. Observation 2.  ... 
doi:10.1016/j.jpdc.2012.01.001 fatcat:lauqgg6en5e4lfqfqygpe5aedu

An improved fault-tolerant routing algorithm for a Network-on-Chip derived with formal analysis

Zhen Zhang, Wendelin Serwe, Jian Wu, Tomohiro Yoneda, Hao Zheng, Chris Myers
2016 Science of Computer Programming  
The routing algorithm is proven to have several desirable properties including deadlock and livelock freedom, and tolerance to a single-link-fault.  ...  Adding fault-tolerance adaptivity to a routing algorithm increases its design complexity and makes it prone to deadlock and other problems if improperly implemented.  ...  Using DCI2, it is possible to show that the routing protocol without faults is deadlock-free and livelock-free for larger networks (we checked up to five-by-five router nodes).  ... 
doi:10.1016/j.scico.2016.01.002 fatcat:t43j6pvb2vd4hpa32iz4qbqhby

Key Problems on Network-on-Chip

Youyao Liu, Yaodong Tan, Jungang Hang
2007 2007 10th IEEE International Conference on Computer-Aided Design and Computer Graphics  
Network-on-Chip (NoC) has been recently proposed as a promising solution to complex System-on-Chip communication problems and widely received by academe and industry.  ...  Deadlock, livelock and starvation are potential problems on both oblivious and adaptive routing [6] . Deadlock.  ...  A non-minimal deadlock free routing algorithm is described in [9] .  ... 
doi:10.1109/cadcg.2007.4407952 dblp:conf/cadgraphics/LiuTH07 fatcat:5pffokzjafc4nkulfe43msfyfa

Deadlock-Free Multicasting in Irregular Networks Using Prefix Routing

Jie Wu, Li Sheng
2005 Journal of Supercomputing  
It is shown that the proposed routing scheme is deadlock-and livelock-free.  ...  A deadlock-free multicast scheme called prefix multicasting in irregular networks (i.e., networks with irregular topology) is studied.  ...  Section 4 proposes the livelock-and deadlock-free prefix multicasting.  ... 
doi:10.1023/b:supe.0000049325.58858.72 fatcat:vs3tgbuy2bbzjlwuqhvp3pn2em

Angle Routing: A Fully Adaptive Packet Routing for NoC

Foroogh Haj aghajani, Ahmad Khademzadeh, Samira Saeidi, Kambiz Badie
2015 International Journal on Computational Science & Applications  
The performance of network-on-chip largely depends on the underlying routing techniques. In this paper a novel fully adaptive deadlock-free packet routing algorithm for network on chip is proposed.  ...  This method which is called angle routing (AR) determines a path based on minimizing the angle between the candidate neighbouring switch, current switch and destination.  ...  In this paper, we propose a novel fully adaptive, deadlock-free routing algorithm without adding virtual channels to network on chip. 3.ANGLE ROUTING ALGORITHM As it was mentioned, network performance  ... 
doi:10.5121/ijcsa.2015.5301 fatcat:akllwdhh3fhtjk5v44nsulr4ae

Adaptive deadlock- and livelock-free routing with all minimal paths in Torus networks

Pablo E. Berman, Luis Gravano, Gustavo D. Pifarré, Jorge L. C. Sanz
1992 Proceedings of the fourth annual ACM symposium on Parallel algorithms and architectures - SPAA '92  
In the first part, a new algorithm for deadlock-and livelock-free routing for the  ...  This technique, called *-Channels, is fully-adaptive, deadlock- and livelock- free, and requires a very moderate amount of resources in the routing nodes.  ...  The technique is fully-adaptive, minimal, free of deadlock and livelock in a deterministic sense, and can be implemented using 5 buffers, in each node, per-bidirectional physical link in all but one of  ... 
doi:10.1145/140901.140902 dblp:conf/spaa/BermanGPS92 fatcat:difwphwsp5dcpmv2mxwaqpjqsu

Prevention of deadlocks and livelocks in lossless backpressured packet networks

M. Karol, S.J. Golestani, D. Lee
2003 IEEE/ACM Transactions on Networking  
In this paper, we describe a simple, lossless method of preventing deadlocks and livelocks in backpressured packet networks.  ...  While there are potential advantages in backpressured networks that do not allow packet dropping, such networks are susceptible to a condition known as deadlock in which throughput of the network or part  ...  The network is free of deadlock. 4. The network is free of livelock provided that the scheduling algorithms S `of each network link is livelock-free.  ... 
doi:10.1109/tnet.2003.820434 fatcat:mypzk2zzavb6tjdwu3sqilg6he

An innovative routing scheme to reduce communication delay in DMesh networks

Xinyu Wang, Zhigang Yu, Kele Shen, Moyuan Wang
2015 IEICE Electronics Express  
In this paper, we present a novel deadlockfree and livelock-free routing algorithm for DMesh, and it provides much more flexibility for packets in order to make better use of different links.  ...  Though quasi-minimal routing algorithm provides some adaptivity, it limits packets routing in the rectangular defined by source and destination nodes.  ...  Deadlock and livelock freedom The proposed algorithm allows packets to traverse the network along non-minimal paths, therefore, proof of the livelock freedom should be presented.  ... 
doi:10.1587/elex.12.20150353 fatcat:hw2zg5fsfveozkxr36dqcwbf4m

CARM: Congestion Adaptive Routing Method for On Chip Networks

Manoj Kumar, Vijay Laxmi, Manoj Singh Gaur, Seok-Bum Ko, Mark Zwolinski
2014 2014 27th International Conference on VLSI Design and 2014 13th International Conference on Embedded Systems  
In this paper, we present a highly adaptive and deadlock free routing algorithm for 2D mesh topology to mitigate congestion.  ...  Results show that proposed congestion-aware routing algorithm improves network performance by routing packets through non-congested areas.  ...  Thus, CARM routing algorithm is livelock free. IV.  ... 
doi:10.1109/vlsid.2014.48 dblp:conf/vlsid/KumarLGKZ14 fatcat:pizbzhsdyze6pfeqfwz2o35kra

Page 3780 of Mathematical Reviews Vol. , Issue 84i [page]

1984 Mathematical Reviews  
346801 1 Kakuda, Yoshiaki (J- HROSE); Kikuno, Tohru(J-HROSE); Yoshida, Noriyoshi(J-HROSE) A deadlock- and livelock-free local controller for packet switching network. Systems-Comput.  ...  The DSET prevents deadlock and livelock by utilizing knowledge about the packet generation time and packet transfer path length; this information is local to each switching station.  ... 

DeFT: A Deadlock-Free and Fault-Tolerant Routing Algorithm for 2.5D Chiplet Networks [article]

Ebadollah Taheri and Sudeep Pasricha and Mahdi Nikdast
2021 arXiv   pre-print
Nevertheless, the underlying network is prone to deadlock, despite deadlock-free chiplets, and to different faults on the vertical links used for connecting the chiplets to the interposer.  ...  To address these problems, this paper presents the first deadlock-free and fault-tolerant routing algorithm, called DeFT, for 2.5D integrated chiplet systems.  ...  Livelock-freedom: DeFT is livelock-free in any 2.5D chiplet system where each chiplet is locally livelock-free.  ... 
arXiv:2112.09234v1 fatcat:wtpb4zpa65h3bpjtbuz732rs2m

FoN: Fault-on-Neighbor aware routing algorithm for Networks-on-Chip

Chaochao Feng, Zhonghai Lu, Axel Jantsch, Jinwen Li, Minxuan Zhang
2010 23rd IEEE International SOC Conference  
The average hop counts can be up to 1.7x less than the cost-based switch. The FoN switch is also synthesized using 65nm TSMC technology and it can work at 500MHz with small area overhead.  ...  This paper proposes a Fault-on-Neighbor (FoN) aware deflection routing algorithm for NoC which makes routing decision based on the link status of neighbor switches within 2 hops to avoid fault links and  ...  Only if all the other links are not available, the packet will be routed back. B. Deadlock and Livelock Avoidance Deflection routing is deadlock free since packets never have to wait in a switch.  ... 
doi:10.1109/socc.2010.5784672 dblp:conf/socc/FengLJLZ10 fatcat:n45nohzaurcela5jquqapby5cm
« Previous Showing results 1 — 15 out of 561 results