This paper presents an unbalanced tree search (UTS) benchmark designed to evaluate the
performance and ease of programming for parallel applications requiring dynamic load …

We propose a novel method to estimate and track the 3D line of sight of a person based on
3D computer vision techniques. Most of the existing nonintrusive gaze tracking methods …

This paper examines MPI's ability to support continuous, dynamic load balancing for
unbalanced parallel applications. We use an unbalanced tree search benchmark (UTS) to …

An asynchronous work-stealing implementation of dynamic load balance is implemented
using Unified Parallel C (UPC) and evaluated using the Unbalanced Tree Search (UTS) …

Dynamic Task Scheduling is an enticing programming model aiming to ease the
development of parallel programs with intrinsically irregular or data-dependent parallelism …

Today a significant fraction of HPC clusters are built from multi-core machines connected via
a high speed interconnect, hence, they have a mix of shared memory and distributed …

Emerging multi-and many-core computer architectures pose new challenges with respect to
efficient exploitation of parallelism. In addition, it is currently not clear which might be the …

Abstract We use three Parallel Research Kernels to compare performance of a set of
programming models (We employ the term programming model as it is commonly used in …

In current systems, while it is necessary to exploit the availability of multiple cores, it is also
mandatory to consume less energy. To speed up the development process and make it as …

Years ago, the C language made strides into the Fortran-dominated field of
highperformance computing (HPC). Recently, a similar trend is that C++ is being used …