Campaign scheduling

2012 19th International Conference on High Performance Computing, HiPC 2012

Volumn , Issue , 2012, Pages

  Pinheiro, Vinicius ^a   Rzadca, Krzysztof ^b   Trystram, Denis ^c  

^a UNIVERSITY OF SÃO PAULO   (Brazil)

^b UNIVERSITY OF WARSAW   (Poland)

^c INSTITUT UNIVERSITAIRE DE FRANCE   (France)

Author keywords

[No Author keywords available]

Indexed keywords

FAIRNESS CRITERIA; P-APPROXIMATION; PARALLEL JOB SCHEDULING; PARALLEL SYSTEM; SCHEDULING PROBLEM; SINGLE USERS; THEORETICAL MODELS; TIME-SHARING;

APPROXIMATION ALGORITHMS;

SCHEDULING;

EID: 84880316756     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/HiPC.2012.6507489     Document Type: Conference Paper

References (12)

1. S. Emmott and S. Rison, "Towards 2020 science," Working Group Reserach. Microsoft Research Cambridge, Tech. Rep., 2006.
2. D. P. Anderson, "Boinc: A system for public-resource computing and storage," in 5th IEEE/ACM International Workshop on Grid Computing, 2004, pp. 4-10.
3. B. Donassolo, A. Legrand, and C. Geyer, "Non-cooperative scheduling considered harmful in collaborative volunteer computing environments," in Proceedings of the 2011 11th IEEE/ACM International Symposium on Cluster, Cloud and Grid Computing, ser. CCGRID '11, 2011, pp. 144-153.
4. E. Saule and D. Trystram, "Multi-users scheduling in parallel systems," in Proc. of IEEE International Parallel and Distributed Processing Symposium 2009, Washington, DC, USA, may 2009, pp. 1-9.
5. R. Graham, E. Lawler, J. K. Lenstra, and A. R. Kan, in Optimization and approximation in deterministic sequencing and scheduling theory: A survey, ser. Annals of Discrete Mathematics. Elsevier, 1979, vol. 5, pp. 287-326.
6. A. Agnetis, P. B. Mirchandani, D. Pacciarelli, and A. Pacifici, "Scheduling problems with two competing agents," Operations Research, vol. 52, no. 2, pp. 229-242, 2004.
7. M. Voorneveld, "Characterization of Pareto dominance," Operations Research Letters, vol. 31, pp. 7-11, january 2003.
8. D. S. Hochbaum and D. B. Shmoys, "Using dual approximation algorithms for scheduling problems theoretical and practical results," J. ACM, vol. 34, pp. 144-162, January 1987. [Online]. Available: http://doi.acm.org/10.1145/7531.7535
9. C.-Y. Lee, "Parallel machines scheduling with nonsimultaneous machine available time," Discrete Appl. Math., vol. 30, pp. 53-61, January 1991. Available: http://dx.doi.org/10.1016/0166-218X(91)90013-M
10. H. Kellerer, "Algorithms for multiprocessor scheduling with machine release times," IIE Transactions, vol. 30, pp. 991-999, 1998, 10.1023/A:1007526827236. [Online]. Available: http://dx.doi.org/10.1023/A: 1007526827236
11. L. Guo-Hui, "The exact bound of Lee's MLPT," Discrete Applied Mathematics, vol. 85, no. 3, pp. 251 -254, 1998. [Online]. Available: http://www.sciencedirect.com/science/article/pii/S0166218X9700139X
12. 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," in Proceedings of the 7th IEEE/ACM International Conference on Grid Computing, ser. GRID '06. Washington, DC, USA: IEEE Computer Society, 2006, pp. 262-269. [Online]. Available: http://dx.doi.org/10.1109/ICGRID.2006.311024