Minimal, adaptive and deadlock-free routing for multiprocessors
This paper reviews methods for minimal, adaptive and deadlockfree routing. Some are based on the direct construction of a buffer graph. The other ones consist in deriving a minimal, adaptive and deadlock-free routing function f1 from a function f a priori given. The methods are compared and applied to a set of usual regular topologies.
- 1.J.M. Adamo, J. Bonneville, C. Bonello, C-NET, A High Level Programming Environment for SuperNode, Proc. of the PCA Workshop, Bonn, May, 1991.Google Scholar
- 2.N. Alhafez, Etude et Mise en Oeuvre de Routages non Blocants dans les Architectures Multi-processeurs, thèse de doctorat, to appear.Google Scholar