Decomposable bulk synchronous parallel computers

DOI10.1007/3-540-47849-3_22MaRDI QIDQ4496247zbMATH OpenFDO

Authors Martin Beran

Publication date 13 August 2000

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/3-540-47849-3_22

zbMATH Keywords

bulk synchronous parallel computer

Mathematics Subject Classification ID

Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10)

Recommendations

• Pipelined Decomposable BSP Computers
• The bulk-synchronous parallel random access machine
• Direct bulk-synchronous parallel algorithms
• Pipelined decomposable BSP computers
• Communication primitives for BSP computers

Cited in

(7)

• Memory-efficient matrix multiplication in the BSP model
• The bulk-synchronous parallel random access machine
• On the effectiveness of D-BSP as a bridging model of parallel computation
• Pipelined decomposable BSP computers
• Pipelined Decomposable BSP Computers
• Basic techniques for numerical linear algebra on bulk synchronous parallel computers
• Communication primitives for BSP computers

This page was built for publication: Decomposable bulk synchronous parallel computers

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