798 Hits in 4.2 sec

Fault-tolerant tree-based multicasting in mesh multicomputers

Jie Wu, Xiao Chen
2001 Journal of Computer Science and Technology  
We propose a fault-tolerant tree-based multicast algorithm for 2-dimensional 2-D meshes based on the concept of the extended safety level which i s a v ector associated with each n o d e to capture fault  ...  Our approach is the rst attempt to address the fault-tolerant tree-based multicast problem in 2-D meshes based on limited global information with a simple model and succinct information. 1 In many multicomputer  ...  Fault-tolerant multicasting in 3-D meshes Our approach can be extended to fault-tolerant m ulticasting in 3-D meshes based on limited global information.  ... 
doi:10.1007/bf02948957 fatcat:3x33jzuzunhrdbgiuqm2eq5ueq

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

2003 IEEE Transactions on Computers  
Hehre, “Fault-Tolerant Multicast Routing in the Mesh with No Virtual Channels,” Pro Second Int'l Symp. High Performance Computer Architecture, pp. 180- 190, 1995 [18] D.H. Linder and J.C.  ...  Ni, “Fault-Tolerant Wormhole Routing in Meshes without Virtual Channels,” JEEE Trans. Parallel and Distributed Systems, vol. 7, no. 6, pp. 620-636, June 1996 [14] GJ. Glass and L.M.  ... 

Support Efficient and Fault-Tolerant Multicast in Bufferless Network-on-Chip

Chaochao FENG, Zhonghai LU, Axel JANTSCH, Minxuan ZHANG, Xianju YANG
2012 IEICE transactions on information and systems  
We also provide faulttolerant supporting in these schemes through a reinforcement-learningbased method to reconfigure the routing table to tolerate permanent faulty links in the network.  ...  In addition, all three fault-tolerant DRM schemes achieve acceptable performance degradation at various link fault rates without any packet lost.  ...  Acknowledgements The research is partially supported by the National Natural Science Foundation of China, under Grant No.60970036, No.60873212 and No.61003301.  ... 
doi:10.1587/transinf.e95.d.1052 fatcat:icc6chxdbjcq5hobfrwim7qxhm

Resource deadlocks and performance of wormhole multicast routing algorithms

R.V. Boppana, S. Chalasani, C.S. Raghavendra
1998 IEEE Transactions on Parallel and Distributed Systems  
We show that deadlocks due to dependencies on consumption channels are a fundamental problem in wormhole multicast routing.  ...  In addition, we present a new multicast routing algorithm, column-path, which is based on the well-known dimension-order routing used in many multicomputers and multiprocessors.  ...  The absorb and retransmit strategy has been used in the literature for multicasts and for fault-tolerant routing. For example, Suh et al.  ... 
doi:10.1109/71.689441 fatcat:7ykgwqyyzvdzfl75efl4ae4cve

Page 320 of IEEE Transactions on Computers Vol. 52, Issue 3 [page]

