Multi-processor scheduling to minimize flow time with ε resource augmentation

Conference Proceedings of the Annual ACM Symposium on Theory of Computing

Volumn , Issue , 2004, Pages 363-372

  Chekuri, Chandra ^a   Goel, Ashish ^b   Khanna, Sanjeev ^c   Kumar, Amit ^d  

^a LUCENT TECHNOLOGIES   (United States)

^b Stanford University   (United States)

^c UNIVERSITY OF PENNSYLVANIA   (United States)

^d INDIAN INSTITUTE OF TECHNOLOGY DELHI   (India)

Author keywords

Flow Time; Load Balancing; Multi processor Scheduling; Online Algorithms; Resource Augmentation; Stretch

Indexed keywords

ALGORITHMS; COMPUTATIONAL COMPLEXITY; COMPUTER OPERATING SYSTEMS; HTTP; MATHEMATICAL MODELS; PROBLEM SOLVING; SERVERS;

FLOW TIME; LOAD BALANCING; MULTI-PROCESSOR SCHEDULING; RESOURCE AUGMENTATION;

SCHEDULING;

EID: 4544292852     PISSN: 07349025     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1007352.1007411     Document Type: Conference Paper

References (22)

1. N. Alon, Y. Azar, G. Woeginger and T. Yadid. Approximation schemes for scheduling. Proc. of SODA, 1997.
2. p norm. Algorithmica, 29(3):422-441, 2001.
3. p norm. Proc. of FOCS, 1995.
4. N. Avrahami and Y. Azar. Minimizing total flow time and total completion time with immediate dispatching. Proc. of 15th SPAA, 2003.
5. B. Awerbuch, Y. Azar, S. Leonardi and O. Regev. Minimizing flow time without migration. Proc. of STOC, 1999.
6. N. Bansal and M. Harchol-Balter. Analysis of SRPT scheduling: Investigating unfairness. Proc. of ACM Sigmetrics, 2001.
7. p norm: a rising tide lifts all boats. Proc. of STOC, 2003.
8. N. Bansal and K. Dhamdhere. Minimizing Weighted Flowtime. Proc. of SODA, 2003.
9. L. Becchetti and S. Leonardi. Non-clairvoyant scheduling to minimize average flowtime on single and parallel machines. Proc. of STOC, 2001.
10. L. Becchetti, S. Leonardi, and S. Muthukrishnan. Scheduling to minimize Average Stretch without Migration. Proc. of SODA, 2001.
11. L. Becchetti, S. Leonardi, A. M. Spaccamela, K. Pruhs. Online weighted flow time and deadline scheduling. Proc. of RANDOM-APPROX, 2001.
12. M. A. Bender, S. Chakrabarti, and S. Muthukrishnan. Flow and Stretch Metrics for Scheduling Continuous Job Streams. Proc. of SODA, 1998.
13. C. Chekuri, S. Khanna. Approximation schemes for preemptive weighted flow time. Proc. of STOC, 2002.
14. C. Chekuri, S. Khanna, and A. Zhu. Algorithms for Minimizing Weighted Flow Time. Proc. of STOC, 2001.
15. M. Crovella, R. Frangioso and M. Harchol-Balter. Connection scheduling in web servers. USENIX Symposium on Internet Technologies and Systems, 1999.
16. L. Epstein and J. Sgall. Approximation schemes for scheduling on uniformly related and indentical parallel machines. Proc. of ESA, 1999.
17. B. Kalyanasundaram and K. Pruhs. Speed is as powerful as clairvoyance. JACM, 47(4):617-43, 2000.
18. S. Leonardi and D. Raz. Approximating total flow time on parallel machines. Proc. STOC, 1997.
19. R. Motwani, S. Phillips, and E. Torng. Non-clairvoyant Scheduling. Theoretical Computer Science, 130(1):17-47, 1994.
20. S. Muthukrishnan, R. Rajaraman, R. Shaheen, J. Gerkhe. Online scheduling to minimize average stretch. Proc. of FOCS, 1999.
21. C. Phillips, C. Stein, E. Torng, and J. Wein. Optimal Time Critical Scheduling Via Resource Augmentation. Proc. of STOC, 1997.
22. B. Schroeder and M. Harchol-Balter. Web servers under overload: how scheduling can help. Proc. of 18th International Teletraffic Congress, 2003.