We prove a 0.691n lower bound for the permutation routing problem in nxn meshes with row and column buses whose propagation delay is one time unit. For meshes having non-unit-time buses, we use similar arguments to derive some simple lower bounds for the permutation routing problem.link_to_subscribed_fulltex
We present an optimal oblivious randomized algorithm for permutation routing on the MIMD version of ...
Abstract Mesh connected computers have become attractive models of com-puting because of their varie...
This paper deals with permutation routing on hypercube networks in the store-and-forward model. We i...
We consider the permutation routing problem on two-dimensional n x n meshes. To be practical, a r...
We consider the permutation routing problem on two-dimensional $n \times n$ meshes. To be practical,...
We consider the permutation routing problem on two-dimensional n x n meshes. To be practical, a rout...
We consider the permutation routing problem on two-dimensional n x n meshes. To be practical, a rout...
We consider the problem of routing packets on an n \Theta \Delta \Delta \Delta \Theta n MIMD mesh-co...
We show that adding partitioned-buses (as opposed to long buses that span an entire row or column) t...
AbstractOblivious permutation routing in binary d-cubes has been well studied in the literature. In ...
AbstractThe mesh of buses (MBUS) is a parallel computation model which consists of n×n processors, n...
AbstractThe architecture of “mesh of buses” is an important model in parallel computing. Its main ad...
Given the permutation routing problem on mesh-connected arrays with a known maximum distance, d, bet...
New deterministic algorithms for routing permutations on two-dimensional meshes are developed. On an...
Routing with locality is studied for meshes with buses. In this problem, packets' distances are boun...
We present an optimal oblivious randomized algorithm for permutation routing on the MIMD version of ...
Abstract Mesh connected computers have become attractive models of com-puting because of their varie...
This paper deals with permutation routing on hypercube networks in the store-and-forward model. We i...
We consider the permutation routing problem on two-dimensional n x n meshes. To be practical, a r...
We consider the permutation routing problem on two-dimensional $n \times n$ meshes. To be practical,...
We consider the permutation routing problem on two-dimensional n x n meshes. To be practical, a rout...
We consider the permutation routing problem on two-dimensional n x n meshes. To be practical, a rout...
We consider the problem of routing packets on an n \Theta \Delta \Delta \Delta \Theta n MIMD mesh-co...
We show that adding partitioned-buses (as opposed to long buses that span an entire row or column) t...
AbstractOblivious permutation routing in binary d-cubes has been well studied in the literature. In ...
AbstractThe mesh of buses (MBUS) is a parallel computation model which consists of n×n processors, n...
AbstractThe architecture of “mesh of buses” is an important model in parallel computing. Its main ad...
Given the permutation routing problem on mesh-connected arrays with a known maximum distance, d, bet...
New deterministic algorithms for routing permutations on two-dimensional meshes are developed. On an...
Routing with locality is studied for meshes with buses. In this problem, packets' distances are boun...
We present an optimal oblivious randomized algorithm for permutation routing on the MIMD version of ...
Abstract Mesh connected computers have become attractive models of com-puting because of their varie...
This paper deals with permutation routing on hypercube networks in the store-and-forward model. We i...
DOI
Add to ORKG