Skip to Main content Skip to Navigation
New interface
Conference papers

Analysis of Multi-Organization Scheduling Algorithms

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.
Complete list of metadata

Cited literature [16 references]  Display  Hide  Download
Contributor : Johanne Cohen épouse Bournez Connect in order to contact the contributor
Submitted on : Tuesday, November 16, 2010 - 1:12:58 PM
Last modification on : Wednesday, July 6, 2022 - 4:12:26 AM
Long-term archiving on: : Friday, October 26, 2012 - 3:47:03 PM


Files produced by the author(s)


  • HAL Id : inria-00536510, version 1


Johanne Cohen, Daniel Cordeiro, Denis Trystram, Frédéric Wagner. Analysis of Multi-Organization Scheduling Algorithms. Parallel Processing, 16th International Euro-Par Conference, Aug 2010, Ischia, Italy. pp.367--379. ⟨inria-00536510⟩



Record views


Files downloads