NDLI: Efficient Routing and Broadcasting in Recursive Interconnection Networks

Content Provider	IEEE Xplore Digital Library
Author	Fernandes, R. Friesen, D.K. Kanevsky, A.
Copyright Year	1994
Description	Author affiliation: University of Southern Mississippi, USA (Kanevsky, A.) \|\| Texas A & M University, USA (Fernandes, R.; Friesen, D.K.)
Abstract	The WK-Recursive Network (WKRN) is a hierarchical interconnection network that is recursively defined and has excellent properties for scalable message-passing multicomputer systems. In this paper, we present efficient routing and broadcasting schemes in a WKRN. For efficient routing, we define the MP-graph between the source and destination nodes of the message. For efficient broadcasting, we define the EDHP-graph and the NDST-graph. The MP-graph can also be used for message routing in the presence of faulty nodes. Similarly, the EDHP-graph (the NDST-graph) can be used for message broadcast in the presence of faulty links (nodes). Fault-tolerant communication schemes using these graphs have the advantage that no information about the presence or location of faulty components is required. Moreover, the MP-graph and the NDSTgraph can be used under different fault models. We analyze the communication delays for message routing (broadcast) along MP-graphs (EDHP-graphs and NDST-graphs) under fault-free and faulty conditions.
Starting Page	51
Ending Page	58
File Size	612931
Page Count	8
File Format	PDF
ISBN	0849324939
DOI	10.1109/ICPP.1994.103
Language	English
Publisher	Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Publisher Date	1994-08-15
Publisher Place	USA
Access Restriction	Subscribed
Rights Holder	Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Subject Keyword	Routing Broadcasting Multiprocessor interconnection networks Fault tolerance Casting Delay effects Parallel processing Computer science Tree graphs Pipeline processing
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

The Folded Petersen Network : A New Communication-Efficient Multiprocessor Topology

Interconnection networks and their eigenvalues

Broadcasting on incomplete star graph interconnection networks

Broadcasting on faulty hypercubes

Multi-node broadcasting in an arrangement graph using multiple spanning trees

Construction of a parallel and shortest routing algorithm on recursive circulant networks

Multi-node broadcasting in hypercubes and star graphs

Finding Hamiltonian cycles on incrementally extensible hypercube graphs

Reliable broadcasting in product networks in the presence of faulty nodes

Efficient Routing and Broadcasting in Recursive Interconnection Networks

Similar Documents

The Folded Petersen Network : A New Communication-Efficient Multiprocessor Topology

Interconnection networks and their eigenvalues

Broadcasting on incomplete star graph interconnection networks

Broadcasting on faulty hypercubes

Multi-node broadcasting in an arrangement graph using multiple spanning trees

Construction of a parallel and shortest routing algorithm on recursive circulant networks

Multi-node broadcasting in hypercubes and star graphs

Finding Hamiltonian cycles on incrementally extensible hypercube graphs

Reliable broadcasting in product networks in the presence of faulty nodes

Efficient Routing and Broadcasting in Recursive Interconnection Networks