Add to ORKGWe study multipacket routing problems. We divide the multipacket routing problem into two classes, namely, distance limited and bisection limited routing problems. Then, we concentrate on rings of processors. Having a full understanding of the multipacket routing problem on rings is essential before trying to attack the problem for the more general case of r-dimensional meshes and tori. We prove a new lower bound of 2n/3 routing steps for the case of distance limited routing problems. We also give an algorithm that tightens this lower bound. For bisection limited problems, we present an algorithm that completes the routing in near optimal time
In this paper, we consider the many-to-one packet routing problem on the mesh parallel architecture....
[[abstract]]Given a ring of size n and a set K of traffic demands, the ring loading problem with dem...
Routing with locality is studied for meshes with buses. In this problem, packets' distances are boun...
We study multipacket routing problems. We divide the multipacket routing problem into two classes, n...
We present deterministic algorithms for k-k routing and k-k sorting on circular processor arrays wi...
We consider the problem of routing packets on an n \Theta \Delta \Delta \Delta \Theta n MIMD mesh-co...
In this paper we present randomized algorithms for k \Gamma k routing, k \Gamma k sorting, and cut ...
k-k Routing, k-k Sorting, and Cut Through Routing on the Mesh In this paper we present randomized al...
In this paper we present randomized algorithms for kk routing, k-k sorting, and cut through routing ...
[[abstract]]Given a ring of size n and a set K of traffic demands, the ring loading problem with dem...
This paper provides an overview of lower and upper bounds for algorithms for mesh-connected processo...
This paper provides an overview of lower and upper bounds for algorithms for mesh-connected processo...
Computer networks are becoming increasingly more complex. Efficient data routing on complex networks...
In this paper we present randomized algorithms for k-k routing, k-k sorting, and cut through routing...
We analyze routing and sorting problems on circular processor arrays with bidirectional connections....
In this paper, we consider the many-to-one packet routing problem on the mesh parallel architecture....
[[abstract]]Given a ring of size n and a set K of traffic demands, the ring loading problem with dem...
Routing with locality is studied for meshes with buses. In this problem, packets' distances are boun...
We study multipacket routing problems. We divide the multipacket routing problem into two classes, n...
We present deterministic algorithms for k-k routing and k-k sorting on circular processor arrays wi...
We consider the problem of routing packets on an n \Theta \Delta \Delta \Delta \Theta n MIMD mesh-co...
In this paper we present randomized algorithms for k \Gamma k routing, k \Gamma k sorting, and cut ...
k-k Routing, k-k Sorting, and Cut Through Routing on the Mesh In this paper we present randomized al...
In this paper we present randomized algorithms for kk routing, k-k sorting, and cut through routing ...
[[abstract]]Given a ring of size n and a set K of traffic demands, the ring loading problem with dem...
This paper provides an overview of lower and upper bounds for algorithms for mesh-connected processo...
This paper provides an overview of lower and upper bounds for algorithms for mesh-connected processo...
Computer networks are becoming increasingly more complex. Efficient data routing on complex networks...
In this paper we present randomized algorithms for k-k routing, k-k sorting, and cut through routing...
We analyze routing and sorting problems on circular processor arrays with bidirectional connections....
In this paper, we consider the many-to-one packet routing problem on the mesh parallel architecture....
[[abstract]]Given a ring of size n and a set K of traffic demands, the ring loading problem with dem...
Routing with locality is studied for meshes with buses. In this problem, packets' distances are boun...