NDLI: Minimal, deadlock-free routing in hypercubic and arbitrary networks

Content Provider	IEEE Xplore Digital Library
Author	Cypher, R.
Copyright Year	1995
Description	Author affiliation: Dept. of Comput. Sci., Johns Hopkins Univ., Baltimore, MD, USA (Cypher, R.)
Abstract	In this paper we consider the problem of creating minimal, deadlock-free routing algorithms, where a routing algorithm is said to be minimal if it uses only shortest paths. In particular we examine the possibility of creating scalable algorithms that use only a constant number of buffers per node. Minimal, scalable, deadlock-free routing algorithms are known for many important networks including meshes, tori, trees and hypercubes. In addition, it is known that a scalable, deadlock -free routing algorithm exists for every network. However, it is unknown whether or not a minimal scalable, deadlock-free routing algorithm exists for every network; and no such algorithm is known for the de Bruijn or shuffle-exchange networks. We present three main results. First, we prove that there is no minimal, scalable, deadlock-free routing algorithm for the hypercube that uses only the standard Ascend (dimension-order) paths. Second, we prove that there exist networks for which no minimal, scalable, deadlock-free routing algorithm is possible. Third, we create minimal, scalable, deadlock- free routing algorithms for the de Bruijn and shuffle-exchange networks. The algorithm for the de Bruijn network appears to be of practical interest, as it uses only four buffers per node. Our results apply to oblivious and adaptive store-and-forward and virtual cut-through routing algorithms, and to oblivious wormhole routing algorithms.
Starting Page	122
Ending Page	129
File Size	866560
Page Count	8
File Format	PDF
ISBN	0818671955
ISSN	10636374
DOI	10.1109/SPDP.1995.530674
Language	English
Publisher	Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Publisher Date	1995-10-25
Access Restriction	Subscribed
Rights Holder	Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Subject Keyword	System recovery Routing Intelligent networks Hypercubes Buffer storage Computer science Hardware Clocks Computer networks Concurrent computing
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