Filters








382 Hits in 8.3 sec

A very efficient distributed deadlock detection mechanism for wormhole networks

P. Lopez, J.M. Martinez, J. Duato
Proceedings 1998 Fourth International Symposium on High-Performance Computer Architecture  
Networks using wormhole switching have traditionally relied upon deadlock avoidance strategies for the design of routing algorithms.  ...  In this paper we propose an improved distributed deadlock detection mechanism that uses only local information, detects all the deadlocks, considerably reduces the probability of false deadlock detection  ...  Pinkston and the anonymous referees for their helpful and valuable suggestions that have improved the presentation and technical contents of this paper.  ... 
doi:10.1109/hpca.1998.650546 dblp:conf/hpca/LopezMD98 fatcat:j4yoxd2t5bhfdooymwnyrictpm

Efficient Deadlock Detection in Parallel Computer Systems with Wormhole Routing [chapter]

Soojung Lee
2007 Lecture Notes in Computer Science  
Consequently, the suggested scheme considerably reduces the probability of detecting false deadlocks over previous schemes, thus enabling more efficient deadlock recovery and higher network throughput.  ...  However, it is subject to deadlock, where packets are waiting for resources in a cyclic form indefinitely.  ...  Conclusions This paper proposed enhanced mechanisms for deadlock detection in wormholerouted direct networks.  ... 
doi:10.1007/978-3-540-72584-8_90 fatcat:ezviakeq4zgxbhdeygyuzepyq4

Compressionless routing: a framework for adaptive and fault-tolerant routing

J.H. Kim, Ziqiang Liu, A.A. Chien
1997 IEEE Transactions on Parallel and Distributed Systems  
CR exploits the tight-coupling between wormhole routers for flow control to detect and recover from potential deadlock situations.  ...  Compressionless Routing (CR) is a new adaptive routing framework which provides a unified framework for efficient deadlock-free adaptive routing and fault-tolerance.  ...  Additional support has been provided by a generous special-purpose grant from the AT&T Foundation.  ... 
doi:10.1109/71.584089 fatcat:ky5xsjitwndo5g7v4fas6zmnom

Multicasting protocols for high-speed, wormhole-routing local area networks

Mario Gerla, Prasasth Palnati, Simon Walton
1996 Conference proceedings on Applications, technologies, architectures, and protocols for computer communications - SIGCOMM '96  
A key property of conventional LANs, which is valuable for many distributed applications, is transparent, reliable network-level multicast.  ...  It is desirable to retain this property also in wormhole LANs. Unfortunately, efficient, reliable multicasting in wormhole LANs is problematic because of the potential for deadlocks.  ...  To achieve high speed and low cost a very simple, streamlined switching fabric is used, with very efficient worm processing (e.g. source routing) and minimal network management facilities.  ... 
doi:10.1145/248156.248173 dblp:conf/sigcomm/GerlaPW96 fatcat:iwaueqkqqfa7ba2ulho26wsfge

Multicasting protocols for high-speed, wormhole-routing local area networks

Mario Gerla, Prasasth Palnati, Simon Walton
1996 Computer communication review  
A key property of conventional LANs, which is valuable for many distributed applications, is transparent, reliable network-level multicast.  ...  It is desirable to retain this property also in wormhole LANs. Unfortunately, efficient, reliable multicasting in wormhole LANs is problematic because of the potential for deadlocks.  ...  To achieve high speed and low cost a very simple, streamlined switching fabric is used, with very efficient worm processing (e.g. source routing) and minimal network management facilities.  ... 
doi:10.1145/248157.248173 fatcat:c2tptscztjb5fa4kp2j5pv73fy

Compressionless routing

J. H. Kim, Z. Liu, A. A. Chien
1994 SIGARCH Computer Architecture News  
CR exploits the tight-coupling between wormhole routers for flow control to detect and recover from potential deadlock situations.  ...  Compressionless Routing (CR) is a new adaptive routing framework which provides a unified framework for efficient deadlock-free adaptive routing and fault-tolerance.  ...  Additional support has been provided by a generous special-purpose grant from the AT&T Foundation.  ... 
doi:10.1145/192007.192050 fatcat:44ndfht5uzf2zecxkfzip425ha

Wormhole routing techniques for directly connected multicomputer systems

Prasant Mohapatra
1998 ACM Computing Surveys  
We present a detailed survey of various techniques for enhancing the performance and reliability of wormhole-routing schemes in directly connected networks.  ...  Next, the characteristics of the wormhole routing mechanism are described in detail along with the theory behind deadlock-free routing.  ...  The author is thankful to Katrina Avery for her editorial assistance, which improved the readability of the article. The author also thanks the referees for their valuable comments.  ... 
doi:10.1145/292469.292472 fatcat:awgtqfbqvjfmvfibgxf3aeqlay

A Decision Procedure for Deadlock-Free Routing in Wormhole Networks

Freek Verbeek, Julien Schmaltz
2014 IEEE Transactions on Parallel and Distributed Systems  
We illustrate its efficiency in a complex adaptive routing function for torus topologies. Results are encouraging. Deciding deadlock freedom is co-NP-Complete for wormhole networks.  ...  Deadlock freedom is a key challenge in the design of communication networks. Wormhole switching is a popular switching technique, which is also prone to deadlocks.  ...  This research is supported by NWO/EW project Formal Validation of Deadlock Avoidance Mechanisms (FVDAM) under Grant 612.064.811. This research is supported by a grant from Intel Corporation.  ... 
doi:10.1109/tpds.2013.121 fatcat:26mr47tlk5hstmhwv52uqrmuiy

