Filters








9,782 Hits in 2.8 sec

Efficient deadlock-free routing

Baruch Awerbuch, Shay Kutten, David Peleg
1991 Proceedings of the tenth annual ACM symposium on Principles of distributed computing - PODC '91  
Intuitively, the reason is that if a "freeing message" locks another "freeing mes- sage" and goes up a level, it is later required to send yet another freeing message that will free the locked  ...  freeing message, and so forth.  ... 
doi:10.1145/112600.112616 dblp:conf/podc/AwerbuchKP91 fatcat:bg4tiz4h7ffaznzknh4v2dgjty

Efficient and Deadlock-Free Tree-Based Multicast Routing Methods for Networks-on-Chip (NoC) [chapter]

Faizal Arya Samman, Thomas Hollstein
2013 Routing Algorithms in Networks-on-Chip  
This chapter presents a new efficient and deadlock free tree-based multicast routing method and concept.  ...  The NoC microarchitecture supports both deadlock-free static and efficient adaptive tree-based multicast routing.  ...  and Deadlock-Free Multicast Routing Method for NoCs Efficient and Deadlock-Free Multicast Routing Method for NoCs Efficient and Deadlock-Free Multicast Routing Method for NoCs Efficient  ... 
doi:10.1007/978-1-4614-8274-1_6 fatcat:iszc5oko4zbzjdbcc345n4sphq

Efficient deadlock-free multi-dimensional interval routing in interconnection networks [chapter]

Rastislav KráĽovič, Branislav Rovan, Peter RuŽička, Daniel štefankovič
1998 Lecture Notes in Computer Science  
In this paper we give an evidence that for some well-known interconnection networks there are efficient deadlock-free multidimensional interval routing schemes (DFMIRS) despite of a provable nonexistence  ...  of efficient deterministic shortest path interval routing schemes (IRS).  ...  It would be nice to have a trade-off between compactness and size for deadlock-free MIRS on general graphs.  ... 
doi:10.1007/bfb0056489 fatcat:dqcg4o7ysnb5zkfleaneltuswi

Planar adaptive network-on-chip supporting deadlock-free and efficient tree-based multicast routing method

Faizal Arya Samman, Thomas Hollstein, Manfred Glesner
2012 Microprocessors and microsystems  
Both NoC microarchitectures support a deadlock-free static and efficient adaptive tree-based multicast routing method.  ...  The strategy is used to perform efficient spanning trees for the adaptive tree-based multicast routing that are made at runtime during application execution time.  ...  Proposal for efficient multicast routing The tree-based multicast routing algorithm implemented in our XHiNoC architecture is deadlock-free.  ... 
doi:10.1016/j.micpro.2012.04.003 fatcat:kjfqduvrbzbhpktyfu57tsfjii

Exploiting Communication Concurrency for Efficient Deadlock Free Routing in Reconfigurable NoC Platforms

Maurizio Palesi, Shashi Kumar, Rickard Holsmark, Vincenzo Catania
2007 2007 IEEE International Parallel and Distributed Processing Symposium  
We propose a methodology to develop efficient and deadlock free routing algorithms for such NoC platforms which can be specialized for an application or a set of concurrent applications.  ...  free algorithms like XY and Odd-Even.  ...  Such future FPGAs are likely to be provided with small table based routers for efficient, adaptive and deadlock free routing among cores.  ... 
doi:10.1109/ipdps.2007.370367 dblp:conf/ipps/PalesiKHC07 fatcat:5tq5euxccfcx7l4mcymvdbs2au

An efficient deadlock-free tree-based routing algorithm for irregular wormhole-routed networks based on the turn model

Yau-Ming Sun, Chih-Hsueh Yang, Yeh-Ching Chung, Tai-Yi Huang
2004 International Conference on Parallel Processing, 2004. ICPP 2004.  
In this paper, we proposed an efficient deadlock-Free tree-based routing algorithm, the DOWN/UP routing, for irregular wormhole-routed networks based on the turn model.  ...  To evaluate the performance of DOWN/UP routing, the simulation is conducted. We have implemented the DOWN/UP routing along with the L-turn routing on the IRFlexSim0.5 simulator.  ...  In this paper, we propose an efficient deadlock-free tree-based routing algorithm, the DOWN/UP routing, for irregular wormhole-routed networks based on the turn model.  ... 
doi:10.1109/icpp.2004.1327941 dblp:conf/icpp/SunYCH04 fatcat:porcixoi3rf4jffknhvgvbb4ia

Deflection routing in 3D Network-on-Chip with TSV serialization

Jinho Lee, Dongwoo Lee, Sunwook Kim, Kiyoung Choi
2013 2013 18th Asia and South Pacific Design Automation Conference (ASP-DAC)  
The End • Thank you for your attention • Feel free to ask any questions Sidebuffer [2] C. Fallin et. al, "MinBD: Minimally-Buffered Deflection Routing for Energy-Efficient Interconnect," in Proc.  ...  -Excess Input -3D deflection -Deadlock & livelock • Higher performance in terms of throughput and power efficiency is obtained.  ... 
doi:10.1109/aspdac.2013.6509554 dblp:conf/aspdac/LeeLKC13 fatcat:qildii44cvfeflb33bv3h5adta

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
To address these problems, this paper presents the first deadlock-free and fault-tolerant routing algorithm, called DeFT, for 2.5D integrated chiplet systems.  ...  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.  ...  DeFT offers VC-based deadlock-freedom where not only are packets free to select any VL, but also VC utilization is efficiently balanced.  ... 
arXiv:2112.09234v1 fatcat:wtpb4zpa65h3bpjtbuz732rs2m

