On the theory of interconnection networks for parallel computers
From MaRDI portal
Publication:4632449
DOI10.1007/3-540-58201-0_91zbMath1422.68009OpenAlexW1524918169MaRDI QIDQ4632449
Publication date: 29 April 2019
Published in: Automata, Languages and Programming (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/3-540-58201-0_91
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Bounds on evacuation time for deflection routing
- How to emulate shared memory
- Sorting in \(c \log n\) parallel steps
- Routing, merging, and sorting on parallel models of computation
- Ramanujan graphs
- Tight Bounds on the Complexity of Parallel Sorting
- On the Distribution of the Number of Successes in Independent Trials
- Fast algorithms for bit-serial routing on a hypercube
- Tight bounds for oblivious routing in the hypercube
- A Time-Randomness Trade-Off for Oblivious Routing
- Efficient Schemes for Parallel Communication
- Efficient dispersal of information for security, load balancing, and fault tolerance
- A Scheme for Fast Parallel Communication
- An O (log N ) deterministic packet-routing scheme
- Deadlock-Free Message Routing in Multiprocessor Interconnection Networks
- How much can hardware help routing?
- Fast deflection routing for packets and worms
- A Measure of Asymptotic Efficiency for Tests of a Hypothesis Based on the sum of Observations
This page was built for publication: On the theory of interconnection networks for parallel computers
