A Scheme for Fast Parallel Communication
DOI10.1137/0211027zbMATH Open0478.94034OpenAlexW2107997203WikidataQ100759369 ScholiaQ100759369MaRDI QIDQ3936664FDOQ3936664
Publication date: 1982
Published in: SIAM Journal on Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1137/0211027
randomizationcommunication networkparallel computersMonte Carlo algorithmnetwork routingdistributed randomized algorithm
Circuits, networks (94C99) Stochastic network models in operations research (90B15) Theory of software (68N99) Software, source code, etc. for problems pertaining to information and communication theory (94-04)
Cited In (46)
- Some permutation routing algorithms for low-dimensional hypercubes
- Tiara: a self-stabilizing deterministic skip list and skip graph
- Bounds on tradeoffs between randomness and communication complexity
- Graph Sparsification, Spectral Sketches, and Faster Resistance Computation via Short Cycle Decompositions
- A fast distributed deadlock- detection algorithm for hypercube
- Communication in parallel systems
- Fast algorithms for bit-serial routing on a hypercube
- Optimal routing algorithms for mesh-connected processor arrays
- Dynamic networks of finite state machines
- Faster deterministic sorting through better sampling.
- Optimal randomized parallel algorithms for computational geometry
- Parallel methods for initial value problems
- Communication-efficient parallel algorithms for distributed random-access machines
- A nearly optimal parallel algorithm for constructing maximal independent set in planar graphs
- Low time complexity algorithms for path computation in Cayley graphs
- Title not available (Why is that?)
- Bsp2omp: A Compiler For Translating Bsp Programs To Openmp
- Compromises and rewards: stable and non-manipulable probabilistic matching
- Communication aspects of networks based on geometric incidence relations
- Probabilistic NetKAT
- Leveraging parameterized Chernoff bounds for simplified algorithm analyses
- Towards a scalable and robust DHT
- Oblivious bounds on the probability of boolean functions
- A new look at fault-tolerant network routing
- Distributed match-making
- Good permutation codes based on the shuffle-exchange network
- Direct routing: Algorithms and complexity
- Randomized oblivious integral routing for minimizing power cost
- Embedding grids into hypercubes
- Fast fault-tolerant parallel communication and on-line maintenance for hypercubes using information dispersal
- Tight bounds for oblivious routing in the hypercube
- Oblivious routing with limited buffer capacity
- A data parallel finite element method for computational fluid dynamics on the Connection Machine system
- Oblivious Routing for Sensor Network Topologies
- A real-time algorithm for the \((n^{2}-1)\)-puzzle
- Cryptanalysis of algebraic verifiable delay functions
- Randomized routing on generalized hypercubes
- Communication throughput of interconnection networks
- On the benefit of supporting virtual channels in wormhole routers
- Analysis of minimal path routing schemes in the presence of faults
- Towards a better understanding of pure packet routing
- Constructing disjoint paths on expander graphs
- A new digraphs composition with applications to de Bruijn and generalized de Bruijn digraphs
- Efficient delay routing
- Beyond the worst-case bisection bound: Fast sorting and ranking on meshes
- On the theory of interconnection networks for parallel computers
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)
