Approximation algorithms for average stretch scheduling

Journal of Scheduling

Volumn 7, Issue 3, 2004, Pages 195-222

  Bender, Michael A ^a   Muthukrishnan, S ^b,d   Rajaraman, Rajmohan ^c  

^a Stony Brook University   (United States)

^b RUTGERS UNIVERSITY   (United States)

^c NORTHEASTERN UNIVERSITY   (United States)

^d AT AND T LABS RESEARCH   (United States)

Author keywords

Approximation algorithms; Average stretch; Scheduling algorithms

Indexed keywords

APPROXIMATION ALGORITHMS; AVERAGE STRETCH; ONLINE SCHEDULING; SCHEDULING ALGORITHMS;

ALGEBRA; ALGORITHMS; APPROXIMATION THEORY; JOB ANALYSIS; MATHEMATICAL MODELS; POLYNOMIAL APPROXIMATION; PROGRAM PROCESSORS;

SCHEDULING;

EID: 3543149548     PISSN: 10946136     EISSN: None     Source Type: Journal    
DOI: 10.1023/B:JOSH.0000019681.52701.8b     Document Type: Conference Paper

References (17)

1. Afrati, F., E. Bampis, C. Chekuri, D. Karger, C. Kenyon, I. Milis, M. Queyranne, M. Skutella, C. Stein, and M. Sviridenko, "Approximation schemes for scheduling to minimize average completion time with release dates," in Proceedings of the 40th Annual IEEE Symposium on Foundations of Computer Science, October 1999, pp. 32-43.
2. Baker, K. R., Introduction to Sequencing and Scheduling, Wiley, New York, 1974.
3. Bast, H., "Dynamic scheduling with incomplete information," in Proceedings of the 10th Annual ACM Symposium on Parallel Algorithms and Architectures, 1998, pp. 182-191.
4. Bast, H., "On scheduling parallel tasks at twilight," Theory Comput. Syst, 33, 489-563 (2000).
5. Bender, M., S. Chakrabarti, and S. Muthukrishnan, "Flow and stretch metrics for scheduling continuous job streams," in Proceedings of the 9th Annual ACM-SIAM Symposium on Discrete Algorithms, January 1998, pp. 270-279.
6. Bender, M., S. Muthukrishnan, and R. Rajaraman, "Improved algorithms for stretch scheduling," in Proceedings of the 13th Annual ACM-SIAM Symposium on Discrete Algorithms, January 2002, pp. 762-771.
7. Chekuri, C. and S. Khanna, "Approximation schemes for preemptive weighted flow time," in Proceedings of the 34th Annual ACM Symposium on Theory of Computing, 2002, pp. 297-305.
8. Chekuri, C., S. Khanna, and A. Zhu, "Algorithms for minimizing weighted flow time," in Proceedings of the 33rd Annual ACM Symposium on Theory of Computing, 2001, pp. 84-93.
9. Goel, A., M. Henzinger, S. Plotkin, and E. Tardos, "Scheduling data transfers in a network and the set scheduling problem," in Proceedings of the 31st Annual ACM Symposium on Theory of Computing, Atlanta, Georgia, May, 1999, pp.189-197.
10. Harchol-Balter, M., M. Crovella, and C. Murta, "Task assignment in a distributed server," J. Parallel and Distribut. Comput., 59, 204-228 (1999).
11. Kalyanasundaram B. and K. Pruhs, "Minimizing flow time nonclairvoyantly," in Proceedings of the 38th IEEE Symposium on Foundations of Computer Science, 1997, pp. 345-352.
12. Kalyanasundaram, B., K. Pruhs, and M. Velauthapillai, "Scheduling broadcasts in wireless networks," in Proceedings of the Annual European Symposium on Algorithms, 2000, pp. 290-301.
13. Leighton, T., January 2003. Personal communication.
14. Leonardi, S. and D. Raz, "Approximating total flow time on parallel machines," in Proceedings of the 29th Annual ACM Symposium on Theory of Computing, May 1997, pp. 110-119.
15. Motwani, R., S. Phillips, and E. Torng, "Nonclairvoyant scheduling," Theoreti. Comput. Sci., 130, 17-47 (1994).
16. Muthukrishnan, S. and R. Rajaraman, "An adversarial model for distributed dynamic load balancing," J. Interconnect. Networks, 3; 35-47, (2002).
17. Muthukrishnan, S. R. Rajaraman, A. Shaheen, and J. Gehrke, "Scheduling to minimize average stretch," in Proceedings of the 40th Annual IEEE Symposium on Foundations of Computer Science, October 1999, pp. 433-442.