Optimizing busy time on parallel machines

Proceedings of the 2012 IEEE 26th International Parallel and Distributed Processing Symposium, IPDPS 2012

Volumn , Issue , 2012, Pages 238-248

  Mertzios, George B ^a   Shalom, Mordechai ^b   Voloshin, Ariella ^c   Wong, Prudence W H ^d   Zaks, Shmuel ^c  

^a DURHAM UNIVERSITY   (United Kingdom)

^b TEL HAI COLLEGE   (Israel)

^c TECHNION ISRAEL INSTITUTE OF TECHNOLOGY   (Israel)

^d UNIVERSITY OF LIVERPOOL   (United Kingdom)

Author keywords

approximation algorithms; busy time; Interval scheduling; resource allocation

Indexed keywords

BOUNDED CAPACITIES; BUDGET CONSTRAINT; BUSY TIME; COMPLETION TIME; CONSTANT-FACTOR APPROXIMATION ALGORITHMS; IDENTICAL MACHINES; INTERVAL SCHEDULING; JOB SCHEDULING PROBLEM; MAXIMIZATION PROBLEM; MINIMIZATION PROBLEMS; NP-HARD; OPTIMAL SOLUTIONS; PARALLEL MACHINE; POLYNOMIAL-TIME; SCHEDULING PROBLEM; SWITCHING COSTS;

COMPUTATIONAL COMPLEXITY; DISTRIBUTED PARAMETER NETWORKS; FIBER OPTIC NETWORKS; OPTIMIZATION; POLYNOMIAL APPROXIMATION; RESOURCE ALLOCATION; SCHEDULING;

APPROXIMATION ALGORITHMS;

EID: 84866839883     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/IPDPS.2012.31     Document Type: Conference Paper

References (29)

