An online scalable algorithm for minimizing lk-norms of weighted flow time on unrelated machines

Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms

Volumn , Issue , 2011, Pages 95-108

  Im, Sungjin ^a   Moseley, Benjamin ^a  

^a University of Illinois at Urbana Champaign   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

FLOW-TIME; LOWER BOUNDS; MACHINE MODELS; NON-TRIVIAL; NON-TRIVIAL ALGORITHMS; OPTIMAL SOLUTIONS; POTENTIAL FUNCTION; PROCESSING TIME; SCALABLE ALGORITHMS; SCHEDULING JOBS; SIMPLE ALGORITHM; SINGLE MACHINES; TOTAL RESPONSE; UNRELATED MACHINES; WEIGHTED FLOWTIME;

OPTIMIZATION;

ALGORITHMS;

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

References (28)

1. Nir Avrahami and Yossi Azar. Minimizing total flow time and total completion time with immediate dispatching. Algoritmica, 47(3):253-268, 2007. (Pubitemid 46407938)
2. Baruch Awerbuch, Yossi Azar, Stefano Leonardi, and Oded Regev. Minimizing the flow time without migration. SIAM J. Comput., 31(5): 1370-1382, 2002. (Pubitemid 35298402)
3. Nikhil Bansal and Ho-Leung Chan. Weighted flow time does not admit o(1)-competitive algorithms. In SODA'09: Proceedings of the Nineteenth Annual ACM-SIAM Symposium on Discrete Algorithms, pages 1238-1244, Philadelphia, PA, USA, 2009. Society for Industrial and Applied Mathematics.
4. Nikhil Bansal and Kirk Pruhs. Server scheduling in the lp norm: a rising tide lifts all boat. In STOC, pages 242-250, 2003.
5. Nikhil Bansal and Kirk Pruhs. Server scheduling in the weighted lp norm. In Martin Farach-Colton, editor, LATIN, volume 2976 of Lecture Notes in Computer Science, pages 434-443, 2004.
6. Luca Becchetti and Stefano Leonardi. Nonclairvoyant scheduling to minimize the total flow time on single and parallel machines. J. ACM, 51 (4):517-539, 2004.
7. Luca Becchetti, Stefano Leonardi, Alberto Marchetti-Spaccamela, and Kirk Pruhs. Online weighted flow time and deadline scheduling. J. Discrete Algorithms, 4(3):339-352, 2006. (Pubitemid 44287624)
8. Michael A. Bender, Soumen Chakrabarti, and S. Muthukr-ishnan. Flow and stretch metrics for scheduling continuous job streams. In SODA'98: Proceedings of the ninth annual ACM-SIAM symposium on Discrete algorithms, pages 270-279, 1998.
9. Michael A. Bender, S. Muthukrishnan, and Rajmohan Rajara-man. Improved algorithms for stretch scheduling. In SODA'02: Proceedings of the thirteenth annual ACM-SIAM symposium on Discrete algorithms, pages 762-771, 2002.
10. Jivitej S. Chadha, Naveen Garg, Amit Kumar, and V. N. Muralidhara. A competitive algorithm for minimizing weighted flow time on unrelatedmachines with speed augmentation. In STOC, pages 679-684, 2009.
11. Chandra Chekuri, Ashish Goel, Sanjeev Khanna, and Amit Kumar. Multi-processor scheduling to minimize flow time with epsilon resource augmentation. In László Babai, editor, STOC, pages 363-372, 2004.
12. Chandra Chekuri, Sungjin Im, and Benjamin Moseley. Longest wait first for broadcast scheduling. In WAOA'09: Proceedings of 7th Workshop on Approximation and Online Algorithms, 2009.
13. Chandra Chekuri, Sungjin lm, and Benjamin Moseley. Minimizing maximum response time and delay factor in broadcasting scheduling. In ESA'09: Proceedings of the seventeenth annual European symposium on algorithms, pages 444-455, 2009.
14. Chandra Chekuri and Benjamin Moseley. Online scheduling to minimize the maximum delay factor. In SODA'09: Proceedings of the Nineteenth Annual ACM-SIAM Symposium on Discrete Algorithms, pages 1116-1125, Philadelphia, PA, USA, 2009. Society for Industrial and Applied Mathematics.
15. Jeff Edmonds. Scheduling in the dark. Theor. Comput. Sci, 235(1): 109-141, 2000.
16. Jeff Edmonds and Kirk Pruhs. Scalably scheduling processes with arbitrary speedup curves. In SODA'09: Proceedings of the Nineteenth Annual ACM-SIAM Symposium on Discrete Algorithms, pages 685-692, Philadelphia, PA, USA, 2009. Society for Industrial and Applied Mathematics.
17. Naveen Garg and Amit Kumar. Better algorithms for minimizing average flow-time on related machines. In ICALP (1), pages 181-190, 2006. (Pubitemid 44113299)
18. Naveen Garg and Amit Kumar. Minimizing average flow time on related machines. In Jon M. Kleinberg, editor, STOC, pages 730-738. ACM, 2006. (Pubitemid 44306607)
19. Naveen Garg and Amit Kumar. Minimizing average flow-time : Upper and lower bounds. In FOCS, pages 603-613, 2007.
20. Anupam Gupta, Sungjin Im, Ravishankar Krishnaswamy, Benjamin Moseley, and Kirk Pruhs. Scheduling jobs with varying parallelizability to reduce variance. In SPAA'10: 22nd ACM Symposium on Parallelism in Algorithms and Architectures, 2010.
21. Mor Harchol-Balter, Mark E. Crovella, and Sungsim Park. The case for srpt scheduling in web servers. Technical report, 1998.
22. Sungjin lm and Benjamin Moseley. An online scalable algorithm for average flow time in broadcast scheduling. In SODA'10: Proceedings of the Twentieth Annual ACM-SIAM Symposium on Discrete Algorithms, 2010.
23. Bala Kalyanasundaram and Kirk Pruhs. Speed is as powerful as clairvoyance. J. ACM, 47(4):617-643, 2000.
24. Stefano Leonardi and Danny Raz. Approximating total flow time on parallel machines. J. Comput. Syst. Sci., 73(6):875-891, 2007. (Pubitemid 46907088)
25. Cynthia A. Phillips, Clifford Stein, Eric Torng, and Joel Wein. Optimal time-critical scheduling via resource augmentation. Algoritmica, 32(2): 163-200, 2002.
26. Kirk Pruhs. Competitive online scheduling for server systems. SIGMETRICS Perform. Eval. Rev., 34(4):52-58, 2007.
27. Abraham Silberschatz and Peter Galvin. Operating System Concepts, 4th edition. Addison-Wesley, 1994.
28. Andrew S. Tanenbaum. Modern Operating Systems. Prentice Hall Press, Upper Saddle River, NJ, USA, 2007.