A Class of Partially Adaptive Routing Algorithms for n_dimensional Meshes

Authors:
Younes M. Boura;Chita R. Das
Affiliations:
The Pennsylvania State University, USA;The Pennsylvania State University, USA
Venue:
ICPP '93 Proceedings of the 1993 International Conference on Parallel Processing - Volume 03
Year:
1993

Citing 0
Cited 5

Generic Methodologies for Deadlock-Free Routing

IPPS '96 Proceedings of the 10th International Parallel Processing Symposium
Efficient and balanced adaptive routing in two-dimensional meshes

HPCA '95 Proceedings of the 1st IEEE Symposium on High-Performance Computer Architecture
A Topology-Independent Generic Methodology for Deadlock-Free Wormhole Routing

HPCA '96 Proceedings of the 2nd IEEE Symposium on High-Performance Computer Architecture
An Advanced NoP Selection Strategy for Odd-Even Routing Algorithm in Network-on-Chip

ICA3PP '09 Proceedings of the 9th International Conference on Algorithms and Architectures for Parallel Processing
Analytical modeling and comparison of fault-tolerant message flow control mechanisms in torus-connected networks

The Journal of Supercomputing

Quantified Score

Hi-index	0.00

Visualization

Abstract

A simple model, called the direction restriction model, for developing partially adaptive routing algorithms for n_dimensional meshes is introduced in this paper. This model is based on dividing a system into two unidirectional networks that contain all physical channels of the system.