Scheduling to minimize power consumption using submodular functions

Annual ACM Symposium on Parallelism in Algorithms and Architectures

Volumn , Issue , 2010, Pages 21-29

  Demaine, Erik D ^a   Zadimoghaddam, Morteza ^a  

^a MASSACHUSETTS INSTITUTE OF TECHNOLOGY   (United States)

Author keywords

Approximation algorithms; Multiprocessor scheduling; Pre emptive scheduling; Sleep state

Indexed keywords

BUDGET CONSTRAINT; FEASIBLE SCHEDULE; LOGARITHMIC APPROXIMATION; MULTI PROCESSOR SCHEDULING; OPTIMAL SCHEDULE; POWER CONSUMPTION; POWER USAGE; PRE-EMPTIVE SCHEDULING; SET-COVER; SLEEP STATE; SUBMODULAR FUNCTIONS; TASK-SCHEDULING; TIME INTERVAL; TOTAL POWER;

MULTIPROCESSING SYSTEMS; NANOTECHNOLOGY; OPTIMIZATION; SCHEDULING ALGORITHMS;

APPROXIMATION ALGORITHMS;

EID: 77954911046     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1810479.1810483     Document Type: Conference Paper

References (11)

1. J. Augustine, S. Irani, and C. Swamy. Optimal power-down strategies. In Proceedings of the 45th Symposium on Foundations of Computer Science, pages 530-539, Rome, Italy, October 2004.
2. P. Baptiste. Scheduling unit tasks to minimize the number of idle periods: a polynomial time algorithm for offline dynamic power management. In Proceedings of the 17th Annual ACM-SIAM Symposium on Discrete Algorithm, pages 364-367, Miami, Florida, 2006.
3. MohammadHossein Bateni, MohammadTaghi Hajiaghayi, Morteza Zadimoghaddam. The submodular secretary problem and its extensions Manuscript.
4. Erik D. Demaine, Mohammad Ghodsi, MohammadTaghi Hajiaghayi, Amin S. Sayedi-Roshkhar and Morteza Zadimoghaddam. Scheduling to Minimize Gaps and Power Consumption. In Proceedings of the 19th ACM Symposium on Parallelism in Algorithms and Architectures (SPAA), Pages 46-54, San Diego, California, June 2007.
5. E. Even-dar, Y. Mansour, V. S. Mirrokni, M. Muthukrishnan, U. Nadav. Bid Optimization for Broad-Match Ad Auctions. In Proceedings of the 18th International World Wide Web Conference, Pages 231-240, Madrid, Spain, 2009.
6. S. Irani, S. Shukla, and R. Gupta. Algorithms for power savings. In Proceedings of the 14th Annual ACM-SIAM Symposium on Discrete Algorithms, pages 37-46, Baltimore, Maryland, 2003.
7. Johnson, D. S. Approximation Algorithms for Combinatorial Problems. In Proceedings of the fifth annual ACM Symposium on Theory of Computing, Pages 38-49, Austin, Texas, 1973.
8. Nitish Korula and Martin Pal. Algorithms for Secretary Problems on Graphs and Hypergraphs. In Proceedings of the 36th International Colloquium on Automata, Languages and Programming, Pages 508-520, Rhodes, Greece, July, 2009.
9. Ariel Kulik, Hadas Shachnai, and Tami Tamir. Maximizing submodular set functions subject to multiple linear constraints. In Proceedings of the Nineteenth Annual ACM -SIAM Symposium on Discrete Algorithms, Pages 545-554, New York, 2009.
10. Jon Lee, Vahab S. Mirrokni, Viswanath Nagarajan, Maxim Sviridenko. Non-monotone submodular maximization under matroid and knapsack constraints. In Proceedings of the 41th annual ACM Symposium on Theory of Computing, Pages 323-332, Bethesda, Maryland, 2009.
11. Raz, R., and Safra, S. A sub-constant error-probability low-degree test, and sub-constant error-probability PCP characterization of NP. In Proceedings of the 29th annual ACM Symposium on Theory of Computing, Pages 475-484, El Paso, Texas, 1997.