NDLI: A Partial Irregular-Network Routing on Faulty k-ary n-cubes

Content Provider	IEEE Xplore Digital Library
Author	Koibuchi, M. Yoshinaga, T. Nishimura, Y.
Copyright Year	2006
Description	Author affiliation: National Inst. of Informatics (Koibuchi, M.)
Abstract	Interconnection networks have been studied to connect a number of processing elements on parallel computers. Their design increasingly includes a challenge to high fault-tolerance, as entire systems become complicated. This paper presents a partial irregular-network routing in order to provide a high fault-tolerance in k-ary n-cube networks. Since an irregular-network routing usually performs poorly in k-ary n-cube networks, it is only used for progressive deadlock-recovery, and avoiding hard failures. The network is logically divided into the fault and regular regions. In the regular region, most packets are transferred along fully adaptive paths that are computed, assuming that there are no hard failures, so as to uniformly distribute the traffic. Simulation results show that the proposed routing achieves the same throughput as that of Duato's protocol under no hard failures. As the number of faulty links increases to up to 8 on 256 nodes, its throughput is only decreased by 15%. Moreover, the throughput of the proposed deadlock-recovery routing is almost maintained during a dynamic reconfiguration
Sponsorship	IEEE CPS
Starting Page	57
Ending Page	64
File Size	471773
Page Count	8
File Format	PDF
ISBN	0769526896
ISSN	15373223
DOI	10.1109/IWIAS.2006.23
Language	English
Publisher	Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Publisher Date	2006-01-23
Publisher Place	USA
Access Restriction	Subscribed
Rights Holder	Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Subject Keyword	Routing Throughput System recovery Multiprocessor interconnection networks Computer networks Concurrent computing Fault tolerant systems Fault tolerance Distributed computing Telecommunication traffic massively parallel computers Adaptive routing fault tolerance progressive deadlock recovery interconnection networks
Content Type	Text
Resource Type	Article

Sl.	Authority	Responsibilities	Communication Details
1	Ministry of Education (GoI), Department of Higher Education	Sanctioning Authority	https://www.education.gov.in/ict-initiatives
2	Indian Institute of Technology Kharagpur	Host Institute of the Project: The host institute of the project is responsible for providing infrastructure support and hosting the project	https://www.iitkgp.ac.in
3	National Digital Library of India Office, Indian Institute of Technology Kharagpur	The administrative and infrastructural headquarters of the project	Dr. B. Sutradhar bsutra@ndl.gov.in
4	Project PI / Joint PI	Principal Investigator and Joint Principal Investigators of the project	Dr. B. Sutradhar bsutra@ndl.gov.in Prof. Saswat Chakrabarti will be added soon
5	Website/Portal (Helpdesk)	Queries regarding NDLI and its services	support@ndl.gov.in
6	Contents and Copyright Issues	Queries related to content curation and copyright issues	content@ndl.gov.in
7	National Digital Library of India Club (NDLI Club)	Queries related to NDLI Club formation, support, user awareness program, seminar/symposium, collaboration, social media, promotion, and outreach	clubsupport@ndl.gov.in
8	Digital Preservation Centre (DPC)	Assistance with digitizing and archiving copyright-free printed books	dpc@ndl.gov.in
9	IDR Setup or Support	Queries related to establishment and support of Institutional Digital Repository (IDR) and IDR workshops	idr@ndl.gov.in

A partial irregular-network routing on faulty k-ary n-cubes.

A new deterministic fault tolerant wormhole routing strategy for k-ary 2-cubes

Immucube: Scalable Fault-Tolerant Routing for k-ary n-cube Networks

A low cost fault tolerant packet routing for parallel computers

Adaptive, fault-tolerant, deadlock-free and livelock-free interval routing in mesh networks

Fault-Tolerant Adaptive Deadlock-Recovery Routing for k-ary n-cube Networks

Fault-tolerant orthogonal fat-trees as interconnection networks

Extended Hypercube with Cross-Connection - A New Interconnection Fault Tolerant Network for Parallel Computers

An efficient Routing Scheme to provide more Fault-tolerance for an Irregular Multistage Interconnection Network

A Partial Irregular-Network Routing on Faulty k-ary n-cubes

Similar Documents

A partial irregular-network routing on faulty k-ary n-cubes.

A new deterministic fault tolerant wormhole routing strategy for k-ary 2-cubes

Immucube: Scalable Fault-Tolerant Routing for k-ary n-cube Networks

A low cost fault tolerant packet routing for parallel computers

Adaptive, fault-tolerant, deadlock-free and livelock-free interval routing in mesh networks

Fault-Tolerant Adaptive Deadlock-Recovery Routing for k-ary n-cube Networks

Fault-tolerant orthogonal fat-trees as interconnection networks

Extended Hypercube with Cross-Connection - A New Interconnection Fault Tolerant Network for Parallel Computers

An efficient Routing Scheme to provide more Fault-tolerance for an Irregular Multistage Interconnection Network

A Partial Irregular-Network Routing on Faulty k-ary n-cubes