Online optimization of busy time on parallel machines

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 7287 LNCS, Issue , 2012, Pages 448-460

  Shalom, Mordechai ^a   Voloshin, Ariella ^b   Wong, Prudence W H ^c   Yung, Fencol C C ^c   Zaks, Shmuel ^b  

^a TEL HAI COLLEGE   (Israel)

^b TECHNION ISRAEL INSTITUTE OF TECHNOLOGY   (Israel)

^c UNIVERSITY OF LIVERPOOL   (United Kingdom)

Author keywords

busy time; cost minimization; Interval scheduling; online algorithms; resource allocation; throughput maximization

Indexed keywords

BUSY TIME; COST MINIMIZATION; INTERVAL SCHEDULING; ON-LINE ALGORITHMS; THROUGHPUT MAXIMIZATION;

FIBER OPTIC NETWORKS; RESOURCE ALLOCATION; SCHEDULING;

SCHEDULING ALGORITHMS;

EID: 84861003585     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-642-29952-0_43     Document Type: Conference Paper

References (30)

1. Bar-Noy, A., Bar-Yehuda, R., Freund, A., Naor, J., Schieber, B.: A unified approach to approximating resource allocation and scheduling. Journal of the ACM, 1-23 (2000)
2. Bhatia, R., Chuzhoy, J., Freund, A., Naor, J.: Algorithmic Aspects of Bandwidth Trading. In: Baeten, J.C.M., Lenstra, J.K., Parrow, J., Woeginger, G.J. (eds.) ICALP 2003. LNCS, vol. 2719, pp. 751-766. Springer, Heidelberg (2003)
3. Borodin, A., El-Yaniv, R.: Online Computation and Competitive Analysis. Cambridge University Press (1998)
4. Brucker, P.: Scheduling Algorithms, 5th edn. Springer (2007)
5. Calinescu, G., Chakrabarti, A., Karloff, H., Rabani, Y.: Improved Approximation Algorithms for Resource Allocation. In: Cook, W.J., Schulz, A.S. (eds.) IPCO 2002. LNCS, vol. 2337, pp. 401-414. Springer, Heidelberg (2002)
6. Chen, B., Hassin, R., Tzur, M.: Allocation of bandwidth and storage. IIE Transactions 34, 501-507 (2002)
7. Chen, S., Ljubic, I., Raghavan, S.: The regenerator location problem. Networks 55(3), 205-220 (2010)
8. J.Y.-T.L. (ed.): Handbook of Scheduling: Algorithms, Models, and Performance Analysis. CRS Press (2004)
9. Fedrizzi, R., Galimberti, G.M., Gerstel, O., Martinelli, G., Salvadori, E., Saradhi, C.V., Tanzi, A., Zanardi, A.: A framework for regenerator site selection based on multiple paths. In: OFC, pp. 1-3 (2010)
10. Flammini, M., Marchetti-Spaccamela, A., Monaco, G., Moscardelli, L., Zaks, S.: On the complexity of the regenerator placement problem in optical networks. In: SPAA, pp. 154-162 (2009);
11. IEEE/ACM Transactions on Networking
12. Flammini, M., Monaco, G., Moscardelli, L., Shachnai, H., Shalom, M., Tamir, T., Zaks, S.: Minimizing total busy time in parallel scheduling with application to optical networks. Theor. Comput. Sci. 411(40-42), 3553-3562 (2010)
13. Flammini, M., Monaco, G., Moscardelli, L., Shalom, M., Zaks, S.: Approximating the Traffic Grooming Problem with Respect to ADMs and OADMs. In: Luque, E., Margalef, T., Benítez, D. (eds.) Euro-Par 2008. LNCS, vol. 5168, pp. 920-929. Springer, Heidelberg (2008)
14. Khandekar, R., Schieber, B., Shachnai, H., Tamir, T.: Minimizing busy time in multiple machine real-time scheduling. In: FSTTCS, pp. 169-180 (2010)
15. Kolen, A.W., Lenstra, J.K., Papadimitriou, C.H., Spieksma, F.C.: Interval scheduling: A survey. Naval Research Logistics (NRL) 54(5), 530-543 (2007)
16. Kovalyov, M.Y., Ng, C.T., Cheng, T.C.E.: Fixed interval scheduling: Models, applications, computational complexity and algorithms. European Journal of Operational Research 178(2), 331-342 (2007)
17. Krumke, S.O., Thielen, C., Westphal, S.: Interval scheduling on related machines. Computers and Operations Research 38(12), 1836-1844 (2011)
18. Lawler, E.L., Lenstra, J.K., Kan, A.H.R., Shmoys, D.B.: Sequencing and scheduling: Algorithms and complexity. Handbooks in Operations Research and Management Science 4, 445-522 (1993)
19. Lipton, R.J., Tomkins, A.: Online interval scheduling. In: SODA, pp. 302-311 (1994)
20. Ludwig, W.T.: Algorithms for scheduling malleable and nonmalleable parallel tasks. PhD thesis (1995)
21. Mertzios, G.B., Shalom, M., Wong, P.W.H., Zaks, S.: Online Regenerator Placement. In: Fernàndez Anta, A., Lipari, G., Roy, M. (eds.) OPODIS 2011. LNCS, vol. 7109, pp. 4-17. Springer, Heidelberg (2011)
22. Mertzios, G.B., Shalom, M., Voloshin, A., Wong, P.W.H., Zaks, S.: Optimizing busy time on parallel machines. In: IPDPS (to appear, 2012)
23. Oprescu, A., Kielmann, T.: Bag-of-tasks scheduling under budget constraints. In: CloudCom, pp. 351-359 (2010)
24. Phillips, C.A., Uma, R.N., Wein, J.: Off-line admission control for general scheduling problems. In: SODA, pp. 879-888 (2000)
25. Pruhs, K., Sgall, J., Torng, E.: Online scheduling. In: Leung, J. (ed.) Handbook of Scheduling: Algorithms, Models and Performance Analysis, pp. 15-1-15-41. CRC Press (2004)
26. Schwarz, U.M.: Tightness Results for Malleable Task Scheduling Algorithms. In: Wyrzykowski, R., Dongarra, J., Karczewski, K., Wasniewski, J. (eds.) PPAM 2007. LNCS, vol. 4967, pp. 1059-1067. Springer, Heidelberg (2008)
27. Shalom, M., Voloshin, A., Wong, P.W., Yung, F.C., Zaks, S.: Online optimization of switching cost in optical networks with traffic grooming. Technical Report CS-2012-02, Department of Computer Science, Technion, Haifa, Israel (March 2012)
28. Shi, W., Hong, B.: Resource allocation with a budget constraint for computing independent tasks in the cloud. In: CloudCom, pp. 327-334 (2010)
29. Vasić, N., Barisits, M., Salzgeber, V., Kostic, D.: Making cluster applications energy-aware. In: ACDC, pp. 37-42 (2009)
30. Winkler, P., Zhang, L.: Wavelength assignment and generalized interval graph coloring. In: SODA, pp. 830-831 (2003)