NDLI: A novel neighbourhood broadcasting algorithm on star graphs

Content Provider	IEEE Xplore Digital Library
Author	Ke Qiu Das, S.K.
Copyright Year	2002
Description	Author affiliation: Dept. of Comput. Sci., Acadia Univ., Wolfville, NS, Canada (Ke Qiu)
Abstract	The neighbourhood broadcasting problem is defined as sending a message of fixed size from the source node to all its neighbours in an interconnection network, where in one time unit, a node can send to or receive from one and only one of its neighbours a datum item of constant size. In other words, the neighbourhood broadcasting is to simulate a single step of an all-port model on a single-port model. On a star interconnection network, this problem has been recently studied by Fujita (1998) who showed (1) a lower bound of [log n] for an n-star; and (2) a neighbourhood broadcasting algorithm on an n-star that requires 1.5 /spl lceil/log(n - 2)/spl rceil/ + 3 steps. The algorithm is later improved by Mkwawa and Kouvatsos (2001) to require 1.33/spl lceil/log(n - 1)/spl rceil/ + O(1) steps. In this paper we present a novel and interesting O(log n) neighbourhood broadcasting algorithm on an n-star In view of the /spl Omega/ (log n) lower bound, our algorithm is also optimal. Although the actual number of steps required is 4 /spl lceil/log(n/2)/spl rceil/ + 1 (or 4 /spl lfloor/log(n/2)/spl rfloor/ + 1 + x, if 1 /spl les/ x = n mod 2/sup /spl lfloor/log n/spl rfloor// /spl les/ 3), our algorithm is easy to implement since routing for all nodes involved is uniform, and simpler conceptually. It uses the cycle structures of star graphs as well as the standard technique of recursive doubling.
Sponsorship	IEEE Comput. Soc. Tech. Committee on Parallel Process. Nat. Central Univ. Ministr. Educ., ROCl Nat. Sci. Council, ROC
Starting Page	37
Ending Page	41
File Size	287992
Page Count	5
File Format	PDF
ISBN	0769517609
ISSN	15219097
DOI	10.1109/ICPADS.2002.1183375
Language	English
Publisher	Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Publisher Date	2002-12-17
Publisher Place	China
Access Restriction	Subscribed
Rights Holder	Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Subject Keyword	Broadcasting Multiprocessor interconnection networks Computer science Routing Communication standards Network topology
Content Type	Text
Resource Type	Article
Subject	Hardware and Architecture

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

Broadcasting on the star and pancake interconnection networks

Broadcasting on incomplete star graph interconnection networks

Routing, Broadcasting, Prefix Sums, and Sorting Algorithms on the Arrangement Graph

A routing and broadcasting scheme on faulty star graphs

A well-behaved enumeration of star graphs

Parallel routing in hypercube networks with faulty nodes

Multicast communication algorithm on a wormhole-routed star graph interconnection network

Level-wise Scheduling Algorithm for Fat Tree Interconnection Networks

Optimal fault-tolerant communication algorithms on product networks using spanning trees

A novel neighbourhood broadcasting algorithm on star graphs

Similar Documents

Broadcasting on the star and pancake interconnection networks

Broadcasting on incomplete star graph interconnection networks

Routing, Broadcasting, Prefix Sums, and Sorting Algorithms on the Arrangement Graph

A routing and broadcasting scheme on faulty star graphs

A well-behaved enumeration of star graphs

Parallel routing in hypercube networks with faulty nodes

Multicast communication algorithm on a wormhole-routed star graph interconnection network

Level-wise Scheduling Algorithm for Fat Tree Interconnection Networks

Optimal fault-tolerant communication algorithms on product networks using spanning trees

A novel neighbourhood broadcasting algorithm on star graphs