Taskflow aims to streamline the building of parallel and heterogeneous applications using a
lightweight task graph-based approach. Taskflow introduces an expressive task graph …

Work stealing has been proven to be an efficient technique for scheduling parallel
computations, and has been gaining popularity as the multiprocessor/multicore-processor …

With task parallel models, programmers can easily parallelize divide-and-conquer
algorithms by using nested fork-join structures. Work stealing, which is a popular scheduling …

Work stealing is a widely-used scheduling technique for parallel processing on multicore.
Each core owns a queue of tasks and avoids idling by stealing tasks from other queues …

Abstract Particle Swarm Optimization (PSO) is one of the most popular optimization
algorithms that has been adopted in various fields, including design, scheduling, and …

The actor programming model is gaining popularity due to the prevalence of multi-core
systems along with the rising need for highly scalable and distributed applications …

We define a wide class of Markovian load balancing networks of identical single-server
infinite-buffer queues. These networks may implement classic parallel server or work …

Social choice theory concerns the design and analysis of methods for aggregating possibly
conflicting individual preferences to reach a collective decision in a satisfactory manner. The …

Task parallelism is designed to simplify the task of parallel programming. When executing a
task parallel program on modern NUMA architectures, it can fail to scale due to the …

Concurrency is an essential part of many modern large-scale software systems. Applications
must handle millions of simultaneous requests from millions of connected devices. Handling …