Methods for message routing in parallel machines

DOI10.1016/0304-3975(94)90163-5zbMath0811.68087OpenAlexW2148488875MaRDI QIDQ1330418

Leighton, Tom

Publication date: 20 September 1994

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0304-3975(94)90163-5

zbMATH Keywords

parallel machinesrouting

Mathematics Subject Classification ID

Network design and communication in computer systems (68M10) Distributed algorithms (68W15)

Related Items (4)

Simulating shared memory in real time: On the computation power of reconfigurable architectures ⋮ Trade-offs between communication throughput and parallel time ⋮ Adaptive packet routing for bursty adversarial traffic ⋮ Bounding Residence Times for Atomic Dynamic Routings

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Communication complexity of PRAMs
• Sorting in \(c \log n\) parallel steps
• Routing, merging, and sorting on parallel models of computation
• A unified theory of interconnection network structure
• Competitive snoopy caching
• Communication-efficient parallel algorithms for distributed random-access machines
• Ramanujan graphs
• On the complexity of an optimal non-blocking commutation scheme without reorganization
• The uniform memory hierarchy model of computation
• Tight Bounds on the Complexity of Parallel Sorting
• Relations between Concurrent-Write Models of Parallel Computation
• Efficient dispersal of information for security, load balancing, and fault tolerance
• A Self-Routing Benes Network and Parallel Permutation Algorithms
• Randomized Routing and Sorting on Fixed-Connection Networks
• Deadlock-Free Message Routing in Multiprocessor Interconnection Networks
• Permutation Groups, Complexes, and Rearrangeable Connecting Networks
• A Permutation Network

This page was built for publication: Methods for message routing in parallel machines