A Scheme for Fast Parallel Communication
From MaRDI portal
Publication:3936664
Cited in
(45)- Good permutation codes based on the shuffle-exchange network
- Faster deterministic sorting through better sampling.
- Cryptanalysis of algebraic verifiable delay functions
- Fast fault-tolerant parallel communication and on-line maintenance for hypercubes using information dispersal
- Direct routing: Algorithms and complexity
- Probabilistic NetKAT
- A new digraphs composition with applications to de Bruijn and generalized de Bruijn digraphs
- Communication throughput of interconnection networks
- A real-time algorithm for the \((n^{2}-1)\)-puzzle
- Optimal randomized parallel algorithms for computational geometry
- Some permutation routing algorithms for low-dimensional hypercubes
- A data parallel finite element method for computational fluid dynamics on the Connection Machine system
- Leveraging parameterized Chernoff bounds for simplified algorithm analyses
- On the benefit of supporting virtual channels in wormhole routers
- Analysis of minimal path routing schemes in the presence of faults
- Tiara: a self-stabilizing deterministic skip list and skip graph
- Constructing disjoint paths on expander graphs
- Tight bounds for oblivious routing in the hypercube
- Bsp2omp: A Compiler For Translating Bsp Programs To Openmp
- Parallel methods for initial value problems
- Efficient delay routing
- Towards a better understanding of pure packet routing
- Distributed match-making
- Bounds on tradeoffs between randomness and communication complexity
- scientific article; zbMATH DE number 7651175 (Why is no real title available?)
- Communication aspects of networks based on geometric incidence relations
- Randomized oblivious integral routing for minimizing power cost
- Compromises and rewards: stable and non-manipulable probabilistic matching
- Towards a scalable and robust DHT
- Oblivious routing with limited buffer capacity
- Embedding grids into hypercubes
- On the theory of interconnection networks for parallel computers
- Randomized routing on generalized hypercubes
- Communication-efficient parallel algorithms for distributed random-access machines
- Fast algorithms for bit-serial routing on a hypercube
- Graph Sparsification, Spectral Sketches, and Faster Resistance Computation via Short Cycle Decompositions
- Oblivious routing for sensor network topologies
- A nearly optimal parallel algorithm for constructing maximal independent set in planar graphs
- Beyond the worst-case bisection bound: Fast sorting and ranking on meshes
- A fast distributed deadlock- detection algorithm for hypercube
- Low time complexity algorithms for path computation in Cayley graphs
- Optimal routing algorithms for mesh-connected processor arrays
- Oblivious bounds on the probability of boolean functions
- A new look at fault-tolerant network routing
- Communication in parallel systems
This page was built for publication: A Scheme for Fast Parallel Communication
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3936664)
