Direct bulk-synchronous parallel algorithms
From MaRDI portal
Recommendations
- Bulk synchronous parallel algorithms for the external memory model
- Parallel algorithms
- Parallel algorithms
- scientific article; zbMATH DE number 3889284
- Parallelization of the Buchberger algorithm
- Parallelization of implementations of purely sequential algorithms
- Bulk-synchronous parallel Gaussian elimination
- scientific article; zbMATH DE number 43583
Cites work
- scientific article; zbMATH DE number 177800 (Why is no real title available?)
- scientific article; zbMATH DE number 3586221 (Why is no real title available?)
- scientific article; zbMATH DE number 1142307 (Why is no real title available?)
- Fast probabilistic algorithms for Hamiltonian circuits and matchings
- Increasing the efficiency of quicksort
- Parallel permutation and sorting algorithms and a new generalized connection network
- Quicksort
- Samplesort: A Sampling Approach to Minimal Storage Tree Sorting
Cited in
(20)- ERCW PRAMs and optical communication
- Models, languages, and compiler technology for high performance computers
- Basic techniques for numerical linear algebra on bulk synchronous parallel computers
- Randomized parallel list ranking for distributed memory multiprocesors
- Axiomatization and characterization of BSP algorithms
- Analytical estimation of the scalability of iterative numerical algorithms on distributed memory multiprocessors
- Truly efficient parallel algorithms: 1-optimal multisearch for an extension of the BSP model
- scientific article; zbMATH DE number 1754593 (Why is no real title available?)
- scientific article; zbMATH DE number 1728438 (Why is no real title available?)
- Bulk synchronous parallel algorithms for the external memory model
- Strategy-accurate parallel Buchberger algorithms
- A bridging model for multi-core computing
- scientific article; zbMATH DE number 2086796 (Why is no real title available?)
- The bulk-synchronous parallel random access machine
- Efficient parallel graph algorithms for coarse grained multicomputers and BSP
- Merging on the BSP model
- Portable and architecture independent parallel performance tuning using BSP.
- Unbounded and bounded parallelism in BMF. Case-study: rank sorting
- Communication primitives for BSP computers
- scientific article; zbMATH DE number 2086773 (Why is no real title available?)
This page was built for publication: Direct bulk-synchronous parallel algorithms
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5056124)