On further reducing the cost of parallel pipelined message broadcasts

DOI10.1080/00207160600845203MaRDI QIDQ3423749zbMATH OpenOpenAlexFDO

Authors Stavros Souravlas, Manos Roumeliotis

Publication date 15 February 2007

Published in International Journal of Computer Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1080/00207160600845203

zbMATH Keywords

block cyclic redistributionindex computation overheadsparallel pipelined messagestransmission cost

Mathematics Subject Classification ID

Network design and communication in computer systems (68M10)

Recommendations

• Bounds on the Efficiency of Message-Passing Protocols for Parallel Computers
• ON THE PARALLEL IMPLEMENTATION OF A GENERALIZED BROADCAST
• Efficient parallel prefix algorithms on multiport message-passing systems
• scientific article; zbMATH DE number 2089187
• Message and time efficient multi-broadcast schemes
• Distributed MST and broadcast with fewer messages, and faster gossiping

Cites work

• A compressed diagonals remapping technique for dynamic data redistribution on banded sparse matrix
• A framework for efficient data redistribution on distributed memory multicomputers
• A pipeline technique for dynamic data transfer on a multiprocessor grid
• Efficient algorithms for block-cyclic redistribution of arrays
• scientific article; zbMATH DE number 2040815 (Why is no real title available?)
• Optimizations for efficient array redistribution on distributed memory multicomputers.

Cited in

(1)

• A parallelized artificial immune network for fuzzy clustering

This page was built for publication: On further reducing the cost of parallel pipelined message broadcasts

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