Analysis of Multi-Organization Scheduling Algorithms

Abstract. In this paper we consider the problem of scheduling on computing platforms composed of several independent organizations, known as the Multi-Organization Scheduling Problem (MOSP). Each organization 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

• Type: Conference
• Year: 2010
• Where: EUROPAR
• Authors: Johanne Cohen, Daniel Cordeiro, Denis Trystram, Frédéric Wagner
• Keywords: Computing Platforms, Distributed And Parallel Computing, EUROPAR 2010, Multi-Organization Scheduling Problem, Organizations