6 search results - page 1 / 2 » Nearly Optimal One-To-Many Parallel Routing in Star Networks |
IPPS
1997
IEEE
13 years 11 months ago
1997
IEEE
Star networks were proposedrecently as an attractive alternative to the well-known hypercube models for interconnection networks. Extensive research has been performed that shows ...
EUROPAR
2004
Springer
14 years 6 days ago
2004
Springer
In hot-potato (deflection) routing, nodes in the network have no buffers for packets in transit, so that some conflicting packets must be deflected away from their destination...
ISPA
2005
Springer
14 years 9 days ago
2005
Springer
In order to investigate the routing aspects of small-world networks, Kleinberg [13] proposes a network model based on a d-dimensional lattice with long-range links chosen at random...
ICPP
2003
IEEE
14 years 2 days ago
2003
IEEE
In this paper, we propose a priority-based balanced routing scheme, called the priority STAR routing scheme, which leads to optimal throughput and average delay at the same time f...
IPPS
1998
IEEE
13 years 11 months ago
1998
IEEE
This paper shows the power of randomization in designing e cient parallel algorithms for the problems of routing and PRAM emulation. We show that with randomization techniques opti...