Atomic operations (atomics) such as Compare-and-Swap (CAS) or Fetch-and-Add (FAA) are
ubiquitous in parallel programming. Yet, performance tradeoffs between these operations …

Modern processors, in particular within the server segment, integrate more cores with each
generation. This increases their complexity in general, and that of the memory hierarchy in …

This paper compares several alternative binarization algorithms for historical archive
documents, by evaluating their effect on end-to-end word recognition performance in a …

Based on Intel's Many Integrated Core (MIC) architecture, Intel Xeon Phi is one of the few
truly many-core CPUs-featuring around 60 fairly powerful cores, two levels of caches, and …

Increasingly complex memory systems and onchip interconnects are developed to mitigate
the data movement bottlenecks in manycore processors. One example of such a complex …

The high performance computing landscape is shifting from collections of homogeneous
nodes towards heterogeneous systems, in which nodes consist of a combination of …

Many applications in computational sciences and social sciences exploit sparsity and
connectivity of acquired data. Even though many parallel sparse primitives such as sparse …

Exploiting spatial and temporal localities is investigated for efficient row-by-row
parallelization of general sparse matrix-matrix multiplication (SpGEMM) operation of the …

In this work an ultra-scalable algorithm is designed and optimized to accelerate a 3D
compressible Euler atmospheric model on the CPU-MIC hybrid system of Tianhe-2. We first …

Collective operations are among the most important communication operations in shared-
and distributed-memory parallel applications. In this paper, we analyze the tradeoffs …