Skip to search formSkip to main contentSkip to account menu

Bulk synchronous parallel

Known as: BSP, Superstep 
The Bulk Synchronous Parallel (BSP) abstract computer is a bridging model for designing parallel algorithms. It serves a purpose similar to the… 
Wikipedia (opens in a new tab)

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2015
2015
In this work we attempt to answer the following question: How large a graph can we process using a vertex-centric model of… 
2014
2014
Tools and methods able to simplify the development process of parallel software, but also to assure a high level of performance… 
2009
2009
In this paper, we present efficient, scalable, and portable parallel algorithms for the off-line clustering, the on-line… 
2007
2007
In order to ease programming of heterogeneous architectures with explicitly managed memory hierarchies such as the CELL processor… 
2002
2002
  • L. YangR. E. Shaw
  • 2002
  • Corpus ID: 11345908
In this paper, an improved version of the BiCGStab method for the solutions of large and sparse linear systems of equations with… 
2001
2001
The Bulk Synchronous Parallel (BSP) model was simply introduced, and the advantage of the parapllel program's design and… 
1999
1999
For the solutions of unsymmetric linear systems of equations, we have proposed an improved version of the quasi-minimal residual… 
1998
1998
In this paper we conduct an in-depth study of the communication costs of programs when run on a typical Symmetric MultiProcessor… 
1995
1995
All the parallel discrete-event simulation algorithms developed so far have been designed to suit a speciic parallel model (e.g… 
1994
1994
Abstract For parallel programs to become portable, they must be executable with uniform efficiency on a variety of hardware…