The bulk-synchronous parallel random access machine
From MaRDI portal
Recommendations
- Parallelism in random access machines
- scientific article; zbMATH DE number 1490004
- Parallel random access machines with both multiplication and shifts
- Parallel random access machines with bounded memory wordsize
- Bulk synchronous parallel algorithms for the external memory model
- Direct bulk-synchronous parallel algorithms
- Simulation of Parallel Random Access Machines by Circuits
- scientific article; zbMATH DE number 3954278
- Random access machines with multi-dimensional memories
Cites work
- A complexity theory of efficient parallel algorithms
- Can a shared-memory model serve as a bridging model for parallel computation?
- Communication complexity of PRAMs
- Computer science today. Recent trends and developments
- Correction: Parallel Merge Sort
- Gaussian elimination is not optimal
- scientific article; zbMATH DE number 5542185 (Why is no real title available?)
- scientific article; zbMATH DE number 3902654 (Why is no real title available?)
- scientific article; zbMATH DE number 43583 (Why is no real title available?)
- scientific article; zbMATH DE number 107951 (Why is no real title available?)
- scientific article; zbMATH DE number 108004 (Why is no real title available?)
- scientific article; zbMATH DE number 1142306 (Why is no real title available?)
- scientific article; zbMATH DE number 1142307 (Why is no real title available?)
- Matrix multiplication via arithmetic progressions
- Merging on the BSP model
- On the versatility of parallel sorting by regular sampling
- Parallel sorting by regular sampling
- Power balance and apportionment algorithms for the United States Congress
Cited in
(31)- Memory-efficient matrix multiplication in the BSP model
- BSP versus LogP
- BSP linear solvers for dense matrices
- Architecture independent parallel selection with applications to parallel priority queues
- 1-optimality of static BSP computations: Scheduling independent chains as a case study.
- 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
- Axiomatization and characterization of BSP algorithms
- Communication in parallel systems : Models, algorithms and implementations
- scientific article; zbMATH DE number 1728434 (Why is no real title available?)
- scientific article; zbMATH DE number 1728438 (Why is no real title available?)
- Scalable and predictable performance for irregular problems using the WPRAM computational model
- Delta-stepping synchronous parallel model
- scientific article; zbMATH DE number 1305503 (Why is no real title available?)
- scientific article; zbMATH DE number 1161540 (Why is no real title available?)
- scientific article; zbMATH DE number 2009834 (Why is no real title available?)
- scientific article; zbMATH DE number 2080916 (Why is no real title available?)
- scientific article; zbMATH DE number 1490004 (Why is no real title available?)
- scientific article; zbMATH DE number 1754593 (Why is no real title available?)
- scientific article; zbMATH DE number 2086773 (Why is no real title available?)
- Pipelined Decomposable BSP Computers
- scientific article; zbMATH DE number 2102059 (Why is no real title available?)
- Communication lower bounds of bilinear algorithms for symmetric tensor contractions
- Unbounded and bounded parallelism in BMF. Case-study: rank sorting
- 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
- A programming model for BSP with partitioned synchronisation
- Communication primitives for BSP computers
This page was built for publication: The bulk-synchronous parallel random access machine
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1128714)
