Multi-users scheduling in parallel systems

IPDPS 2009 - Proceedings of the 2009 IEEE International Parallel and Distributed Processing Symposium

Volumn , Issue , 2009, Pages

  Saule, Erik ^a   Trystram, Denis ^a  

^a UNIV GRENOBLE ALPES   (France)

Author keywords

Approximation algorithms; Multi objective optimization; Multi users scheduling

Indexed keywords

APPROXIMATION RATIOS; COMBINATORIAL METHOD; COMBINATORIAL OPTIMIZATION TECHNIQUES; COMPLETION TIME; FIXED NUMBERS; GREEDY HEURISTICS; INAPPROXIMABILITY; MULTI-USERS SCHEDULING; MULTIUSERS; OBJECTIVE FUNCTIONS; PARALLEL SYSTEM; PARETO OPTIMAL SOLUTIONS; SCHEDULING PROBLEM; SINGLE COMPUTING; SUM OF COMPLETION TIME; WEIGHTED COMPLETION;

COMBINATORIAL OPTIMIZATION; COMPUTER SCIENCE; DISTRIBUTED PARAMETER NETWORKS; GAME THEORY; MULTIOBJECTIVE OPTIMIZATION; PROBLEM SOLVING;

APPROXIMATION ALGORITHMS;

EID: 70450056279     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/IPDPS.2009.5161037     Document Type: Conference Paper

References (18)

1. A. Agnetis, P. B. Mirchandani, D. Pacciarelli, and A. Paci-fici. Scheduling problems with two competing agents. Operations Research, 52(2):229-242, 2004.
2. E. Angel, E. Bampis, and L. Gourvés. Approximation results for a bicriteria job scheduling problem on a single machine without preemption. Information Processing Letters, 94(1):19-27, Apr. 2005.
3. A. Archer, C. Papadimitriou, K. Talwar, and E. Tardos. An approximate truthful mechanism for combinatorial auctions with single parameter agent. In Proc. of the 14th Annual ACM Symposium on Discrete Algorithms (SODA), 2003.
4. K. Baker and J. Smith. A multiple-criterion model for machine scheduling. Journal of Scheduling, 6:7-16, 2003.
5. M. A. Bender, S. Muthukrishnan, and R. Rajaraman. Improved algorithms for stretch scheduling. In Proceedings of the 13th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), pages 762-771, 2002.
6. M. R. Garey and D. S. Johnson. Computers and Intractability. Freeman, San Francisco, 1979.
7. R. L. Graham. Bounds for certain multiprocessing anomalies. Bell System Technical Journal, 45:1563-1581, 1966.
8. L. A. Hall, A. S. Schulz, D. B. Shmoys, and J. Wein. Scheduling to minimize average completion time: Off-line and on-line approximation algorithms. In SODA: ACM-SIAM Symposium on Discrete Algorithms, 1997.
9. D. S. Hochbaum and D. B. Shmoys. Using dual approximation algorithms for scheduling problems: Pratical and theoretical results. Journal of ACM, 34:144-162, 1987.
10. D. Jackson, Q. Snell, and M. Clement. Core algorithms of the maui scheduler. In D. G. Feitelson and L. Rudolph, editors, Proc. of the 7th International workshop JSSPP, number 2221 in LNCS. Springer, 2001.
11. H. Kellerer. Algorithms for multiprocessor scheduling with machine release times. IIE Transactions, 30(11):991-999, Nov. 1998.
12. A. Legrand, A. Su, and F. Vivien. Minimizing the stretch when scheduling flows of biological requests. In Symposium on Parallelism in Algorithms and Architectures SPAA'2006. ACM Press, 2006.
13. A. Legrand and C. Touati. Non-cooperative scheduling of multiple bag-of-task applications. In Proc of InfoCom 2007, pages 427-435, 2007.
14. J. Y.-T. Leung. Some basic scheduling algorithms. In J. Y.-T. Leung, editor, Handbook of Scheduling, chapter 3. CRC Press, 2004.
15. J. Mo and J. Warland. Fair endtoend windowbased congestion control. In Proc. of SPIE '98: International Symposium on Voice, Video and Data Communications, 1998.
16. M. J. Osborne and A. Rubinstein. A Course in Game Theory. The MIT Press, 1994.
17. F. Pascual, K. Rzadca, and D. Trystram. Cooperation in multi-organization scheduling. In Proc. of Euro Par 2007, number 4641 in LNCS, pages 224-233, Aug. 2007.
18. V. T'kindt and J.-C. Billaut. Multicriteria Scheduling. Springer, 2007.