Workflow scheduling on the Grid becomes more challenging when multiple scheduling
criteria are considered. Existing studies provide different approaches to the multi-criteria …

Massively multithreaded GPUs achieve high throughput by running thousands of threads in
parallel. To fully utilize the hardware, workloads spawn work to the GPU in bulk by launching …

A relatively new trend in parallel programming scheduling is the so-called mixed task and
data scheduling. It has been shown that mixing task and data parallelism to solve large …

The workflow scheduling problem which is considered difficult on the Grid becomes even
more challenging when multiple scheduling criteria are used for optimization. The existing …

It is well-known that mixing task and data parallelism to solve large computational
applications often yields better speedups compared to either applying pure task parallelism …

The paper presents a data and task parallel low-level image processing environment for
distributed memory systems. Image processing operators are parallelized by data …

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 …

Scheduling of most of the parallel scientific applications demand simultaneous exploitation
of task and data parallelism for efficient and effective utilization of system and other …

Divisible load applications consist of an amount of data and associated computation that can
be divided arbitrarily into any number of independent pieces. This model is a good …

This paper considers steady-state scheduling techniques for heterogeneous systems, such
as clusters and grids. The use of steady-state scheduling is advocated to solve a variety of …