As small-scale, shared-memory multiprocessors make their way onto desktops, the high-
performance parallel applications that run on these machines will have to live alongside …

An efficient scheduler is important for task parallelism. It should provide scalable dynamic
load-balancing mechanism among CPU cores. To meet this requirement, most runtime …

The Hood user-level threads library delivers efficient performance under multiprogramming
without any need for kernel-level resource management, such as coscheduling or process …

Work stealing is an effective load-balancing strategy for multithreading, but when
computations based on it underperform, traditional tools can't explain why. To resolve a …

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

Running multithreaded programs in multicore systems has become a common practice for
many application domains. Work stealing is a widely-adopted and effective approach for …

Work stealing is a popular method of scheduling fine-grained parallel tasks. The
performance of work stealing has been extensively studied, both theoretically and …

Multiprocessor scheduling in a shared multiprogramming environment can be structured as
two-level scheduling, where a kernel-level job scheduler allots processors to jobs and a …

Work-stealing is a promising approach for effectively exploiting software parallelism on
parallel hardware. A programmer who uses work-stealing explicitly identifies potential …

Load balancing is one of the key techniques exploited to improve the performance of
parallel programs. However, load balancing is a difficult task for the programmer. Work …