Almost optimal permutation routing on hypercubes

Conference Proceedings of the Annual ACM Symposium on Theory of Computing

Volumn , Issue , 2001, Pages 530-539

  Vocking B ^a  

^a MAX PLANCK INSTITUTE FOR INFORMATICS   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; BOUNDARY CONDITIONS; COMBINATORIAL MATHEMATICS; CONGESTION CONTROL (COMMUNICATION); NETWORK PROTOCOLS; PACKET NETWORKS;

OPTIMAL PERMUTATIONS;

ROUTERS;

EID: 0034824350     PISSN: 07349025     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/380752.380848     Document Type: Conference Paper

References (20)

1. A parallel algorithmic version of the local lemma
2. A unified approach to off-line permutation routing on parallel networks
3. Routing, merging, and sorting on parallel models of computation
4. Universal algorithms for store-and-forward and wormhole routing
5. Colouring graphs frugally
6. A guided tour of Chernoff bounds
7. Tigth bounds for oblivious routing in the hypercube
8. Oblivious deadlock-free routing in a faulty hypercube
9. Randomized routing and sorting on fixed-connection networks
10. Packet routing and job-shop scheduling in O(congestion + dilation) steps
11. New algorithmic aspects of the local lemma with applications to routing and partitioning
12. Further algorithmic aspects of the local lemma
13. Shortest paths routing in arbitrary networks
14. How to emulate shared memory
15. Efficient schemes for parallel communication
16. Realization of an arbitrary permutation on a hypercube
17. General purpose parallel architectures
18. Universal schemes for parallel communication