Set Of Parallel Tasks Research Articles

Energy-efficient computing for a group of clusters

The paper is concerned with the problem of load balancing for a set of parallel tasks on a group of geographically distributed clusters aimed at reducing the energy consumption in computation. Several task allocation algorithms are put forward, and experimental verification of their efficiency is performed.

Bicriteria scheduling for contiguous and non contiguous parallel tasks

We study the problem of scheduling on k identical machines a set of parallel tasks with release dates and deadlines in order to maximize simultaneously two criteria, namely the Size (number of scheduled tasks) and the Weight (sum of the weights of scheduled tasks). If no task requires more than half of the machines, we construct schedules that are simultaneously approximations for the Size and the Weight by combining two approximate schedules, one for each parameter. We obtain existence results and polynomial time bicriteria approximation algorithms in contiguous and non contiguous models.

Optimal parallel processing of random task graphs

We consider scheduling of tasks of parallel programs on multiprocessor systems where tasks have precedence relations and synchronization points. The task graph structures are random variables in the sense that successors to a task do not become known until the task is executed. Thus, as is often the case with parallel processing, scheduling must occur at run time rather than compile time. We prove that a simple scheduling policy stochastically minimizes the processes of task completions and job (i.e. set of parallel tasks) completions for several classes of task graph structures. Copyright © 2001 John Wiley & Sons, Ltd.