A deadlock detection mechanism for true fully adaptive routing in regular wormhole networks

Soojung Lee
2007 Computer Communications  
Deadlock detection and recovery-based routing schemes for wormhole networks have gained attraction because unlike deadlock avoidance-based schemes, they do not restrict routing adaptability.  ...  In order to alleviate the overhead of running a recovery procedure, the studies on deadlock detection have focused on the accuracy of deadlock detection, trying to reduce the number of false detections  ...  CONCLUSIONS This paper proposed efficient deadlock detection and recovery schemes for true fully adaptive routing in wormhole networks.  ... 
doi:10.1016/j.comcom.2007.02.013 fatcat:6uayn4d3pnfc7exnohi4lv5j6e

Exploring Fault-Tolerant Network-on-Chip Architectures

Dongkook Park, C. Nicopoulos, Jongman Kim, N. Vijaykrishnan, C.R. Das
2006 International Conference on Dependable Systems and Networks (DSN'06)  
This spiraling trend highlights the importance of detailed analysis of these reliability hazards and the incorporation of comprehensive protection measures into all Network-on-Chip (NoC) designs.  ...  The effectiveness of the proposed techniques has been validated using a cycle-accurate simulator.  ...  For a destination node selection, three distributions are used: normal random (NR), bit-complement (BC), and tornado (TN) [19] .  ... 
doi:10.1109/dsn.2006.35 dblp:conf/dsn/ParkNKVD06 fatcat:v3gyhdseqzev5oglouxl62ta6m

A family of mechanisms for congestion control in wormhole networks

E. Baydal, P. Lopez, J. Duato
2005 IEEE Transactions on Parallel and Distributed Systems  
This paper presents a family of mechanisms to avoid network congestion in wormhole networks. All of them need only local information, applying message throttling when it is required.  ...  The mechanisms are evaluated and compared for several network loads and topologies, noticeably improving network performance with high loads but without penalizing network behavior for low and medium traffic  ...  He proposed a powerful theory of deadlock-free adaptive routing for wormhole networks.  ... 
doi:10.1109/tpds.2005.102 fatcat:qedlqpuo4jenra7oeyqobtxmy4

Exploiting global knowledge to achieve self-tuned congestion control for k-ary n-cube networks

M. Thottethodi, A.R. Lebeck, S.S. Mukherjee
2004 IEEE Transactions on Parallel and Distributed Systems  
This paper presents a global-knowledge-based, self-tuned, congestion control technique that prevents saturation at high loads across different communication patterns for k-ary n-cube networks.  ...  The second component is a self-tuning mechanism that automatically determines appropriate threshold values based on throughput feedback.  ...  ACKNOWLEDGMENTS The authors would like to thank Amin Vahdat, Jeffrey Chase, Gershon Kedem, Kenneth Yocum, Joel Emer, Mark Hill, and the anonymous referees for their feedback and  ... 
doi:10.1109/tpds.2004.1264810 fatcat:75euurmvifhz5gu4xrr3hs4ugu

A theory of fault-tolerant routing in wormhole networks

J. Duato
1997 IEEE Transactions on Parallel and Distributed Systems  
This paper analyzes the effective redundancy available in a wormhole network by combining connectivity and deadlock freedom. Redundancy is defined at the channel level.  ...  Therefore, the reliability of the interconnection network is very important for the reliability of the whole system.  ...  A short version of this paper was presented at the 1994 International Conference on Parallel and Distributed Systems.  ... 
doi:10.1109/71.605766 fatcat:gfaxqbubvzewbo2i3s37kjckxy

Parallel Deadlock Detection and Recovery for Networks-on-Chip Dedicated to Diffused Computations

Pierre Bomel, Marc Sevaux
2013 2013 Euromicro Conference on Digital System Design  
This article concerns the first step towards the future design of routing strategies: the proposal of a deadlock detection and recovery algorithm.  ...  FPGAs allow the creation of many-cores architectures and, because they are reconfigurable, can embed networks-on-a-chip (NoCs) that have been finely tuned for these kernel's specificities.  ...  Deadlock handling is a subject that was studied for distributed systems [9] and is now being studied for NoCs. There are two strategies: avoidance and detection.  ... 
doi:10.1109/dsd.2013.14 dblp:conf/dsd/BomelS13 fatcat:kzowpqqi4zbo3brmag727dowqe

The Power of Priority: NoC Based Distributed Cache Coherency

Evgeny Bolotin, Zvika Guz, Israel Cidon, Ran Ginosar, Avinoam Kolodny
2007 First International Symposium on Networks-on-Chip (NOCS'07)  
a wormhole NoC, and a linecache search mechanism for the efficient operation of dynamic NUCA.  ...  The paper introduces Network-on-Chip (NoC) design methodology and low cost mechanisms for supporting efficient cache access and cache coherency in future high-performance Chip Multi Processors (CMPs).  ...  for short messages which is embedded within a wormhole NoC, and a cache-line search mechanism for the efficient operation of dynamic NUCA.  ... 
doi:10.1109/nocs.2007.42 dblp:conf/nocs/BolotinGCGK07 fatcat:vofomf4eavcgtlcl3po6i2jcga
« Previous Showing results 1 — 15 out of 382 results