Topology Agnostic Dynamic Quick Reconfiguration for Large-Scale Interconnection Networks

Frank Olaf Sem-Jacobsen, Olav Lysne
2012 2012 12th IEEE/ACM International Symposium on Cluster, Cloud and Grid Computing (ccgrid 2012)  
Finally, the new routing function is compatible with the old one, so that deadlock free dynamic transition between the old and the new routing function is immediately available.  ...  In this paper we present a method that efficiently generates a new routing function in the presence of faults.  ...  It is well known that even if the old and the new routing functions are deadlock free by themselves, an uncontrolled transition between the two can cause deadlocks [1] .  ... 
doi:10.1109/ccgrid.2012.62 dblp:conf/ccgrid/Sem-JacobsenL12 fatcat:uzicuw4rfzcone7636hbmv52gq

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  
Performance of NoC is highly dependent on routing algorithm we choose. In this paper, we present a highly adaptive and deadlock free routing algorithm for 2D mesh topology to mitigate congestion.  ...  Network-on-Chip (NoC) has emerged as a longterm and efficient on-chip communication solution for MC-SoC and CMP micro-architectures to overcome bottleneck of traditional bus-based interconnects.  ...  Theorem 2: CARM routing algorithm is deadlock free. Proof: From Lemma 1 & Lemma 2 and using Theorem 1, CARM routing algorithm is deadlock free.  ... 
doi:10.1109/vlsid.2014.48 dblp:conf/vlsid/KumarLGKZ14 fatcat:pizbzhsdyze6pfeqfwz2o35kra

Deadlock-free XY-YX router for on-chip interconnection network

Yeong Seob Jeong, Seung Eun Lee
2013 IEICE Electronics Express  
Specifically, based on the observation that a response is always preceded by a request in multi-processor SoCs, this letter proposes a novel deadlock-free XY-YX router for on-chip network performance improvement  ...  In order to avoid deadlock, we add additional physical channels in the horizontal direction and optimize the priority of output channel allocation.  ...  Traditional XY routing, which is often used in torus and mesh topology, has the advantage of deadlock-and livelock-free characteristics and it is easy to design.  ... 
doi:10.1587/elex.10.20130699 fatcat:jprfkps5b5fw5hhzrma3hsuspu

Dynamic Communication Performance Enhancement in Hierarchical Torus Network by Selection Algorithm

MM Hafizur Rahman, Yukinori Sato, Yasushi Inoguchi
2012 Journal of Networks  
It also proves that the proposed adaptive routing algorithms are deadlock-free with 3 virtual channels.  ...  This paper addresses three adaptive routing algorithms -link-selection, channelselection, and a combination of link-selection and channelselection -for the efficient use of physical links and virtual channels  ...  Thus, the network is deadlock-free. Theorem 2: Suppose routing algorithm R 1 of the HTN is deadlock free. The routing algorithm R 2 which applies the CS algorithm, is also deadlock free.  ... 
doi:10.4304/jnw.7.3.468-479 fatcat:thveuh74yvcwdodkzhaa4j7mby

Dynamic communication performance enhancement in Hierarchical Torus Network by selection algorithm

M.M. Hafizur Rahman, Yukinori Sato, Yasushi Inoguchi
2010 2010 13th International Conference on Computer and Information Technology (ICCIT)  
It also proves that the proposed adaptive routing algorithms are deadlock-free with 3 virtual channels.  ...  This paper addresses three adaptive routing algorithms -link-selection, channelselection, and a combination of link-selection and channelselection -for the efficient use of physical links and virtual channels  ...  Thus, the network is deadlock-free. Theorem 2: Suppose routing algorithm R 1 of the HTN is deadlock free. The routing algorithm R 2 which applies the CS algorithm, is also deadlock free.  ... 
doi:10.1109/iccitechn.2010.5723855 fatcat:6z72qt3xtrf7lm7vzw7uv62rb4

An efficient history-based routing algorithm for interconnection networks

Sanaz Rahimi Moosavi, Chia-Yuan Chang, Amir-Mohammad Rahmani, Juha Plosila, Ka Lok Man, Taikyeong T. Jeong, Eng Gee Lim
2012 2012 International SoC Design Conference (ISOCC)  
We further enhance this routing by using a technique named Free-Channel to check the availability of the output ports as well as their history.  ...  The simulation results reveal that the HB-OE + Free-Channel routing policy can achieve lower latency compared to the conventional Odd-Even turn model with negligible area overhead.  ...  In a deadlock-free routing algorithm, at least one of the turns in any possible cyclic-dependency loop must be avoided. Fig. 3 shows an example of a deadlock-free cyclic pattern. III.  ... 
doi:10.1109/isocc.2012.6407094 dblp:conf/isocc/MoosaviCRPMJL12 fatcat:ey4uwzmhdvcijnvwlltrpafef4

Bubble coloring

Ruisheng Wang, Lizhong Chen, Timothy Mark Pinkston
2013 Proceedings of the 27th international ACM conference on International conference on supercomputing - ICS '13  
Handling routing-and protocol-induced deadlocks is a critical issue in designing a reliable communication system.  ...  Results from both synthetic and full-system simulation show that, compared to a conventional deadlock-free scheme with 4VCs (i.e., XY adaptive 4VC), our BC scheme with the minimal 1VC (i.e., BC 1VC) can  ...  Routing algorithms, with full routing adaptivity can leverage this deadlock-free virtual ring as its escape path to avoid routing-induced deadlocks.  ... 
doi:10.1145/2464996.2465436 dblp:conf/ics/WangCP13 fatcat:zkrnt6yrpbbdbkglbdhdaznauu
« Previous Showing results 1 — 15 out of 9,782 results