Steady-State for Batches of Identical Task Trees

Authors:
Sékou Diakité;Loris Marchal;Jean-Marc Nicod;Laurent Philippe
Affiliations:
Laboratoire d'Informatique de Franche-Comté, Université de France Comté, France;Laboratoire de l'Informatique du Parallélisme CNRS - INRIA, Université de Lyon, France;Laboratoire d'Informatique de Franche-Comté, Université de France Comté, France;Laboratoire d'Informatique de Franche-Comté, Université de France Comté, France
Venue:
Euro-Par '09 Proceedings of the 15th International Euro-Par Conference on Parallel Processing
Year:
2009

Citing 8
Cited 1

Asymptotically optimal algorithms for job shop scheduling and packet routing

Journal of Algorithms
Task Scheduling Algorithms for Heterogeneous Processors

HCW '99 Proceedings of the Eighth Heterogeneous Computing Workshop
The Grid 2: Blueprint for a New Computing Infrastructure

The Grid 2: Blueprint for a New Computing Infrastructure
Taverna: a tool for the composition and enactment of bioinformatics workflows

Bioinformatics
Exploring protein fold space by secondary structure prediction using data distribution method on Grid platform

Bioinformatics
Optimization of media processing workflows with adaptive operator behaviors

Multimedia Tools and Applications
Comparison of Batch Scheduling for Identical Multi-Tasks Jobs on Heterogeneous Platforms

PDP '08 Proceedings of the 16th Euromicro Conference on Parallel, Distributed and Network-Based Processing (PDP 2008)
SimGrid: A Generic Framework for Large-Scale Distributed Experiments

UKSIM '08 Proceedings of the Tenth International Conference on Computer Modeling and Simulation

A genetic algorithm with communication costs to schedule workflows on a SOA-Grid

Euro-Par'11 Proceedings of the 2011 international conference on Parallel Processing

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this paper, we focus on the problem of scheduling batches of identical task graphs on a heterogeneous platform, when the task graph consists in a tree. We rely on steady-state scheduling, and aim at reaching the optimal throughput of the system. Contrarily to previous studies, we concentrate upon the scheduling of batches of limited size. We try to reduce the processing time of each instance, thus making steady-state scheduling applicable to smaller batches. The problem is proven NP-complete, and a mixed integer program is presented to solve it. Then, different solutions, using steady-state scheduling or not, are evaluated through comprehensive simulations.