Oblivious routing with limited buffer capacity

Journal of Computer and System Sciences

Volumn 43, Issue 2, 1991, Pages 317-327

  Krizanc, Danny ^a  

^a UNIVERSITY OF ROCHESTER   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTER NETWORKS; COMPUTER SYSTEMS, DIGITAL - DISTRIBUTED; MATHEMATICAL TECHNIQUES - COMBINATORIAL MATHEMATICS; MATHEMATICAL TECHNIQUES - GRAPH THEORY;

BUFFERED COMMUNICATION; INTERCONNECTION NETWORKS; OBLIVIOUS ROUTING; PERMUTATION NETWORKS;

DATA TRANSMISSION;

EID: 0026237723     PISSN: 00220000     EISSN: 10902724     Source Type: Journal    
DOI: 10.1016/0022-0000(91)90017-Y     Document Type: Article

References (19)

1. Randomized parallel communications
2. Routing, merging, and sorting on parallel models of computation
3. Multistage interconnection networks for multiprocessor systems
4. A time-randomness tradeoff for oblivious routing
5. Optimal routing algorithms for meshconnected processor arrays
6. Routing and sorting on mesh-connected arrays
7. Interconnections between processors and memory modules using the shuffle-exchange network
8. Universal packet routing algorithms
9. A 2n − 2 step algorithm for routing in an n x n array with constant size queues
10. Parallel communication with limited buffers
11. Efficient Dispersal of Information for Security Load Balancing and Fault Tolerance
12. How to emulate a shared memory
13. Equivalence of Message Scheduling Algorithms for Parallel Comunication
14. Ultracomputers
15. Efficient schemes for parallel communication
16. Parallel computation
17. A scheme for fast parallel communication
18. Universal schemes for parallel communication,