NDLI: A new parallel and distributed shortest path algorithm for hierarchically clustered data networks

Please wait, while we are loading the content...

A new parallel and distributed shortest path algorithm for hierarchically clustered data networks

Content Provider	IEEE Xplore Digital Library
Author	Zhu, S. Huang, G.M.
Copyright Year	1990
Abstract	This paper presents new efficient shortest path algorithms to solve single origin shortest path problems (SOSP problems) and multiple origins shortest path problems (MOSP problems) for hierarchically clustered data networks. To solve an SOSP problem for a network with n nodes, the distributed version of our algorithm reaches the time complexity of O(log(n)), which is less than the time complexity of O(log/sup 2/ (n)) achieved by the best existing algorithm. To solve an MOSP problem, our algorithm minimizes the needed computation resources, including computation processors and communication links for the computation of each shortest path so that we can achieve massive parallelization. The time complexity of our algorithm for an MOSP problem is O(m log(n)), which is much less than the time complexity of O(M log/sup 2/ (0)) of the best previous algorithm. Here, M is the number of the shortest paths to be computed and m is a positive number related to the network topology and the distribution of the nodes incurring communications, m is usually much smaller than M. Our experiment shows that m is almost a constant when the network size increases. Accordingly, our algorithm is significantly faster than the best previous algorithms to solve MOSP problems for large data networks.
Sponsorship	IEEE Computer Society
Starting Page	841
Ending Page	855
Page Count	15
File Size	567633
File Format	PDF
ISSN	10459219
Volume Number	9
Issue Number	9
Language	English
Publisher	Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Publisher Date	1998-09-01
Publisher Place	U.S.A.
Access Restriction	One Nation One Subscription (ONOS)
Rights Holder	Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Subject Keyword	Clustering algorithms Network topology Concurrent computing Shortest path problem Distributed computing Algorithm design and analysis Computer networks Distributed algorithms Broadcasting Parallel processing
Content Type	Text
Resource Type	Article
Subject	Signal Processing Computational Theory and Mathematics 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

A new distributed shortest path algorithm for hierarchically clustered data networks

A fast distributed shortest path algorithm for a class of hierarchically clustered data networks

A fast distributed shortest path algorithm for a class of hierarchically structured data networks

Parallel distributed implementation of the shortest path algorithm

A scalable parallelization of all-pairs shortest path algorithm for a high performance cluster environment

The block distributed memory model

Broadcasting Algorithm Via Shortest Paths

Dynamic broadcasting in parallel computing

Optimal information dissemination in star and pancake networks

A new parallel and distributed shortest path algorithm for hierarchically clustered data networks

Similar Documents

A new distributed shortest path algorithm for hierarchically clustered data networks

A fast distributed shortest path algorithm for a class of hierarchically clustered data networks

A fast distributed shortest path algorithm for a class of hierarchically structured data networks

Parallel distributed implementation of the shortest path algorithm

A scalable parallelization of all-pairs shortest path algorithm for a high performance cluster environment

The block distributed memory model

Broadcasting Algorithm Via Shortest Paths

Dynamic broadcasting in parallel computing

Optimal information dissemination in star and pancake networks

A new parallel and distributed shortest path algorithm for hierarchically clustered data networks