This Article 
 Bibliographic References 
 Add to: 
Approximation Algorithms for the Multiorganization Scheduling Problem
November 2011 (vol. 22 no. 11)
pp. 1888-1895
Pierre-François Dutot, LIG, Grenoble University, Montbonnot Saint Martin
Fanny Pascual, LIP6, Universite Paris VI, Paris
Krzysztof Rzadca, University of Warsaw, Warsaw
Denis Trystram, LIG, Grenoble University, Montbonnot Saint Martin
The distributed nature of new computing platforms results in the problem of scheduling parallel jobs produced by several independent organizations that have each their own rules. They have no direct control over the whole system; thus, it is necessary to revisit classical scheduling with locality constraints. In this work, we consider distributed computing systems in which each organization has its own resources. Each organization aims at minimizing the execution times of its own jobs. We introduce a global centralized mechanism for designing a collaborative solution that improves the global performance of the system while respecting organizations' selfish objectives. The proposed algorithm is proved to have an approximation ratio equal to 3 over the global optimal makespan and this bound is shown to be asymptotically tight (when the number of organizations is large). Several variants of this problem are also studied. Then, we derive another algorithm that improves in practice these solutions by further balancing the schedules. Finally, we provide some experiments based on simulations that demonstrate a very good efficiency of this last algorithm on typical instances.

[1] The Grid 2: Blueprint for a New Computing Infrastructure, I. Foster, C. Kesselman, eds. Elsevier, 2004.
[2] I. Foster, "What Is the Grid," WhatIsTheGrid.pdf, 2002.
[3] J. Blazewicz, K.H. Ecker, G. Schmidt, and J. Weglarz, Scheduling in Computer and Manufacturing Systems. Springer, 1996.
[4] F. Pascual, K. Rzadca, and D. Trystram, "Cooperation in Multi-Organization Scheduling," Concurrency and Computation: Practice and Experience, vol. 21, no. 7, pp. 905-921, 2009.
[5] D.G. Feitelson, L. Rudolph, and U. Schwiegelshohn, "Parallel Job Scheduling a Status Report," Proc. 10th Int'l Workshop Job Scheduling Strategies Parallel Process (JSSPP '04), pp. 1-16, 2005.
[6] D. Shmoys, J. Wein, and D. Williamson, "Scheduling Parallel Machines On-Line," SIAM J. Computing, vol. 24, no. 6, pp. 1313-1331, 1995.
[7] M. Garey and D. Johnson, Computers and Intractability: A Guide to the Theory of NP-Completeness. WH Freeman and Company. 1979.
[8] E. Bampis, R. Giroudeau, and J.C. König, "An Approximation Algorithm for the Precedence Constrained Scheduling Problem with Hierarchical Communications," Theoretical Computer Science, vol. 290, no. 3, pp. 1883-1895, 2003.
[9] U. Schwiegelshohn, A. Tchernykh, and R. Yahyapour, "Online Scheduling in Grids," Proc. IEEE Int'l Symp. Parallel and Distributed Processing (IPDPS), 2008.
[10] M. Bougeret, P.F. Dutot, K. Jansen, C. Otte, and D. Trystram, "Approximation Algorithms for Multiple Strip Packing," Proc. Seventh Workshop Approximation and Online Algorithms (WAOA), 2009.
[11] A. Folling, C. Grimme, J. Lepping, and A. Papaspyrou, "Robust Load Delegation in Service Grid Environments," IEEE Trans. Parallel and Distributed Systems, vol. 21, no. 9, pp. 1304-1316, Sept. 2010.
[12] R. Graham, "Bounds on Multiprocessor Timing Anomalies," SIAM J. Applied Math., vol. 17, no. 2, pp. 416-429, 1969.
[13] U. Lublin and D. Feitelson, "The Workload on Parallel Supercomputers: Modeling the Characteristics of Rigid Jobs," J. Parallel and Distributed Computing, vol. 11, no. 63, pp. 1105-1122, 2003.
[14] A. Iosup, C. Dumitrescu, D. Epema, H. Li, and L. Wolters, "How Are Real Grids Used? The Analysis of Four Grid Traces and Its Implications," Proc. Seventh IEEE/ACM Int'l Conf. Grid Computing, pp. 262-269, 2006.
[15] M. Osborne and A. Rubinstein, A Course in Game Theory. MIT Press, 1994.
[16] G. Christodoulou, E. Koutsoupias, and A. Nanavati, "Coordination Mechanisms for Selfish Scheduling," Proc. 31st Int'l Colloquium on Automata, Languages and Programming (ICALP), pp. 345-357, 2003.
[17] E. Anshelevich, A. Dasgupta, J.M. Kleinberg, É. Tardos, T. Wexler, and T. Roughgarden, "The Price of Stability for Network Design with Fair Cost Allocation," Proc. 45th Ann. IEEE Symp. Foundations of Computer Science (FOCS), pp. 295-304, 2004.
[18] J. Liu, X. Jin, and Y. Wang, "Agent-Based Load Balancing on Homogeneous Minigrids: Macroscopic Modeling and Characterization," IEEE Trans. Parallel and Distributed Systems, vol. 16, no. 7, pp. 586-598, July 2005.
[19] T. Rotaru and H.H. Nageli, "Dynamic Load Balancing by Diffusion in Heterogeneous Systems," J. Parallel Distributed Computing, vol. 64, no. 4, pp. 481-497, 2004.
[20] P. Berenbrink, T. Friedetzky, L. Goldberg, P. Goldberg, Z. Hu, and R. Martin, "Distributed Selfish Load Balancing," Proc. 17th Ann. ACM-SIAM Symp. Discrete Algorithms (SODA), pp. 354-363, 2006.
[21] A. Lodi, S. Martello, and M. Monaci, "Two-Dimensional Packing Problems: A Survey," European J. Operational Research, vol. 141, pp. 241-252, 2002.

Index Terms:
Scheduling, cooperation, hierarchical systems.
Pierre-François Dutot, Fanny Pascual, Krzysztof Rzadca, Denis Trystram, "Approximation Algorithms for the Multiorganization Scheduling Problem," IEEE Transactions on Parallel and Distributed Systems, vol. 22, no. 11, pp. 1888-1895, Nov. 2011, doi:10.1109/TPDS.2011.47
Usage of this product signifies your acceptance of the Terms of Use.