Minimizing busy time in multiple machine real-time scheduling

Leibniz International Proceedings in Informatics, LIPIcs

Volumn 8, Issue , 2010, Pages 169-180

  Khandekar, Rohit ^a   Schieber, Baruch ^a   Shachnai, Hadas ^b   Tamir, Tami ^c  

^a IBM T J WATSON RESEARCH CENTER   (United States)

^b TECHNION ISRAEL INSTITUTE OF TECHNOLOGY   (Israel)

^c INTERDISCIPLINARY CENTER   (Israel)

Author keywords

Approximation algorithm; Busy time; Preemption; Real time scheduling

Indexed keywords

APPROXIMATION RATIOS; BUSY TIME; CAPACITY CONSTRAINTS; OPTICAL NETWORK DESIGN; POWER-AWARE SCHEDULING; PREEMPTION; PROPER INTERVAL GRAPHS; REAL TIME SCHEDULING;

APPROXIMATION ALGORITHMS; SOFTWARE ENGINEERING;

SCHEDULING;

EID: 84880218097     PISSN: 18688969     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.4230/LIPIcs.FSTTCS.2010.169     Document Type: Conference Paper

References (25)

1. R. Bar-Yehuda A. Bar-Noy, A. Freund, J. Naor, and B. Schieber. A unified approach to approximating resource allocation and scheduling. J. of the ACM, pages 1-23, 2000.
2. L. Belede, A. Jain, and R. Reddy Gaddam. Unit commitment with nature and biologically inspired computing. In World Congress on Nature and Biologically Inspired Computing (NABIC), pages 824-829, 2009.
3. S. Bhatia, J. Chuzhoy, A. Freund, and J. Naor. Algorithmic aspects of bandwidth trading. ACM Transactions on Algorithms, 3(1), 2007.
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 9th Conference on Integer Programming and Combinatorial Optimization (IPCO), 2002.
6. B. Chen, R. Hassin, and M. Tzur. Allocation of bandwidth and storage. IIE Transactions, 34:501-507, 2002.
7. J. Y-T. Leung (ed.). Handbook of Scheduling: Algorithms, Models, and Performance Analysis. CRS Press, 2004.
8. J. Edmonds. Paths, trees and flowers. Canadian Journal of Mathematics, 17:449-467, 1965.
9. 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. In IEEE International Parallel & Distributed Processing Symposium (IPDPS), 2009.
10. M. Flammini, G. Monaco, L. Moscardelli, M. Shalom, and S. Zaks. Approximating the traffic grooming problem with respect to adms and oadms. In 14th Euro-Par, 2008.
11. O. Gerstel, R. Ramaswami, and G. Sasaki. Cost effective traffic grooming in wdm rings. In INFOCOM, 1998.
12. J. Kang and S. Ranka. Energy-efficient dynamic scheduling on parallel machines. In High Performance Computing (HiPC), pages 208-219, 2008.
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. J. Leung, L. Kelly, and J. H. Anderson. Handbook of Scheduling: Algorithms, Models, and Performance Analysis. CRC Press, Inc., Boca Raton, FL, USA, 2004.
16. W. T. Ludwig. Algorithms for Scheduling Malleable and Nonmalleable Parallel Tasks. PhD thesis, Dept. of Computer Science, Univ. of Wisconsin - Madison, 1995.
17. A. Manzak and C. Chakrabarti. Variable voltage task scheduling algorithms for minimizing energy/power. IEEE Trans. VLSI Syst. 11(2), pages 501-507, 2003.
18. C.A. Phillips, R.N. Uma, and J. Wein. Off-line admission control for general scheduling problems. J. of Scheduling, 3:365-381, 2000.
19. M. Pinedo. Scheduling: Theory, Algorithms, and Systems. Springer, 2008.
20. U.M. Schwarz. Tightness results for malleable task scheduling algorithms. In Parallel Processing and Applied Mathematics, 2009.
21. J. Turek, J.L. Wolf, and P. S. Yu. Approximate algorithms for scheduling parallelizable tasks. In 4th ACM Symposium on Parallel Algorithms and Architectures (SPAA), 1992.
22. N. Vasić, M. Barisits, V. Salzgeber, and D. Kostić. Making cluster applications energy-aware. In 1st workshop on Automated Control for Datacenters and Clouds (ACDC), 2009.
23. P. Winkler and L. Zhang. Wavelength assignment and generalized interval graph coloring. In 14th ACM-SIAM Symposium on Discrete Algorithms (SODA), pages 830-831, 2003.
24. A.J. Wood and B. Wollenberg. Power Generation Operation and Control. Wiley, 2nd edition, 1996.
25. Y. Zhang, X. Hu, and D.Z. Chen. Task scheduling and voltage selection for energy minimization. In Design Automation Conference (DAC), pages 183-188, 2002.