The next generation of supercomputers will break the exascale barrier. Soon we will have
systems capable of at least one quintillion (billion billion) floating-point operations per …

We present Task Bench, a parameterized benchmark designed to explore the performance
of distributed programming systems under a variety of application scenarios. Task Bench …

Fortran DO CONCURRENT has emerged as a new way to achieve parallel execution of
loops on CPUs and GPUs. This paper studies the performance portability of this construct on …

Many scientific high performance codes that simulate eg black holes, coastal waves, climate
and weather, etc. rely on block-structured meshes and use finite differencing methods to …

We present control replication, a technique for generating high-performance and scalable
SPMD code from implicitly parallel programs. In contrast to traditional parallel programming …

Abstract Asynchronous Many-Task (AMT) runtime systems take advantage of multi-core
architectures with light-weight threads, asynchronous executions, and smart scheduling. In …

The decreasing size of transistors has been critical to the increase in capacity of
supercomputers. The smaller the transistors are, less energy is required to flip a bit, and thus …

Prefetching is a well-known technique to mitigate scalability challenges in the Partitioned
Global Address Space (PGAS) model. It has been studied as either an automated compiler …

Quantum computing represents a paradigm shift requiring reconceptualization of algorithms,
architectures, and software. Although much is new, there is much that quantum computing …

Evaluating data parallelism in C++ using the Parallel Research Kernels Page 1 Evaluating
data parallelism in C++ using the Parallel Research Kernels Jeff R. Hammond jeff.r.hammond@intel.com …