This paper studies the data locality of the work-stealing scheduling algorithm on hardware-
controlled shared-memory machines. We present lower and upper bounds on the number of …

Abstract dynamic load-balancing on hierarchical platforms. In particular, we consider
applications involving heavy communications on a distributed platform. The work-stealing …

We compare the number of cache misses M 1 for running a computation on a single
processor with cache size C 1 to the total number of misses Mp for the same computation …

We present a user-level thread scheduler for shared-memory multiprocessors, and we
analyze its performance under multiprogramming. We model multiprogramming with two …

Work stealing has proven to be an effective method for scheduling parallel programs on
multicore computers. To achieve high performance, work stealing distributes tasks between …

Load balancing is a technique which allows efficient parallelization of irregular workloads,
and a key component of many applications and parallelizing runtimes. Work-stealing is a …

For nested-parallel computations with low depth (span, critical path length) analyzing the
work, depth, and sequential cache complexity suffices to attain reasonably strong bounds on …

This paper studies the problem of efficiently schedulling fully strict (ie, well-structured)
multithreaded computations on parallel computers. A popular and practical method of …

Irregular and dynamic parallel applications pose significant challenges to achieving
scalable performance on large-scale multicore clusters. These applications often 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 …