Improved algorithms for stretch scheduling

Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms

Volumn 06-08-January-2002, Issue , 2002, Pages 762-771

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

^a Stony Brook University   (United States)

^b AT AND T LABS RESEARCH   (United States)

^c NORTHEASTERN UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; POLYNOMIAL APPROXIMATION; PROGRAM PROCESSORS; SCHEDULING;

INCOMPLETE KNOWLEDGE; LARGEST PROCESSING TIME; ON-LINE ALGORITHMS; POLYNOMIAL TIME APPROXIMATION SCHEMES; POLYNOMIAL-TIME ALGORITHMS; PRE-EMPTIVE SCHEDULING; SHORTEST REMAINING PROCESSING TIME; SINGLE PROCESSORS;

SCHEDULING ALGORITHMS;

EID: 84968765202     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (19)

1. S. Acharya and S. Muthukrishnan. Scheduling on-demand broadcasts: New metrics and algorithms. Proceedings of MOBICOM, 1998, pages 43-54.
2. P. Afrati, E. Bampis, C. Chekuri, D. Karger, C. Kenyon, S. Khanna, I. Milis, M. Queyranne, M. Sart-inutella, C. Stein, and M. Sviridenko. Approximation schemes for minimizing average weighted completion time with release dates. Proceedings of the 40th Annual IEEE Symposium on Foundations of Computer Science, 1999, pages 32-44.
3. H. Bast. Dynamic scheduling with incomplete information. Proceedings of the 10th Annual ACM Symposium on Parallel Algorithms and Architectures, 1998, pages 182-191.
4. H. Bast. On scheduling parallel tasks at twilight. Theory of Computing Systems, 33(5/6) :489-563, 2000.
5. M. Bender, S. Chakrabarti, and S. Muthukrishnan. Flow and stretch metrics for scheduling continuous job streams. Proceedings of the 9th Annual ACM-SIAM Symposium on Discrete Algorithms, 1998, pages 270-279.
6. M. Bender, S. Muthukrishnan, and R. Rajaraman. Improved algorithms for stretch scheduling. Technical report NU-CCS-01-07, Northeastern University, October 2001.
7. C. Chekuri, S. Khanna, and A. Zhu. Algorithms for minimizing weighted flow time Proceedings of the 33rd Annual ACM Symposium on Theory of Computing, 2001, pages 84-93.
8. C. Chekuri and S. Khanna. Approximation schemes for preemptive weighted flow time. Manuscript, April 2001.
9. M. Crovella, R. Frangioso, and M. Harchol-Balter. Connection scheduling in web servers. Proceedings of the USENIX Symposium on Internet Technologies and Systems, 1999.
10. M. L. Fredman and D. E. Willard. Surpassing the information theoretic bound with fusion trees. Journal of Computer System and Sciences, 47(3):424-436, 1993.
11. A. Goel, M. Henzinger, S. Plotkin, and E. Tardos. Scheduling data transfers in a network and the set scheduling problem. Proceedings of the Slst Annual ACM Symposium on Theory of Computing, 1999, pages 189-197.
12. M. Harchol-Balter, M. Crovella, and C. Murta. On choosing a task assignment policy for a distributed server system. Journal of Parallel and Distributed Computing, 59(2):204-228, 1999.
13. N. Joshi, S. Kadaba, S. Patel, and G. Sundaram. Downlink scheduling in CDMA data networks. Proceedings of MOBICOM, 2000, pages 179-190.
14. B. Kalyanasundaram and K. Pruhs. Minimizing flow time nonclairvoyantly, Proceedings of the 38th Annual IEEE Symposium on Foundations of Computer Science, 1997.
15. B. Kalyanasundaram, K. Pruhs, and M. Velauthapil-lai. Scheduling broadcasts in wireless networks. Proceedings of the Annual European Symposium on Algorithms, 2000, pages 290-301.
16. S. Leonardi and D. Raz. Approximating total flow time on parallel machines. Proceedings of the 29th Annual ACM Symposium on Theory of Computing, 1997, pages 110-119.
17. R. Motwani, S. Phillips, and E. Torng. Nonclairvoyant scheduling. Theoretical Computer Science, 130(1):17-47, 1994.
18. S. Muthukrishnan, R. Rajaraman, A. Shaheen, and J. Gehrke. Online scheduling to minimize average stretch. Proceedings of the 40th Annual IEEE Symposium on Foundations of Computer Science, 1999, pages 433-442.
19. M. Thorup. On RAM priority queues. In Proceedings of the 7th Annual ACM-SIAM Symposium on Discrete Algorithms, 1996, pages 59-67.