Implementation of hierarchical F-channels for high-performance distributed computing

DOI10.1007/BF02242739MaRDI QIDQ5136998zbMATH OpenOpenAlexFDO

Authors Keith Shafer, Mohan L. Ahuja

Publication date 30 November 2020

Published in Distributed Computing (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/bf02242739

zbMATH Keywords

asynchronous communicationcommuniction protocolsF-channelshierachical channelshigh-perfomance computing and communication

Mathematics Subject Classification ID

Distributed systems (68M14) Distributed algorithms (68W15)

Recommendations

• Flush primitives for asynchronous distributed systems
• The counting pyramid: an adaptive distributed counting scheme
• A High Performance Computing Platform Based on a Fibre-Channel Token-Routing Switch-Network
• Two Tools for Interprocess Communication in Distributed Data-Flow Systems
• An inherent bottleneck in distributed counting

Cites work

• Assertions about past and future in Highways: Global flush broadcast and flush-vector-time
• Communicating sequential processes
• Fast batched data transfer with flush channels: a performance analysis
• Flush primitives for asynchronous distributed systems
• The causal ordering abstraction and a simple way to implement it
• Using message passing for distributed programming: proof rules and disciplines

Cited in

(2)

• Fast batched data transfer with flush channels: a performance analysis
• Flush primitives for asynchronous distributed systems

This page was built for publication: Implementation of hierarchical F-channels for high-performance distributed computing

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