55 search results - page 1 / 11 » Better Deterministic Routing on Meshes |
IPPS
1999
IEEE
13 years 11 months ago
1999
IEEE
Optimal randomized and deterministic algorithms have been given for k-k routing on two-dimensional nn meshes. The deterministic algorithm is based on "column-sort" and e...
EUROPAR
1997
Springer
13 years 11 months ago
1997
Springer
In this paper various algorithms for sorting on processor networks are considered. We focus on meshes, but the results can be generalized easily to other decomposable architecture...
NOCS
2007
IEEE
14 years 1 months ago
2007
IEEE
In this paper we present a new clustered mesh FPGA architecture where each cluster local interconnect is implemented as an MFPGA tree network [6]. Unlike previous clustered mesh a...
IPPS
1998
IEEE
13 years 11 months ago
1998
IEEE
Abstract. We give a high-level description of some fundamental randomized and deterministic techniques for routing and sorting on xedconnection networks such as meshes, hypercubes ...
MASCOTS
2004
13 years 8 months ago
2004
Several models of deterministic routing have been proposed for wormhole-routed mesh networks while there is only one model, to our best knowledge, proposed for fully adaptive worm...