Static scheduling of a program represented by a directed task graph on a multiprocessor
system to minimize the program completion time is a well-known problem in parallel …

The scheduling and mapping of the precedence-constrained task graph to processors is
considered to be the most crucial NP-complete problem in parallel and distributed …

Workflow technologies have become a major vehicle for easy and efficient development of
scientific applications. In the meantime, state-of-the-art resource provisioning technologies …

Advances in hardware and software technologies have made it possible to deploy parallel
applications over increasingly large sets of distributed resources. Consequently, the study of …

Summary form only given. This paper is motivated by the observation that different methods
to compute the weights of nodes and edges when scheduling DAGs onto heterogeneous …

Optimal scheduling of parallel tasks with some precedence relationship, onto a parallel
machine is known to be NP-complete. The complexity of the problem increases when task …

Since the advent of distributed computer systems an active field of research has been the
investigation of scheduling strategies for parallel applications. The common approach is to …

A large class of applications need to execute the same workflow on different datasets of
identical size. Efficient execution of such applications necessitates intelligent distribution of …

In this work, we present timed automata as a natural tool for posing and solving scheduling
problems. We show how efficient shortest path algorithms for timed automata can find …

Scheduling data processing workflows (dataflows) on the cloud is a very complex and
challenging task. It is essentially an optimization problem, very similar to query optimization …