We show that adding partitioned-buses (as opposed to long buses that span an entire row or column) to ordinary meshes can reduce the routing time by approximately one-third for permutation routing with locality. A matching time lower bound is also proved. The result can be generalized to multi-packet routing.published_or_final_versio
In this paper we demonstrate the power of reconfiguration by presenting efficient randomized algorit...
In this paper we demonstrate the power of reconfiguration by presenting efficient randomized algorit...
Packet routing is an important problem in parallel computation since a single step of inter-processo...
Routing with locality is studied for meshes with buses. In this problem, packets' distances are boun...
AbstractThe architecture of “mesh of buses” is an important model in parallel computing. Its main ad...
Mesh connected computers have become attractive models of computing because of their varied special ...
We prove a 0.691n lower bound for the permutation routing problem in nxn meshes with row and column ...
Mesh connected computers have become attractive models of computing because of their varied special ...
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...
The architecture of 'mesh of buses' is an important model in parallel computing. Its main ...
We consider the problem of routing packets on an n \Theta \Delta \Delta \Delta \Theta n MIMD mesh-co...
Given the permutation routing problem on mesh-connected arrays with a known maximum distance, d, bet...
AbstractThe mesh of buses (MBUS) is a parallel computation model which consists of n×n processors, n...
Abstract Mesh connected computers have become attractive models of com-puting because of their varie...
In this paper we demonstrate the power of reconfiguration by presenting efficient randomized algorit...
In this paper we demonstrate the power of reconfiguration by presenting efficient randomized algorit...
Packet routing is an important problem in parallel computation since a single step of inter-processo...
Routing with locality is studied for meshes with buses. In this problem, packets' distances are boun...
AbstractThe architecture of “mesh of buses” is an important model in parallel computing. Its main ad...
Mesh connected computers have become attractive models of computing because of their varied special ...
We prove a 0.691n lower bound for the permutation routing problem in nxn meshes with row and column ...
Mesh connected computers have become attractive models of computing because of their varied special ...
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...
The architecture of 'mesh of buses' is an important model in parallel computing. Its main ...
We consider the problem of routing packets on an n \Theta \Delta \Delta \Delta \Theta n MIMD mesh-co...
Given the permutation routing problem on mesh-connected arrays with a known maximum distance, d, bet...
AbstractThe mesh of buses (MBUS) is a parallel computation model which consists of n×n processors, n...
Abstract Mesh connected computers have become attractive models of com-puting because of their varie...
In this paper we demonstrate the power of reconfiguration by presenting efficient randomized algorit...
In this paper we demonstrate the power of reconfiguration by presenting efficient randomized algorit...
Packet routing is an important problem in parallel computation since a single step of inter-processo...
DOI
Add to ORKG