In the past few decades, a number of user-level threading and tasking models have been
proposed in the literature to address the shortcomings of OS-level threads, primarily with …

This poster introduces SLAW, a Scalable Locality-aware Adaptive Work-stealing scheduler.
The SLAW features an adaptive task scheduling algorithm combined with a locality-aware …

Load balancing techniques (eg work stealing) are important to obtain the best performance
for distributed task scheduling systems that have multiple schedulers making scheduling …

Computer systems anticipated in the 2015–2020 timeframe are referred to as Extreme Scale
because they will be built using massive multi-core processors with 100's of cores per chip …

Abstract Partitioned Global Address Space languages like UPC offer a convenient way of
expressing large shared data structures, especially for irregular structures that require …

On shared-memory systems, Cilk-style work-stealing has been used to effectively parallelize
irregular task-graph based applications such as Unbalanced Tree Search (UTS). There are …

Existing dynamic race detectors suffer from at least one of the following three limitations:(i)
space overhead per memory location grows linearly with the number of parallel threads [13] …

Extreme Scale processors containing hundreds or even thousands of cores will challenge
current operating system (OS) practices. Many of the fundamental assumptions that underlie …

Effective combination of inter-node and intra-node parallelism is recognized to be a major
challenge for future extreme-scale systems. Many researchers have demonstrated the …

A major productivity hurdle for parallel programming is the presence of data races. Data
races can lead to all kinds of harmful program behaviors, including determinism violations …