Efficient Schemes for Parallel Communication
From MaRDI portal
Recommendations
- A fast parallel algorithm for routing in permutation networks
- Randomized parallel communications on an extension of the omega network
- Doubly Logarithmic Communication Algorithms for Optical-Communication Parallel Computers
- Optimal routing algorithms for mesh-connected processor arrays
- Packet Routing on grids of processors
Cited in
(33)- Optimal cover time for a graph-based coupon collector process
- scientific article; zbMATH DE number 2102734 (Why is no real title available?)
- Delay-insensitive pipelined communication on parallel buses
- Scheduling trains with small stretch on a unidirectional line
- THE COMMUNICATION MACHINE
- Communication in parallel systems
- On the size of permutation networks and consequences for efficient simulation of hypercube algorithms on bounded-degree networks
- Performance analysis of interprocessor communications in an electronic switching system with distributed control
- scientific article; zbMATH DE number 1862256 (Why is no real title available?)
- Communication-efficient parallel algorithms for distributed random-access machines
- Communication aspects of networks based on geometric incidence relations
- scientific article; zbMATH DE number 1156669 (Why is no real title available?)
- The generalized packet routing problem
- Routing, merging, and sorting on parallel models of computation
- Efficient Internode Communications in Reconfigurable Binary Trees
- FAST, EFFICIENT MUTUAL AND SELF SIMULATIONS FOR SHARED MEMORY AND RECONFIGURABLE MESH
- Shared memory simulations with triple-logarithmic delay
- Efficient PRAM simulation on a distributed memory machine
- Oblivious routing with limited buffer capacity
- scientific article; zbMATH DE number 3938553 (Why is no real title available?)
- Tight bounds for oblivious routing in the hypercube
- Methods for message routing in parallel machines
- Sparse Semi-Oblivious Routing: Few Random Paths Suffice
- Doubly Logarithmic Communication Algorithms for Optical-Communication Parallel Computers
- A \(\sqrt {N \over G}\) method for generating communication
- Survey on oblivious routing strategies
- Communication throughput of interconnection networks
- Stochastic analysis of dynamic processes
- Towards a better understanding of pure packet routing
- Singletons for simpletons revisiting windowed backoff with Chernoff bounds
- Simulating shared memory in real time: On the computation power of reconfigurable architectures
- Data communication in parallel architectures
- On the theory of interconnection networks for parallel computers
This page was built for publication: Efficient Schemes for Parallel Communication
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3765230)
