A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is application/pdf
.
Parallel Algorithm Design with Coarse-Grained Synchronization
[chapter]
2001
Lecture Notes in Computer Science
We describe the Queuing Shared-Memory (QSM) and Bulk-Synchronous Parallel (BSP) models of parallel computation. The former is shared-memory and the latter is distributed-memory. Both models use the 'bulk-synchronous' paradigm introduced by the BSP model. We describe the relationship of these two models to each other and to the 'LogP' model, and give an overview of algorithmic results on these models.
doi:10.1007/3-540-45718-6_67
fatcat:2uzbyas4z5ajjku5wt67s5d2lu