2003 IEEE Transactions on Computers  
Ni, “Fault-Tolerant Wormhole Routing in Meshes without Virtual Channels,” [EEE Trans. Parallel and Distributed Systems, vol. 7, no. 6, pp. 6201-636, June 1996 9 r.C. Lee and J.P.  ...  Brandt, “Origin-Based Fault-Tolerant Routing in the Mesh,” Proc. First Int'l Symp. High Performance Computer Architecture, pp. 102-111, 1995 [12] S.L.  ... 

Experimental Analysis of the Fault Tolerance of the PIM-SM IP Multicast Routing Protocol under GNS3

Gábor Lencse, István Derka
2014 International Journal of Advanced Computer Science and Applications  
PIM-SM is the most commonly used IP multicast routing protocol in IPTV systems.  ...  Its fault tolerance is examined by experimenting on a mesh topology multicast test network built up by Cisco routers under GNS3.  ...  ACKNOWLEDGMENT The text and measurement methods of our previous paper [5] (about our experiments under the XORP platform) were reused in this paper but now our experiments were performed in the GNS3  ... 
doi:10.14569/ijacsa.2014.050503 fatcat:wczgxgp4knfw5pisr72cs5bkay

Page 2092 of Mathematical Reviews Vol. , Issue 2002C [page]

2002 Mathematical Reviews  
(1-SC-C; Columbia, SC Deadlock-free fault-tolerant multicast routing in hypercubes.  ...  Summary: “In this paper, an algorithm is presented to embed a ring in an n-dimensional hypercube with at most n — | faults; subsequently, the embedded ring is used for efficient deadlock- free multicast  ... 

Wormhole routing techniques for directly connected multicomputer systems

Prasant Mohapatra
1998 ACM Computing Surveys  
Along with performance, fault tolerance is essential for message routing in multicomputers, and we thus discuss several fault-tolerant wormhole routing algorithms along with their fault-handling capabilities  ...  These routing schemes enable a message to reach its destination even in the presence of faults in the network.  ...  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

A Fault-tolerant Adaptive and Minimal Routing Scheme in $n$-D Meshes

J. Wu
2002 Computer journal  
In 3-D meshes, both regular and dynamic planar-adaptive routing need three virtual channels.  ...  A dynamic planar-adaptive routing scheme is presented that offers better fault tolerance and adaptivity than the regular planar-adaptive routing scheme in n-D meshes.  ...  Therefore, within the context of minimal routing in 3-D meshes, dynamic planar-adaptive routing offers better fault tolerance and adaptivity without using extra virtual channels compared with planar-adaptive  ... 
doi:10.1093/comjnl/45.3.349 fatcat:itj2iynr55bipksji2nafesrpa

A simple fault-tolerant adaptive and minimal routing approach in 3-D meshes

Jie Wu
2003 Journal of Computer Science and Technology  
We also propose a dynamic planar adpative routing scheme that o ers better fault tolerance and adaptivity than the planar adaptive routing scheme in 3-D meshes.  ...  Our approach is the rst attempt to address adaptive and minimal routing in 3-D meshes with faulty nodes using limited fault information.  ...  We show that within the context of minimal routing in 3-D meshes, dynamic planar adaptive routing o ers better fault tolerance and adaptivity without using extra virtual channels compared with planar adaptive  ... 
doi:10.1007/bf02946645 fatcat:22cle5tjqnecfo2vwq6kjndd2u

On the Potential of NoC Virtualization for Multicore Chips

Jose Flich, Samuel Rodrigo, Jose Duato, Thomas Sødring, Åshild Grønstad Solheim, Tor Skeie, Olav Lysne
2008 2008 International Conference on Complex, Intelligent and Software Intensive Systems  
, fault-tolerance and power consumption in multicore chips.  ...  The intention behind this paper is for it to serve as a position paper on the topic of virtualization for NoC and the challenges that should be met at the routing layer in order to optimize performance  ...  Waadeland: One-Fault Tolerance and Beyond in Wormhole Routed Meshes. In Microprocessors and Microsystems, 21(7/8):471-480, 1998.  ... 
doi:10.1109/cisis.2008.97 dblp:conf/cisis/FlichRDSSSL08 fatcat:anxhg6nqkvhjzbd5tr7qfvgp7a

Fault-tolerant adaptive and minimal routing in mesh-connected multicomputers using extended safety levels

Jie Wu
2000 IEEE Transactions on Parallel and Distributed Systems  
Our approach is the rst attempt to address adaptive and minimal routing in 2-D meshes with faulty blocks using limited fault information.  ...  The minimal routing problem in mesh-connected multicomputers with faulty blocks is studied. 2-dimensional 2-D meshes are used to illustrate the approach.  ...  Each virtual network consists virtual channels arranged in such a w ay that no cycle exists among channels, i.e., there is no intra-virtual-network cycle.  ... 
doi:10.1109/71.841751 fatcat:4cqozl3u2faaxmvmvhpkr4dqcq

A flit level simulator for wormhole routing

Denvil Smith
2000 Proceedings of the 38th annual on Southeast regional conference - ACM-SE 38  
Some of these resources include topology, buffers, virtual channels, and message size.  ...  More simulation tools would prove beneficial to the communication research community to aid in evaluating wormhole routed algorithms.  ...  As with the virtual channels, the larger mesh continued to display a small decrease in latency above six buffers.  ... 
doi:10.1145/1127716.1127742 dblp:conf/ACMse/Smith00a fatcat:6yoas7bw5zhxvhdgjgfmh4vewe

Determining Requirements for an Optimal Ad-Hoc Multicast Protocol in Mobile Health Care Training Systems

Anis Zarrad, Ahmed Redha Mahlous
2015 Communications and Network  
In this paper, we investigate the effect of multicast routing protocol in advancing the field of Health care Training-based System to the benefit of patient's safety, and health care professional.  ...  Nowadays, Health Care Training-based System (HCTS) is a vital component in the education and training of health care in 3D Virtual Environment (VE).  ...  Acknowledgements Authors would like to express their thanks to Prince Salman Research and Translation Center (PSRTC) in Prince Sultan University.  ... 
doi:10.4236/cn.2015.72008 fatcat:cn4kui4rprbpbd2tnohotgnhea

A survey on energy-efficient methodologies and architectures of network-on-chip

Assad Abbas, Mazhar Ali, Ahmad Fayyaz, Ankan Ghosh, Anshul Kalra, Samee U. Khan, Muhammad Usman Shahid Khan, Thiago De Menezes, Sayantica Pattanayak, Alarka Sanyal, Saeeda Usman
2014 Computers & electrical engineering  
, fault tolerance, switching techniques, voltage islands, and voltage-frequency scaling.  ...  The objective of the survey is to educate the readers with the latest design-improvements that are carried out in reducing the power consumption in the NoCs.  ...  Taxonomy of the routing techniques for the NoCs. A. Abbas et al. / Computers and Electrical Engineering xxx (2014) xxx-xxx require any virtual channel for both the unicast and multicast messages.  ... 
doi:10.1016/j.compeleceng.2014.07.012 fatcat:ltk46h5gd5azxhsfeuyyat3pte
« Previous Showing results 1 — 15 out of 798 results