On the effectiveness of D-BSP as a bridging model of parallel computation

DOI10.1007/3-540-45718-6_63MaRDI QIDQ2779599zbMATH OpenFDO

Authors Gianfranco Bilardi, Carlo Fantozzi, Andrea Pietracaprina, Geppino Pucci

Publication date 15 April 2002

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

Full work available at URL http://link.springer.de/link/service/series/0558/bibs/2074/20740579

Mathematics Subject Classification ID

Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10) Computing methodologies and applications (68U99)

Recommendations

• Decomposable bulk synchronous parallel computers
• BSP versus LogP
• The bulk-synchronous parallel random access machine
• H-BSP: Hierarchical BSP computation model
• Can a shared-memory model serve as a bridging model for parallel computation?

Cited in

(6)

• Emulations between QSM, BSP and LogP: A framework for general-purpose parallel algorithm design.
• Delta-stepping synchronous parallel model
• Pipelined decomposable BSP computers
• Pipelined Decomposable BSP Computers
• A bridging model for multi-core computing
• Oblivious algorithms for multicores and networks of processors

This page was built for publication: On the effectiveness of D-BSP as a bridging model of parallel computation

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