Communication in parallel systems

DOI10.1007/BFB0037394zbMATH Open1541.68022MaRDI QIDQ6560186FDOQ6560186

Authors: Friedhelm Meyer auf der Heide, Christian Scheideler 

Publication date: 21 June 2024

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

Mathematics Subject Classification ID

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

Cites Work

• Title not available (Why is that?)
• Routing, merging, and sorting on parallel models of computation
• A guided tour of Chernoff bounds
• Edge separators for graphs of bounded genus with applications
• How to emulate shared memory
• Packet routing and job-shop scheduling in \(O\) (congestion + dilation) steps
• Routing Permutations on Graphs via Matchings
• Title not available (Why is that?)
• A Scheme for Fast Parallel Communication
• Randomized Routing and Sorting on Fixed-Connection Networks
• A packet routing protocol for arbitrary networks
• Tight bounds for oblivious routing in the hypercube
• Title not available (Why is that?)
• An optimal time bound for oblivious routing
• Title not available (Why is that?)
• 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)