Name
Abstract | ||
|---|---|---|
This paper presents a multiple-path deadlock-free routing algorithm in direct binary hypercubes which is an improved version of a previously published algorithm by the author (1991). Between two nodes of distance k, the previous algorithm provides k disjoint paths in one direction and one path in the other. The direction with one path is a performance bottleneck. The new algorithm adds one more disjoint path to the narrow direction using buffer management technique, and preserves the deadlock-free property. Although only one path is added, simulation results presented in this paper show a significant performance improvement since the added path almost doubles the capacity of the bottleneck |
Year | DOI | Venue |
|---|---|---|
1992 | 10.1109/IPPS.1992.223000 | IPPS |
Keywords | Field | DocType |
previous algorithm,disjoint path,narrow direction,disjoint paths,multiple-path deadlock-free routing algorithm,buffer management,distance k,multiple-path deadlock-free,added path,binary hypercubes,performance evaluation,message switching,telecommunication network routing,k disjoint path,new algorithm,deadlock-free property,improved multiple-path deadlock-free routing,performance bottleneck,hypercube networks,bandwidth,message passing,hypercubes,routing,topology | Bottleneck,Disjoint sets,Computer science,Parallel computing,Algorithm,Yen's algorithm,Suurballe's algorithm,Hypercube,Fast path,Message switching,K shortest path routing | Conference |
ISBN | Citations | PageRank |
0-8186-2672-0 | 0 | 0.34 |
References | Authors | |
7 | 1 | |