The cost of data movement has always been an important concern in high performance
computing (HPC) systems. It has now become the dominant factor in terms of both energy …

When writing automated unit tests, developers often deal with software artifacts that have
several dependencies. In these cases, one has the possibility of either instantiating the …

We present three lock-free data structures for priority task scheduling: a priority work-stealing
one, a centralized one with ρ-relaxed semantics, and a hybrid one combining both concepts …

Programming Abstractions for Data Locality Page 1 Programming Abstractions for Data Locality
Item Type Technical Report Authors Tate, Adrian;Kamil, Amir;Dubey, Anshu;Groblinger …

Actors are a popular mechanism for indirectly expressing concurrency. This article examines
an implementation in the concurrent dialect of C++, μ μ C++, which runs actors on shared …

Competitive and cooperative threading are widely used abstractions in computing. In
competitive threading, threads are scheduled preemptively with the goal of minimizing …

Research on parallel computing has historically revolved around compute-intensive
applications drawn from traditional areas such as high-performance computing. With the …

Many modern parallel applications, such as desktop software and cloud-based web
services, are service-oriented, long running, and perform frequent interactions with the …

Work-stealing schedulers focus on minimizing overhead in task scheduling. Consequently,
they avoid features, such as task priorities, which can add overhead to the implementation …

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 …