Analysis of Multi-Organization Scheduling AlgorithmsReport as inadecuate

Analysis of Multi-Organization Scheduling Algorithms - Download this document for free, or read online. Document in PDF available to download.

1 PRISM - Parallélisme, Réseaux, Systèmes, Modélisation 2 MOAIS - PrograMming and scheduling design fOr Applications in Interactive Simulation Inria Grenoble - Rhône-Alpes, LIG - Laboratoire d-Informatique de Grenoble 3 LIG - Laboratoire d-Informatique de Grenoble

Abstract : In this paper we consider the problem of scheduling on com- puting platforms composed of several independent organizations, known as the Multi-Organization Scheduling Problem MOSP. Each organiza- tion provides both resources and tasks and follows its own objectives. We are interested in the best way to minimize the makespan on the entire platform when the organizations behave in a selfish way. We study the complexity of the MOSP problem with two different local objectives – makespan and average completion time – and show that MOSP is NP-Hard in both cases. We formally define a selfishness notion, by means of restrictions on the schedules. We prove that selfish behavior imposes a lower bound of 2 on the approximation ratio for the global makespan. We present various approximation algorithms of ratio 2 which validate selfishness restrictions. These algorithms are experimentally evaluated through simulation, exhibiting good average performances.

Author: Johanne Cohen - Daniel Cordeiro - Denis Trystram - Frédéric Wagner -



Related documents