Non-clairvoyant batch sets scheduling: Fairness is fair enough

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 4698 LNCS, Issue , 2007, Pages 741-753

  Robert, Julien ^a   Schabanel, Nicolas ^b  

^a UNIVERSITÉ DE LYON   (France)

^b Laboratory of Bioinformatics and Mathematics of Genome   (Chile)

Author keywords

Batch scheduling; Equi partition; Fairness; Makespan and overall set completion time minimization; Non clairvoyant algorithm; Online scheduling

Indexed keywords

ALGORITHMS; ASYMPTOTIC ANALYSIS; DATA PROCESSING; REAL TIME SYSTEMS; SET THEORY;

BATCH SCHEDULING; NON-CLAIRVOYANT ALGORITHM; ONLINE SCHEDULING;

SCHEDULING;

EID: 38049031745     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-75520-3_65     Document Type: Conference Paper

References (13)

1. Blazewicz, J., Ecker, K., Pesch, E., Schmidt, G., Weglarz, J.(eds.): Handbook on Scheduling: Models and Methods for Advanced Planning, chapter Online Scheduling. International Handbooks on Information Systems. Springer, Heidelberg (2007), at http://www.cs.pitt.edu/~kirk/papers/index.html
2. Edmonds, J.: Scheduling in the dark. In: Proc. of the 31st ACM Symp. on Theory of Computing (STOC), pp. 179-188. ACM Press, New York (1999)
3. Edmonds, J., Chinn, D.D., Brecht, T., Deng, X.: Non-clairvoyant multiprocessor scheduling of jobs with changing execution characteristics. J. Scheduling 6(3), 231-250 (2003)
4. Edmonds, J., Pruhs, K.: Broadcast scheduling: when fairness is fine. In: Proc. of the 13th annual ACM-SIAM symposium on Discrete algorithms (SODA 2002), Philadelphia, PA, USA, pp. 421-430. ACM Press, New York (2002)
5. Feldmann, A., Kao, M.-Y., Sgall, J., Teng, S.-H.: Optimal online scheduling of parallel jobs with dependencies. J. of Combinatorial Optimization 1, 393-411 (1998)
6. Graham, R.L.: Bounds for certain multiprocessing anomalies. Bell System Technical Journal 45, 1563-1581 (1966)
7. Graham, R.L.: Bounds on multiprocessing timing anomalies. SIAM Journal on Applied Mathematics 17, 263-269 (1969)
8. Kalyanasundaram, B., Pruhs, K.: Speed is as powerful as clairvoyance. J. ACM 47(4), 617-643 (2000)
9. Motwani, R., Philipps, S., Torng, E.: Non-clairvoyant scheduling. Theoretical Computer Science 130, 17-47 (1994)
10. Motwani, R., Raghavan, P.: Randomized Algorithms. Cambridge University Press, Cambridge (1995)
11. Robert, J., Schabanel, N.: Pull-based data broadcast with dependencies: Be fair to users, not to items. In: Proc. of Symp. on Discrete Algorithms (SODA) (2007)
12. Tucker, A., Gupta, A.: Process control and scheduling issues for mulitprogrammed shared memory multiprocessors. In: Proc. of the 12th ACM Symp. on Op. Syst. Principles, pp. 159-166. ACM Press, New York (1989)
13. Yao, A.: Probabilistic computations: Towards a unified measure of complexity. In: Proc. of 17th Symp. on Fond, of Computer Science (FOCS), pp. 222-227 (1977)