H-BSP: Hierarchical BSP computation model

DOI10.1023/A:1008113017444MaRDI QIDQ5934285zbMATH OpenOpenAlexFDO

Authors Hojung Cha, Dong Ho Lee

Publication date 6 November 2001

Published in The Journal of Supercomputing (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1023/a:1008113017444

zbMATH Keywords

bulk synchronous parallelH-BSPparallel computing model

Mathematics Subject Classification ID

Recommendations

• The bulk-synchronous parallel random access machine
• Axiomatization and characterization of BSP algorithms
• A practical hierarchical model of parallel computation. I: The model
• Memory-efficient matrix multiplication in the BSP model
• BSP versus LogP

Cited in

(8)

• A practical hierarchical model of parallel computation. I: The model
• A practical hierarchical model of parallel computation. II: Binary tree and FFT algorithms
• A new parallel model for the analysis of asynchronous algorithms
• NestStep: Nested parallelism and virtual shared memory for the BSP model
• Analytical estimation of the scalability of iterative numerical algorithms on distributed memory multiprocessors
• scientific article; zbMATH DE number 1728434 (Why is no real title available?)
• H-BSP
• JBSP: A BSP programming library in Java

This page was built for publication: H-BSP: Hierarchical BSP computation model

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