Communication in parallel systems

DOI10.1007/BFB0037394MaRDI QIDQ6560186zbMATH OpenFDO

Authors Friedhelm Meyer auf der Heide, Christian Scheideler

Publication date 21 June 2024

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Network design and communication in computer systems (68M10) Network protocols (68M12)

Recommendations

• On the theory of interconnection networks for parallel computers
• Methods for message routing in parallel machines
• scientific article; zbMATH DE number 2090659
• Efficient Schemes for Parallel Communication
• scientific article; zbMATH DE number 953281

Cites work

• scientific article; zbMATH DE number 52113 (Why is no real title available?)
• scientific article; zbMATH DE number 1256753 (Why is no real title available?)
• scientific article; zbMATH DE number 1256754 (Why is no real title available?)
• scientific article; zbMATH DE number 953281 (Why is no real title available?)
• A Scheme for Fast Parallel Communication
• A guided tour of Chernoff bounds
• A packet routing protocol for arbitrary networks
• An optimal time bound for oblivious routing
• Edge separators for graphs of bounded genus with applications
• How much can hardware help routing?
• How to emulate shared memory
• Packet routing and job-shop scheduling in \(O\) (congestion + dilation) steps
• Randomized Routing and Sorting on Fixed-Connection Networks
• Routing Permutations on Graphs via Matchings
• Routing, merging, and sorting on parallel models of computation
• Tight bounds for oblivious routing in the hypercube

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)