Multi-organization scheduling approximation algorithms

被引:8
|
作者
Cohen, Johanne [2 ]
Cordeiro, Daniel [3 ]
Trystram, Denis [1 ,4 ]
Wagner, Frederic [1 ]
机构
[1] Grenoble Tech Univ, F-38330 Montbonnot St Martin, Saint Martin, France
[2] Univ Versailles St Quentin En Yvelines, Lab Informat PRiSM, F-78035 Versailles, France
[3] Grenoble Univ, LIG, F-38330 Montbonnot St Martin, Saint Martin, France
[4] Inst Univ France, Paris, France
来源
关键词
scheduling; approximation algorithms; multi-organization scheduling; COOPERATION; BOUNDS;
D O I
10.1002/cpe.1752
中图分类号
TP31 [计算机软件];
学科分类号
081202 ; 0835 ;
摘要
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 jobs 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 strongly 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 and presenting good fairness to organizations' local objectives. Copyright (C) 2011 John Wiley & Sons, Ltd.
引用
收藏
页码:2220 / 2234
页数:15
相关论文
共 50 条
  • [1] Analysis of Multi-Organization Scheduling Algorithms
    Cohen, Johanne
    Cordeiro, Daniel
    Trystram, Denis
    Wagner, Frederic
    [J]. EURO-PAR 2010 - PARALLEL PROCESSING, PART II, 2010, 6272 : 367 - +
  • [2] Cooperation in multi-organization scheduling
    Pascual, Fanny
    Rzadca, Krzysztof
    Trystram, Denis
    [J]. EURO-PAR 2007 PARALLEL PROCESSING, PROCEEDINGS, 2007, 4641 : 224 - +
  • [3] Cooperation in multi-organization scheduling
    Pascual, Fanny
    Rzadca, Krzysztof
    Trystram, Denis
    [J]. CONCURRENCY AND COMPUTATION-PRACTICE & EXPERIENCE, 2009, 21 (07): : 905 - 921
  • [4] A Generalized Multi-organization Scheduling on Unrelated Parallel Machines
    Ooshita, Fukuhito
    Izumi, Tomoko
    Izumi, Taisuke
    [J]. 2009 INTERNATIONAL CONFERENCE ON PARALLEL AND DISTRIBUTED COMPUTING, APPLICATIONS AND TECHNOLOGIES (PDCAT 2009), 2009, : 26 - +
  • [5] Scheduling in multi-organization grids: Measuring the inefficiency of decentralization
    Rzadca, Krzysztof
    [J]. PARALLEL PROCESSING AND APPLIED MATHEMATICS, 2008, 4967 : 1048 - 1058
  • [6] Energy-Aware Multi-Organization Scheduling Problem
    Cohen, Johanne
    Cordeiro, Daniel
    Raphael, Pedro Luis F.
    [J]. EURO-PAR 2014 PARALLEL PROCESSING, 2014, 8632 : 186 - 197
  • [7] THE PRICE OF MULTI-ORGANIZATION CONSTRAINT IN UNRELATED PARALLEL MACHINE SCHEDULING
    Ooshita, Fukuhito
    Izumi, Tomoko
    Izumi, Taisuke
    [J]. PARALLEL PROCESSING LETTERS, 2012, 22 (02)
  • [8] Accelerated Multi-Organization Conflict Resolution
    Ackermann, Fran
    Eden, Colin
    Pyrko, Igor
    [J]. GROUP DECISION AND NEGOTIATION, 2016, 25 (05) : 901 - 922
  • [9] Accelerated Multi-Organization Conflict Resolution
    Fran Ackermann
    Colin Eden
    Igor Pyrko
    [J]. Group Decision and Negotiation, 2016, 25 : 901 - 922
  • [10] EVALUATING THE PERFORMANCE CAPABILITY OF A MULTI-ORGANIZATION SYSTEM
    SPIEGLER, I
    BENBASSAT, M
    DRAIZIN, Y
    KARMON, Y
    [J]. OMEGA-INTERNATIONAL JOURNAL OF MANAGEMENT SCIENCE, 1983, 11 (05): : 417 - 432