Catalogo Articoli (Spogli Riviste)

OPAC HELP

Titolo:
A generic design methodology for deadlock-free routing in multicomputer networks
Autore:
Park, H; Agrawal, DP;
Indirizzi:
Univ Cincinnati, Ctr Distributed & Mobile Comp, ECECS Dept, Cincinnati, OH45221 USA Univ Cincinnati Cincinnati OH USA 45221 ECS Dept, Cincinnati, OH45221 USA Myongji Univ, Div Comp, Yongin, Kyonggi Do, South Korea Myongji Univ Yongin Kyonggi Do South Korea ngin, Kyonggi Do, South Korea
Titolo Testata:
JOURNAL OF PARALLEL AND DISTRIBUTED COMPUTING
fascicolo: 9, volume: 61, anno: 2001,
pagine: 1225 - 1248
SICI:
0743-7315(200109)61:9<1225:AGDMFD>2.0.ZU;2-9
Fonte:
ISI
Lingua:
ENG
Soggetto:
INTERCONNECTION NETWORKS; SUFFICIENT CONDITION; WORMHOLE NETWORKS; MESHES;
Keywords:
adaptive routing; deadlock-free routing; hypercube; k-ary n-cube torus; mesh; subdigraph; virtual channels; wormhole;
Tipo documento:
Article
Natura:
Periodico
Settore Disciplinare:
Engineering, Computing & Technology
Citazioni:
40
Recensione:
Indirizzi per estratti:
Indirizzo: Agrawal, DP Univ Cincinnati, Ctr Distributed & Mobile Comp, ECECS Dept, 816 Engn Res Ctr Bldg,POB 210030, Cincinnati, OH 45221 USA Univ Cincinnati 816 Engn Res Ctr Bldg,POB 210030 Cincinnati OH USA 45221
Citazione:
H. Park e D.P. Agrawal, "A generic design methodology for deadlock-free routing in multicomputer networks", J PAR DISTR, 61(9), 2001, pp. 1225-1248

Abstract

This paper introduces a generic methodology for defining deadlock-free wormhole routing schemes in any arbitrary network. The basic strategy is to partition a graph into subdigraphs with no cyclic dependencies and selectively assign virtual channels. The usefulness of our scheme is shown for the n-dimensional hypercube, the n-dimensional mesh, and the k-ary n-cube torus by identifying subdigraph characteristics that ensure acyclic routing. Further generalization which allows partial cyclic dependencies without deadlockis achieved by our extended generic methodology. We also illustrate how toidentify shortest fixed path and nonminimal adaptive routing schemes usingminimum required channels, (C) 2001 Academic Press.

ASDD Area Sistemi Dipartimentali e Documentali, Università di Bologna, Catalogo delle riviste ed altri periodici
Documento generato il 04/07/20 alle ore 15:01:32