Published in

Proceedings 8th International Symposium on Modeling, Analysis and Simulation of Computer and Telecommunication Systems (Cat. No.PR00728)

DOI: 10.1109/mascot.2000.876581

Links

Tools

Export citation

Search in Google Scholar

A cost-effective load balanced adaptive routing scheme formesh-connected networks

Proceedings article published in 2000 by Xicheng Liu, Sijing Zhang, Xicheng Liu, Sijing Zhang, T. J. Li
This paper is available in a repository.
This paper is available in a repository.

Full text: Download

Green circle
Preprint: archiving allowed
Upload
Green circle
Postprint: archiving allowed
Upload
Red circle
Published version: archiving forbidden
Policy details
Data provided by SHERPA/RoMEO

Abstract

A highly cost-effective adaptive routing algorithm for n-D meshes is designed. It employs only two virtual channels. The planar routing and the 2D VBMAR are used as constructs for it. Routing freedom is greatly enhanced to improve performance. As a result, the algorithm features load balance and high adaptivity. Deadlock freedom of the algorithm is proved. Extensive simulations show that it not only outperforms an algorithm with equal virtual channels, but also excels the fully routing algorithm with much more virtual channels