Exchanging messages of different sizes

DOI10.1016/J.JPDC.2005.06.003MaRDI QIDQ2369642zbMATH OpenOpenAlexFDO

Authors Alfredo Goldman, Joseph G. Peters, Denis Trystram

Publication date 22 May 2006

Published in Journal of Parallel and Distributed Computing (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.jpdc.2005.06.003

zbMATH Keywords

BSP modelcommunication primitivespersonalized communications

Mathematics Subject Classification ID

Network design and communication in computer systems (68M10) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20)

Recommendations

• Multiphase complete exchange: a theoretical analysis
• scientific article; zbMATH DE number 861430
• Optimal algorithms for total exchange without buffering on the hypercube
• ON SOLVING MULTIMESSAGE MULTICASTING PROBLEMS
• On the average communication complexity of asynchronous distributed algorithms

Cited in

(4)

• scientific article; zbMATH DE number 861430 (Why is no real title available?)
• Variants of spreading messages
• An algorithm for FIFO message delivery among migrating tasks
• Recommendation generation algorithms for scheduling of data exchange through a channel with centralized control

This page was built for publication: Exchanging messages of different sizes

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