ACM DL

Parallel Computing (TOPC)

Menu

Search Issue
enter search term and/or author name

Archive


ACM Transactions on Parallel Computing (TOPC) - Special Issue on PPOPP 2014, Volume 2 Issue 4, March 2016



Section: Special Issue for PPoPP 2014

Introduction to the Special Issue on PPoPP’14
James Larus, Sandhya Dwarkadas, José Moreira, Andrew Lumsdaine
Article No.: 21
DOI: 10.1145/2856513

Well-Structured Futures and Cache Locality
Maurice Herlihy, Zhiyu Liu
Article No.: 22
DOI: 10.1145/2858650

In fork-join parallelism, a sequential program is split into a directed acyclic graph of tasks linked by directed dependency edges, and the tasks are executed, possibly in parallel, in an order consistent with their dependencies. A popular and...

Concurrency Testing Using Controlled Schedulers: An Empirical Study
Paul Thomson, Alastair F. Donaldson, Adam Betts
Article No.: 23
DOI: 10.1145/2858651

We present an independent empirical study on concurrency testing using controlled schedulers. We have gathered 49 buggy concurrent software benchmarks, drawn from public code bases, which we call SCTBench. We applied a modified version of...

Leveraging Hardware Message Passing for Efficient Thread Synchronization
Darko Petrović, Thomas Ropars, André Schiper
Article No.: 24
DOI: 10.1145/2858652

As the level of parallelism in manycore processors keeps increasing, providing efficient mechanisms for thread synchronization in concurrent programs is becoming a major concern. On cache-coherent shared-memory processors, synchronization...

X10 and APGAS at Petascale
Olivier Tardieu, Benjamin Herta, David Cunningham, David Grove, Prabhanjan Kambadur, Vijay Saraswat, Avraham Shinnar, Mikio Takeuchi, Mandana Vaziri, Wei Zhang
Article No.: 25
DOI: 10.1145/2894746

X10 is a high-performance, high-productivity programming language aimed at large-scale distributed and shared-memory parallel applications. It is based on the Asynchronous Partitioned Global Address Space (APGAS) programming model, supporting the...

Low-Rank Methods for Parallelizing Dynamic Programming Algorithms
Saeed Maleki, Madanlal Musuvathi, Todd Mytkowicz
Article No.: 26
DOI: 10.1145/2884065

This article proposes efficient parallel methods for an important class of dynamic programming problems that includes Viterbi, Needleman-Wunsch, Smith-Waterman, and Longest Common Subsequence. In dynamic programming, the subproblems that do not...

On Folded-Clos Networks with Deterministic Single-Path Routing
Xin Yuan, Wickus Nienaber, Santosh Mahapatra
Article No.: 27
DOI: 10.1145/2858654

Folded-Clos networks, also known as fat-trees, have been widely used as interconnects in large-scale high-performance computing clusters. Although users often treat such interconnects as replacements of nonblocking crossbar switches that can carry...

MASA: A Multiplatform Architecture for Sequence Aligners with Block Pruning
Edans F. De O. Sandes, Guillermo Miranda, Xavier Martorell, Eduard Ayguade, George Teodoro, Alba C. M. A. De Melo
Article No.: 28
DOI: 10.1145/2858656

Biological sequence alignment is a very popular application in Bioinformatics, used routinely worldwide. Many implementations of biological sequence alignment algorithms have been proposed for multicores, GPUs, FPGAs and CellBEs. These...