Task scheduling is an essential aspect of parallel programming. Most heuristics for this NP-
hard problem are based on a simple system model that assumes fully connected processors …

Finding an efficient schedule for a task graph on several processors is a trade-off between
maximising concurrency and minimising interprocessor communication. Task duplication is …

Energy efficiency along with enhanced performance are two important goals of scheduling
on multiprocessors. This paper proposes a Contention-aware, Energy Efficient, Duplication …

Task scheduling is an important aspect of parallel programming. Most of the heuristics for
this NP-hard problem are based on a very simple system model of the target parallel system …

Scheduling is a key component for performance guarantees in the case of distributed
applications running in large scale heterogeneous environments. Another function of the …

The exploitation of parallelism in a message-passing platform implies a previous modelling
phase of the parallel application as a task graph, which properly reflects its temporal …

Prescheduling algorithms are targeted at restructuring of task graphs for optimal scheduling.
Task graph scheduling is a NP-complete problem. This article offers a prescheduling …

Abstract A Task Graph (TG) is a model of a parallel program that consists of many subtasks
that can be executed simultaneously on different processing elements. Subtasks exchange …

In most Grid systems, submitted jobs are initially placed into a queue if there are no
available compute nodes. Therefore, there is no guarantee as to when these jobs will be …

Scheduling a task graph onto several processors is a trade-off between maximising
concurrency and minimising interprocessor communication. A technique to reduce or avoid …