Bulk-synchronous pseudo-streaming algorithms for many-core accelerators
Bulk-synchronous pseudo-streaming algorithms for many-core accelerators
复制标题
适用于多核加速器的批量同步伪流算法
DOI：
--
复制
发表时间：
2016
期刊：
影响因子：
--
通讯作者：
A. Wits
中科院分区：
文献类型：
--
作者：
J. Buurlage;T. Bannink;A. Wits
大容量同步并行（BSP）模型为编写具有可预测性能的并行程序提供了一个框架。在本文中，我们扩展了BSP模型来支持我们称之为加速器的伪流算法。我们还将BSP代价函数推广到这些算法中，从而可以预测针对多核加速器的程序的运行时间并识别可能的瓶颈。我们将探讨这个新框架中的几个算法示例。我们通过提出少量新的BSP原语来扩展BSPlib标准，以一种可移植的方式创建和使用流。我们将介绍一个名为Epiphany BSP的软件库，它为parallelella开发板实现了这些想法。最后给出了伪流算法在parallelella平台上的实验结果。
The bulk-synchronous parallel (BSP) model provides a framework for writing parallel programs with predictable performance. In this paper we extend the BSP model to support what we will call pseudo-streaming algorithms for accelerators. We also generalize the BSP cost function to these algorithms, so that it is possible to predict the running time for programs targeting many-core accelerators and to identify possible bottlenecks. Several examples of algorithms within this new framework will be explored. We extend the BSPlib standard by proposing a small number of new BSP primitives to create and use streams in a portable way. We will introduce a software library called Epiphany BSP that implements these ideas for the Parallella development board. Finally we will give experimental results for pseudo-streaming algorithms on the Parallella platform.