Scheduling and traffic allocation for tasks with bounded splittability

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

Volumn 2747, Issue , 2003, Pages 500-510

  Krysta, Piotr ^a   Sanders, Peter ^a   Vöcking, Berthold ^b  

^a MAX PLANCK INSTITUTE FOR INFORMATICS   (Germany)

^b TU DORTMUND UNIVERSITY   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; APPROXIMATION ALGORITHMS; POLYNOMIAL APPROXIMATION; QUEUEING THEORY; SCHEDULING ALGORITHMS; STOCHASTIC SYSTEMS;

EXACT ALGORITHMS; INTERNET DOMAINS; LATENCY FUNCTION; POLYNOMIAL-TIME; RELATED MACHINES; SCHEDULING PROBLEM; SCHEDULING TASKS; TRAFFIC ALLOCATION;

SCHEDULING;

EID: 35248895347     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-45138-9_44     Document Type: Article

References (13)

1. A. Agarwal, T. Agarwal, S. Chopra, A. Feldmann, N. Kammenhuber, P. Krysta and B. Vöcking. An Experimental Study of k-Splittable Scheduling for DNS-Based Traffic Allocation. To appear in Proc. of the 9th EUROPAR, 2003.
2. N. Alon, Y. Azar, G. J. Woeginger and T. Yadid. Approximation schemes for scheduling on parallel machines. Journal of Scheduling, 1:55-66, 1998.
3. M. Blum, R. Floyd, V. Pratt, R. Rivest, and R. Tarjan. Time bounds for selection. J. Computer and System Science, 7(4):448-461, August 1973.
4. L. Epstein and J. Sgall. Approximation schemes for scheduling on uniformly related and identical parallel machines. Proc. of the 7th ESA, 151-162, 1999.
5. D. S. Hochbaum and D.B. Shmoys. Using dual approximation algorithms for scheduling problems: theoretical and practical results. J. ACM, 34: 144-162, 1987.
6. D. S. Hochbaum and D.B. Shmoys. A polynomial approximation scheme for scheduling on uniform processors: using the dual approximation approach. SIAM Journal on Computing, 17: 539-551, 1988.
7. E. Horowitz and S. K. Sahni. Exact and approximate algorithms for scheduling nonidentical processors. J. ACM, 23:317-327, 1976.
8. J. F. Kurose and K. W. Ross. Computer networking: a top-down approach featuring the Internet. Addison-Wesley, 2001.
9. St. Kwek and K. Mehlhorn. Optimal search for rationals. Information Processing Letters, 86:23-26, 2003.
10. R. McNaughton. Scheduling with deadlines and loss functions. Management Science, 6:1-12, 1959.
11. C. H. Papadimitriou. Efficient search for rationals. Information Processing Letters, 8:1-4, 1979.
12. H. Shachnai and T. Tamir. Multiprocessor Scheduling with Machine Allotment and Parallelism Constraints. Algorithmica, 32(4): 651-678, 2002.
13. W. Xing and J. Zhang. Parallel machine scheduling with splitting jobs. Discrete Applied Mathematics, 103: 259-269, 2000.