In recent years, programmable many-core accelerators (PMCAs) have been introduced in
embedded systems to satisfy stringent performance/Watt requirements. This has increased …

In this paper, we provide comparison of language features and runtime systems of
commonly used threading parallel programming models for high performance computing …

Average programmers struggle to solve performance problems in OpenMP programs with
tasks and parallel for-loops. Existing performance analysis tools visualize OpenMP task …

We introduce Callisto-RTS, a parallel runtime system designed for multi-socket shared-
memory machines. It supports very fine-grained scheduling of parallel loops—down to …

Cholesky factorization is a method for solving linear systems involving symmetric, positive-
definite matrices, and can be an attractive choice in applications where a high degree of …

Models of parallel processing systems typically assume that one has workers and jobs are
split into an equal number of tasks. Splitting jobs into smaller tasks, ie using “tiny tasks”, can …

User-level threads have been widely adopted as a means of achieving lightweight
concurrent execution without the costs of OS-level threads. Nevertheless, the costs of …

We present a hybrid OpenMP/Charm\tt++ framework for solving the O(N) self-consistent-field
eigenvalue problem with parallelism in the strong scaling regime, P≫N, where P is the …

A performance vs. practicality trade-off exists between user-level threading techniques. The
community has settled mostly on a black-and-white perspective; fully fledged threads …

Nowadays, latency-critical, high-performance applications are parallelized even on power-
constrained client systems to improve performance. However, an important scenario of fine …