Cooperation in Multi-Organization Scheduling - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Journal Articles Concurrency and Computation: Practice and Experience Year : 2009

Cooperation in Multi-Organization Scheduling


The distributed nature of the grid results in the problem of scheduling parallel jobs produced by several independent organizations that have partial control over the system. We consider systems in which each organization owns a cluster of processors. Each organization wants its tasks to be completed as soon as possible. In this paper, we model an off-line system consisting of N identical clusters of m processors. We show that it is always possible to produce a collaborative solution that respects participants' selfish goals, at the same time improving the global performance of the system. We propose an algorithm (called MOLBA) with a guaranteed worst-case performance ratio on the global makespan, equal to 4. Next, we show that a better bound (equal to 3) can be obtained in a specific case when the last completed job requires at most m/2 processors. Then, we derive another algorithm (called ILBA) that in practice improves the proposed, guaranteed solution by further balancing the schedules. Finally, by an extensive evaluation by simulation, we show that the algorithms are efficient on typical instances.

Dates and versions

hal-00953257 , version 1 (28-02-2014)



Fanny Pascual, Krzysztof Rzadca, Denis Trystram. Cooperation in Multi-Organization Scheduling. Concurrency and Computation: Practice and Experience, 2009, 21 (7), pp.905-921. ⟨10.1002/cpe.1378⟩. ⟨hal-00953257⟩
118 View
0 Download



Gmail Facebook X LinkedIn More