The bulk-synchronous parallel random access machine

DOI10.1016/S0304-3975(97)00197-7zbMath0902.68072OpenAlexW1986830645MaRDI QIDQ1128714

Alexander Tiskin

Publication date: 13 August 1998

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0304-3975(97)00197-7

zbMATH Keywords

PRAM simulationautomatic memory managementBSP algorithmsBSP computingshared memory simulation

Mathematics Subject Classification ID

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

Related Items

A bridging model for multi-core computing ⋮ 1-optimality of static BSP computations: Scheduling independent chains as a case study. ⋮ A programming model for BSP with partitioned synchronisation ⋮ Communication Lower Bounds of Bilinear Algorithms for Symmetric Tensor Contractions

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Communication complexity of PRAMs
• A complexity theory of efficient parallel algorithms
• Matrix multiplication via arithmetic progressions
• Parallel sorting by regular sampling
• Can a shared-memory model serve as a bridging model for parallel computation?
• On the versatility of parallel sorting by regular sampling
• Computer science today. Recent trends and developments
• Gaussian elimination is not optimal
• Correction: Parallel Merge Sort
• Power balance and apportionment algorithms for the United States Congress
• Merging on the BSP model