BSP versus LogP

DOI10.1007/PL00008270MaRDI QIDQ1125822zbMATH OpenFDO

Authors Gianfranco Bilardi, Kieran T. Herley, Andrea Pietracaprina, Geppino Pucci, P. G. Spirakis

Publication date 5 September 2000

Published in Algorithmica (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/PL00008270

zbMATH Keywords

BSP modelLogP models

Mathematics Subject Classification ID

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

Recommendations

• Emulations between QSM, BSP and LogP: A framework for general-purpose parallel algorithm design.
• scientific article; zbMATH DE number 1305537
• On stalling in LogP
• Direct bulk-synchronous parallel algorithms
• The bulk-synchronous parallel random access machine

Cited in

(13)

• A new parallel model for the analysis of asynchronous algorithms
• BSP clusters: High performance, reliable and very low cost
• scientific article; zbMATH DE number 1728434 (Why is no real title available?)
• A glimpse at Paul G. Spirakis
• scientific article; zbMATH DE number 1305537 (Why is no real title available?)
• scientific article; zbMATH DE number 2086796 (Why is no real title available?)
• scientific article; zbMATH DE number 1863257 (Why is no real title available?)
• scientific article; zbMATH DE number 1863308 (Why is no real title available?)
• Performance evaluation of practical parallel computer model LogPQ
• scientific article; zbMATH DE number 960172 (Why is no real title available?)
• H-BSP: Hierarchical BSP computation model
• JBSP: A BSP programming library in Java
• A bridging model for multi-core computing

This page was built for publication: BSP versus LogP

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