Doubly Logarithmic Communication Algorithms for Optical-Communication Parallel Computers

DOI10.1137/S0097539793259483MaRDI QIDQ4376169zbMATH OpenOpenAlexFDO

Authors

Publication date 10 February 1998

Published in SIAM Journal on Computing (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1137/s0097539793259483

zbMATH Keywords

optical networksparallel algorithmsrandomized algorithmsrouting

Mathematics Subject Classification ID

Combinatorics in computer science (68R05) Distributed algorithms (68W15)

Recommendations

• An $\Omega(\sqrt{\,\log\log n}\,)$ Lower Bound for Routing in Optical Networks
• Efficient Schemes for Parallel Communication
• An Optical Simulation of Shared Memory
• Efficient collective communciation in optical networks
• Optimal broadcast for fully connected processor-node networks

Cited in

(10)

• Gossiping and broadcasting versus computing functions in networks.
• scientific article; zbMATH DE number 1670676 (Why is no real title available?)
• Scheduling parallel communication: The \(h\)-relation problem
• Efficient Schemes for Parallel Communication
• Delayed path coupling and generating random permutations
• Self-Simulation for the Passive Optical Star
• ON SOLVING MULTIMESSAGE MULTICASTING PROBLEMS
• Self-simulation for the Passive Optical Star model
• Thinning protocols for routing \(h\)-relations over shared media
• Communication models for a free-space optical cross-connect switch

This page was built for publication: Doubly Logarithmic Communication Algorithms for Optical-Communication Parallel Computers

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4376169)