Questions and Answers about BSP
Questions and Answers about BSP
复制标题
关于 BSP 的问答
DOI：
10.1155/1997/532130
复制
发表时间：
1997
期刊：
影响因子：
--
通讯作者：
W. Mccoll
中科院分区：
文献类型：
--
作者：
D. Skillicorn;Jonathan M. D. Hill;W. Mccoll
批量同步并行（BSP）是一种从低级程序结构中抽象出来的并行编程模型，它支持超步骤。超级步骤由一组独立的局部计算组成，随后是全局通信阶段和屏障同步。以这种方式构建程序使其成本能够从几个简单的架构参数中精确确定，即通信网络对均匀随机流量的渗透率和同步时间。尽管人们普遍认为排列路由和屏障同步本身就很昂贵，但事实并非如此。因此，BSP强加的结构不会降低性能，同时为应用程序构建带来相当大的好处。本文回答了我们被问到的关于BSP的最常见的问题，并证明了它是并行编程的重要一步。
Bulk Synchronous Parallelism (BSP) is a parallel programming model that abstracts from low-level program structures in favour of supersteps. A superstep consists of a set of independent local computations, followed by a global communication phase and a barrier synchronisation. Structuring programs in this way enables their costs to be accurately determined from a few simple architectural parameters, namely the permeability of the communication network to uniformly-random traffic and the time to synchronise. Although permutation routing and barrier synch ronisations are widely regarded as inherently expensive, this is not the case. As a result, the structure imposed by BSP does not reduce performance, while bringing considerable benefits for application building. This paper answers the most common questions we are asked about BSP and justifies its claim to be a major step forward in parallel programming.