Communication in parallel systems
From MaRDI portal
Publication:6560186
DOI10.1007/BFB0037394zbMATH Open1541.68022MaRDI QIDQ6560186
Christian Scheideler, Friedhelm Meyer auf der Heide
Publication date: 21 June 2024
Network design and communication in computer systems (68M10) Graph theory (including graph drawing) in computer science (68R10) Network protocols (68M12)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- How to emulate shared memory
- An optimal time bound for oblivious routing
- A guided tour of Chernoff bounds
- Routing, merging, and sorting on parallel models of computation
- Edge separators for graphs of bounded genus with applications
- Packet routing and job-shop scheduling in \(O\) (congestion + dilation) steps
- Tight bounds for oblivious routing in the hypercube
- A Scheme for Fast Parallel Communication
- Randomized Routing and Sorting on Fixed-Connection Networks
- Routing Permutations on Graphs via Matchings
- A packet routing protocol for arbitrary networks
- How much can hardware help routing?
This page was built for publication: Communication in parallel systems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6560186)
