Minimizing total busy time in parallel scheduling with application to optical networks

IPDPS 2009 - Proceedings of the 2009 IEEE International Parallel and Distributed Processing Symposium

Volumn , Issue , 2009, Pages

  Flammini, Michele ^a   Monaco, Gianpiero ^a   Moscardelli, Luca ^b   Shachnai, Hadas ^c   Shalom, Mordechai ^d   Tamir, Tami ^e   Zaks, Shmuel ^c  

^a UNIVERSITY OF L'AQUILA   (Italy)

^b UNIVERSITY OF CHIETI   (Italy)

^c TECHNION ISRAEL INSTITUTE OF TECHNOLOGY   (Israel)

^d TEL HAI COLLEGE   (Israel)

^e INTERDISCIPLINARY CENTER   (Israel)

Author keywords

[No Author keywords available]

Indexed keywords

NP-HARD; OPTICAL NETWORKS; PARALLEL SCHEDULING; SCHEDULING PROBLEM; SINGLE MACHINES; TIME INTERVAL;

COMPUTATIONAL COMPLEXITY; DISTRIBUTED PARAMETER NETWORKS;

APPROXIMATION ALGORITHMS;

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

References (15)

1. R. Bar-Yehuda A. Bar-Noy, A. Freund, J. Naor, and B. Schieber. A unified approach to approximating resource allocation and scheduling. Journal of the ACM, pages 1-23, 2000.
2. S. Bhatia, J. Chuzhoy, A. Freund, and J. Naor. Algorithmic aspects of bandwidth trading. ACM Transactions on Algorithms, 3(1), 2007.
3. P. Brucker. Scheduling Algorithms, 5th ed. Springer, 2007.
4. A. L. Chiu and E. H. Modiano. Traffic grooming algorithms for reducing electronic multiplexing costs in wdm ring networks. Journal of Lightwave Technology, 18(1):2-12, January 2000.
5. J. Y-T. Leung (ed.). Handbook of Scheduling: Algorithms, Models, and Performance Analysis. CRS Press, 2004.
6. 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 (EuroPar), Las Palmas de Gran Canaria, Spain, August 26-29, 2008.
7. M. Flammini, L. Moscardelli, M. Shalom, and S. Zaks. Approximating the traffic grooming problem. In ISAAC, pages 915-924, 2005.
8. H. N. Gabow. An efficient reduction technique for degree-constrained subgraph and bidirected network flow problems. In STOC, pages 448-456, 1983.
9. O. Gerstel, R. Ramaswami, and G. Sasaki. Cost effective traffic grooming in wdm rings. In INFOCOM'98, Seventeenth Annual Joint Conference of the IEEE Computer and Communications Societies, 1998.
10. D. Gijswijt, V. Jost, and M. Queyranne. Clique partitioning of interval graphs with submodular costs on the cliques. RAIRO-Operations Research-Recherche Opérationelle, 41(3):275-287, 2007.
11. P. E. Green. Fiber-Optic Communication Networks. Prentice Hall, 1992.
12. R. Klasing. Methods and problems of wavelength-routing in all-optical networks. In Proceeding of the MFCS'98 Workshop on Communication, August 24-25, Brno, Czech Republic, pages 1-9, 1998.
13. 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.
14. E. Lawler, J.K. Lenstra, A.H.G.R. 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.
15. P. Winkler and L. Zhang. Wavelength assignment and generalized interval graph coloring. In SODA, pages 830-831, 2003.