A bridging model for multi-core computing

DOI10.1016/j.jcss.2010.06.012zbMath1210.68134OpenAlexW1991300218WikidataQ59446830 ScholiaQ59446830MaRDI QIDQ619912

Leslie G. Valiant

Publication date: 18 January 2011

Published in: Journal of Computer and System Sciences (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.jcss.2010.06.012

zbMATH Keywords

parallel algorithmsmulti-corebridging modelbulk synchronous

Mathematics Subject Classification ID

Parallel algorithms in computer science (68W10) Computer system organization (68M99)

Related Items (10)

Analytical estimation of the scalability of iterative numerical algorithms on distributed memory multiprocessors ⋮ The role of concurrency in an evolutionary view of programming abstractions ⋮ Oblivious algorithms for multicores and networks of processors ⋮ Abstract machines, optimal reduction, and streams ⋮ What Hill-Marty model learn from and break through Amdahl's law? ⋮ Accurate Manycore-Accelerated Manifold Surface Remesh Kernels ⋮ Tree projections and constraint optimization problems: fixed-parameter tractability and parallel algorithms ⋮ Unnamed Item ⋮ Axiomatization and characterization of BSP algorithms ⋮ A distributed argumentation algorithm for mining consistent opinions in weighted Twitter discussions

Uses Software

• BSPlib
• BSGP

Cites Work

• Communication complexity of PRAMs
• Memory-efficient matrix multiplication in the BSP model
• BSP versus LogP
• The bulk-synchronous parallel random access machine
• Parallel sorting by regular sampling
• The uniform memory hierarchy model of computation
• Algorithms for parallel memory. II: Hierarchical multilevel memories
• Efficient parallel graph algorithms for coarse-grained multicomputers and BSP
• Communication lower bounds for distributed-memory matrix multiplication
• Parallelism in random access machines
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: A bridging model for multi-core computing