A competitive algorithm for minimizing weighted flow time on unrelated machines with speed augmentation

Proceedings of the Annual ACM Symposium on Theory of Computing

Volumn , Issue , 2009, Pages 679-683

  Chadha, Jivitej S ^a   Garg, Naveen ^a   Kumar, Amit ^a   Muralidhara, V N ^a  

^a INDIAN INSTITUTE OF TECHNOLOGY DELHI   (India)

Author keywords

Approximation algorithms; Competitive ratio; Flow time; Scheduling

Indexed keywords

COMPETITIVE ALGORITHMS; COMPETITIVE RATIO; DISPATCH ALGORITHMS; FLOW-TIME; OFF-LINE ALGORITHM; ON-LINE ALGORITHMS; ONLINE PROBLEMS; PARALLEL MACHINE; POTENTIAL FUNCTION; RELATED MACHINES; SCHEDULING JOBS; UNRELATED MACHINES;

COMPUTATION THEORY; PARALLEL ALGORITHMS;

APPROXIMATION ALGORITHMS;

EID: 70350674330     PISSN: 07378017     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1536414.1536506     Document Type: Conference Paper

References (17)

1. S. Anand, Naveen Garg, and Amit Kumar. An O(log P) competitive algorithm for minimizing flow time on related machines. Unpublished manuscript, 2009.
2. Nir Avrahami and Yossi Azar. Minimizing total flow time and total completion time with immediate dispatching. Algorithmica, 47(3):253-268, 2007.
3. Baruch Awerbuch, Yossi Azar, Stefano Leonardi, and Oded Regev. Minimizing the flow time without migration. In ACM Symposium on Theory of Computing, pages 198-205, 1999.
4. Baruch Awerbuch, Yossi Azar, Stefano Leonardi, and Oded Regev. Minimizing the flow time without migration. SIAM J. Comput., 31(5):1370-1382, 2002.
5. p norm: A rising tide lifts all boats. In ACM Symposium on Theory of Computing, pages 242-250, 2003.
6. Nikhil Bansal, Ho-Leung Chan, Rohit Khandekar, Kirk Pruhs, Clifford Stein, and Baruch Schieber. Non-preemptive min-sum scheduling with resource augmentation. In IEEE Symposium on Foundations of Computer Science, pages 614-624, 2007.
7. 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.
8. C. Chekuri, S. Khanna, and A. Zhu. Algorithms for weighted flow time. In ACM Symposium on Theory of Computing, pages 84-93. ACM, 2001.
9. Chandra Chekuri, Ashish Goel, Sanjeev Khanna, and Amit Kumar. Multi-processor scheduling to minimize ow time with epsilon resource augmentation. In ACM Symposium on Theory of Computing, pages 363-372, 2004.
10. Naveen Garg and Amit Kumar. Better algorithms for minimizing average flow-time on related machines. In ICALP (1), pages 181-190, 2006.
11. Naveen Garg and Amit Kumar. Minimizing average flow time on related machines. In ACM Symposium on Theory of Computing, pages 730-738, 2006.
12. Naveen Garg and Amit Kumar. Minimizing average ow-time : Upper and lower bounds. In IEEE Symposium on Foundations of Computer Science, pages 603-613, 2007.
13. Naveen Garg, Amit Kumar, and Muralidhara V N. Minimizing total flow-time: The unrelated case. In ISAAC, pages 424-435, 2008.
14. Bala Kalyanasundaram and Kirk Pruhs. Speed is as powerful as clairvoyance. In IEEE Symposium on Foundations of Computer Science, pages 214-221, 1995.
15. Hans Kellerer, Thomas Tautenhahn, and Gerhard J. Woeginger. Approximability and nonapproximability results for minimizing total flow time on a single machine. In ACM Symposium on Theory of Computing, pages 418-426, 1996.
16. Stefano Leonardi and Danny Raz. Approximating total flow time on parallel machines. In ACM 1Symposium on Theory of Computing, pages 110-119, 1997.
17. R. Motwani, S. Phillips, and E. Torng. Non-clairvoyant scheduling. Theoretical Computer Science, 130(1):17-47, 1994.