1. J. Augustine, S. Irani, and C. Swany. Optimal power-down strategies. In Proc. FOCS, pages 530-539, 2004.
2. A. Bar-Noy, R. Bar-Yehuda, A. Freund, J. Naor, and B. Schieber. A unified approach to approximating resource allocation and scheduling. Journal of the ACM, 48(5):1069-1090, 2001.
3. R. Bhatia, J. Chuzhoy, A. Freund, and J. Naor. Algorithmic aspects of bandwidth trading. In Automata, Languages and Programming, volume 2719, pages 193-193. Springer Berlin / Heidelberg, 2003.
4. P. Brucker. Scheduling Algorithms, 5th ed. Springer, 2007.
5. G. Calinescu, A. Chakrabarti, H. Karloff, and Y. Rabani. Improved approximation algorithms for resource allocation. In W. Cook and A. Schulz, editors, Integer Programming and Combinatorial Optimization, volume 2337 of Lecture Notes in Computer Science, pages 401-414. Springer Berlin / Heidelberg, 2006.
6. S.-H. Chan, T. W. Lam, L.-K. Lee, C.-M. Liu, and H.-F. Ting. Sleep management on multiple machines for energy and flow time. In Proceedings of 38th International Colloquium on Automata, Languages and Programming (ICALP), pages 219-231, 2011.
7. B. Chen, R. Hassin, and M. Tzur. Allocation of bandwidth and storage. IIE Transactions, 34:501-507, 2002.
8. S. Chen, I. Ljubic, and S. Raghavan. The regenerator location problem. Networks, 55(3):205-220, May 2010.
9. Y. Fang, F. Wang, and J. Ge. A task scheduling algorithm based on load balancing in cloud computing. In Proceedings of 2010 international conference on Web information systems and mining, pages 271-277, 2010.
10. R. Fedrizzi, G. M. Galimberti, O. Gerstel, G. Martinelli, E. Salvadori, C. V. Saradhi, A. Tanzi, and A. Zanardi. A framework for regenerator site selection based on multiple paths. In Prooceedings of IEEE/OSA Conference on Optical Fiber Communications (OFC), pages 1-3, 2010.
11. M. Flammini, A. Marchetti-Spaccamela, G. Monaco, L. Moscardelli, and S. Zaks. On the complexity of the regenerator placement problem in optical networks. In Proceedings of the 21st Annual ACM Symposium on Parallel Algorithms and Architectures (SPAA), pages 154-162, 2009.
12. M. Flammini, G. Monaco, L. Moscardelli, H. Shachnai, M. Shalom, T. Tamir, and S. Zaks. Minimizing total busy time in parallel scheduling with application to optical networks. Theor. Comput. Sci., 411(40-42):3553-3562, 2010.
13. M. Flammini, G. Monaco, L. Moscardelli, M. Shalom, and S. Zaks. Approximating the traffic grooming problem with respect to adms and oadms. In 14th International European Conference on Parallel and Distributed Computing (EURO-PAR 2008), Canary Island, Spain, August 2008.
14. C. A. J. Hurkens and A. Schrijver. On the size of systems of sets every t of which have an sdr, with an application to the worst-case ratio of heuristics for packing problems. SIAM Journal Of Discrete Mathematics, 2(1):68-722, Feb 1989.
15. J. Kang and S. Ranka. Energy-efficient dynamic scheduling on parallel machines. In Proceedings of the 15th international conference on High performance computing, pages 208-219, 2008.
16. R. Khandekar, B. Schieber, H. Shachnai, and T. Tamir. Minimizing busy time in multiple machine real-time scheduling. In Intl Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS), pages 169-180, 2010.
17. A. W. Kolen, J. K. Lenstra, C. H. Papadimitriou, and F. C. Spieksma. Interval scheduling: A survey. Naval Research Logistics (NRL), 54(5):530-543, 2007.
18. M. Y. Kovalyov, C. T. Ng, and T. C. E. Cheng. Fixed interval scheduling: Models, applications, computational complexity and algorithms. European Journal of Operational Research, 178(2):331-342, 2007.
19. E. Lawler, J. Lenstra, A. Kan, and D. Shmoys. Sequencing and scheduling: Algorithms and complexity. S. C. Graves, A. H. G. Rinnooy Kan, and P. Zipkin (eds.), Handbooks in Operations Research and Management Science, 4, 1993.
20. W. T. Ludwig. Algorithms for scheduling malleable and nonmalleable parallel tasks. PhD thesis, 1995.
21. A. Manzak and C. Chakrabarti. Variable voltage task scheduling algorithms for minimizing energy/power. Very Large Scale Integration (VLSI) Systems, IEEE Transactions on, 11(2):270-276, 2003.
22. A. Oprescu and T. Kielmann. Bag-of-tasks scheduling under budget constraints. In Cloud Computing Technology and Science (CloudCom), 2010 IEEE Second International Conference on, pages 351-359, 2010.
23. C. A. Phillips, R. N. Uma, and J. Wein. Off-line admission control for general scheduling problems. In Proceedings of the eleventh annual ACM-SIAM symposium on Discrete algorithms, SODA '00, pages 879-888, 2000.
24. U. Schwarz. Tightness results for malleable task scheduling algorithms. In Parallel Processing and Applied Mathematics, pages 1059-1067. 2008.
25. W. Shi and B. Hong. Resource allocation with a budget constraint for computing independent tasks in the cloud. In Cloud Computing Technology and Science (CloudCom), 2010 IEEE Second International Conference on, pages 327-334, 2010.
26. N. Vasić, M. Barisits, V. Salzgeber, and D. Kostic. Making cluster applications energy-aware. In Proceedings of the 1st workshop on Automated control for datacenters and clouds, ACDC '09, pages 37-42, 2009.
27. P. Winkler and L. Zhang. Wavelength assignment and generalized interval graph coloring. In SODA, pages 830-831, 2003.
28. J. Y and T. Leung, editors. Handbook of Scheduling: Algorithms, Models, and Performance Analysis. CRC Press, 2004.
29. F. Yao, A. Demers, and S. Shenker. A scheduling model for reduced CPU energy. In Proc. FOCS, pages 374-382, 1995.