MinMin, MaxMin, and Sufferage are constructive heuristics that are widely and successfully
used in assigning independent tasks to processors in heterogeneous computing systems …

K-way hypergraph partitioning has an ever-growing use in parallelization of scientific
computing applications. We claim that hypergraph partitioning with multiple constraints and …

Recent trends show that cloud computing is growing to span more and more globally
distributed datacenters. For geo-distributed datacenters, there is an increasingly need for …

The objective of task assignment problem (TAP) is to minimize the sum of interprocessor
communication and task processing costs for a distributed system which subjects to several …

An improved differential evolution algorithm (IDE) is proposed to solve task assignment
problem. The IDE is an improved version of differential evolution algorithm (DE), and it …

Heterogeneous parallel and distributed computing systems frequently must operate in
environments where there is uncertainty in system parameters. Robustness can be defined …

We model an oversubscribed heterogeneous computing system where tasks arrive
dynamically and a scheduler maps the tasks to machines for execution. The environment …

The need for greater performance in high performance computing systems combined with
rising costs of electricity to power these systems motivates the need for energy-efficient …

This study considers a heterogeneous computing system and corresponding workload
being investigated by the Extreme Scale Systems Center (ESSC) at Oak Ridge National …

The use of accelerators such as GPUs has become mainstream to achieve high
performance on modern computing systems. GPUs come with their own (limited) memory …