Communication primitives for BSP computers

DOI10.1016/0020-0190(96)00073-7MaRDI QIDQ671264zbMATH OpenOpenAlexWikidataFDO

Authors Ben H. H. Juurlink, Harry A. G. Wijshoff

Publication date 27 February 1997

Published in Information Processing Letters (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/0020-0190(96)00073-7

zbMATH Keywords

parallel algorithmscommunication operationsparallel computation models

Mathematics Subject Classification ID

Parallel algorithms in computer science (68W10)

Recommendations

• Direct bulk-synchronous parallel algorithms
• The bulk-synchronous parallel random access machine
• scientific article; zbMATH DE number 1490004
• Communication in parallel systems : Models, algorithms and implementations
• Communication-Efficient Parallel Sorting

Cites work

• scientific article; zbMATH DE number 1142307 (Why is no real title available?)
• Direct bulk-synchronous parallel algorithms
• Load balancing and routing on the hypercube and related networks
• On the Number of Stable States in a NOR Network
• Ultracomputers

Cited in

(11)

• An alternative implementation of communication primitives
• Pipelined Decomposable BSP Computers
• BSP-style computation: A semantic investigation
• scientific article; zbMATH DE number 1863308 (Why is no real title available?)
• Communication in the LARPBS (optical bus) model: A case study
• An architecture independent study of parallel segment trees
• Communication in parallel systems : Models, algorithms and implementations
• scientific article; zbMATH DE number 2102052 (Why is no real title available?)
• A bridging model for multi-core computing
• Communication efficient BSP algorithm for all nearest smaller values problem
• JBSP: A BSP programming library in Java

This page was built for publication: Communication primitives for BSP computers

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