English (United Kingdom)

https://curated-unify.zendy.io/wp-json/zendy-region/v1/featured_content/oa?rat=en

https://curated-unify.zendy.io/wp-json/zendy-region/v1/highlighted_journal/

Global: Zendy Plus annual

Presents the access of premium content as premium feature

Premium Content

Presents the keyphrase highlighting as premium feature

Keyphrase Highlighting

Presents the summarisation as premium feature

Summarisation

Insights

Presents the pdf analysis as premium feature

PDF Analysis

Presents the zaia usage as premium feature

ZAIA

Global: Zendy Plus monthly

Global: Zendy Tools annual

Global: Zendy Tools monthly

Global: Zendy Free Plan

The bulk-synchronous parallel (BSP) model provides a framework for writingparallel programs with predictable performance. In this paper we extend the BSPmodel to support what we will call pseudo-streaming algorithms foraccelerators. We also generalize the BSP cost function to these algorithms, sothat it is possible to predict the running time for programs targetingmany-core accelerators and to identify possible bottlenecks. Several examplesof algorithms within this new framework will be explored. We extend the BSPlibstandard by proposing a small number of new BSP primitives to create and usestreams in a portable way. We will introduce a software library called EpiphanyBSP that implements these ideas for the Parallella development board. Finallywe will give experimental results for pseudo-streaming algorithms on theParallella platform.

Bulk-synchronous pseudo-streaming algorithms for many-core accelerators