Abstract
We study the following scheduling problem on a single processor. We are given n jobs, where each job \(j_i\) has an integer release time \(r_i\), processing time \(p_i\) as well as deadline \(d_i\). The processor can schedule an unlimited number of jobs at any time t. Our objective is to schedule the jobs together such that the total number of active time slots is minimized. We present an O(\(n^3\)) dynamic programming algorithm for the case of agreeable deadlines with \(d_i \le d_j\) whenever \(r_i < r_j\) or all jobs are big. In the general case, we present an online algorithm with competitive ratio 4 and show that our analysis is tight.
The work described in this paper was partially supported by a grant from Research Grants Council of the Hong Kong Special Administrative Region, China (Project No. UGC/FDS11/E04/15 and Project No. CityU 11268616).
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsReferences
Albers, S.: Energy-efficient algorithms. Commun. ACM 53(5), 86–96 (2010)
Amur, H., Cipar, J., Gupta, V., Ganger, G.R., Kozuch, M.A., Schwan, K.: Robust and flexible power-proportional storage. In: Proceedings of the 1st ACM SoCC 2010, pp. 217–228. ACM (2010)
Angel, E., Bampis, E., Chau, V.: Low complexity scheduling algorithms minimizing the energy for tasks with agreeable deadlines. Discrete Appl. Math. 175, 1–10 (2014)
Baptiste, P.: Scheduling unit tasks to minimize the number of idle periods: a polynomial time algorithm for offline dynamic power management. In: 2006 Proceedings of the 17th Annual ACM-SIAM SODA, pp. 364–367. ACM Press (2006)
Baptiste, P., Chrobak, M., Dürr, C.: Polynomial time algorithms for minimum energy scheduling. In: Arge, L., Hoffmann, M., Welzl, E. (eds.) ESA 2007. LNCS, vol. 4698, pp. 136–150. Springer, Heidelberg (2007). doi:10.1007/978-3-540-75520-3_14
Chang, J., Gabow, H.N., Khuller, S.: A model for minimizing active processor time. In: Epstein, L., Ferragina, P. (eds.) ESA 2012. LNCS, vol. 7501, pp. 289–300. Springer, Heidelberg (2012). doi:10.1007/978-3-642-33090-2_26
Chang, J., Khuller, S., Mukherjee, K.: LP rounding and combinatorial algorithms for minimizing active and busy time. In: 26th ACM SPAA 2014, pp. 118–127. ACM (2014)
Demaine, E.D., Ghodsi, M., Hajiaghayi, M.T., Sayedi-Roshkhar, A.S., Zadimoghaddam, M.: Scheduling to minimize gaps and power consumption. J. Sched. 16(2), 151–160 (2013)
Fang, X., Gao, H., Li, J., Li, Y.: Application-aware data collection in wireless sensor networks. In: Proceedings of the IEEE INFOCOM 2013, pp. 1645–1653. IEEE (2013)
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. In: 23rd IEEE IPDPS 2009, pp. 1–12. IEEE (2009)
Ikura, Y., Gimple, M.: Efficient scheduling algorithms for a single batch processing machine. Oper. Res. Lett. 5(2), 61–65 (1986)
Irani, S., Pruhs, K.: Algorithmic problems in power management. SIGACT News 36(2), 63–76 (2005)
Khandekar, R., Schieber, B., Shachnai, H., Tamir, T.: Minimizing busy time in multiple machine real-time scheduling. In: IARCS Annual Conference on FSTTCS 2010. LIPIcs, vol. 8, pp. 169–180 (2010)
Koehler, F., Khuller, S.: Optimal batch schedules for parallel machines. In: Dehne, F., Solis-Oba, R., Sack, J.-R. (eds.) WADS 2013. LNCS, vol. 8037, pp. 475–486. Springer, Heidelberg (2013). doi:10.1007/978-3-642-40104-6_41
Shalom, M., Voloshin, A., Wong, P.W.H., Yung, F.C.C., Zaks, S.: Online optimization of busy time on parallel machines. In: Agrawal, M., Cooper, S.B., Li, A. (eds.) TAMC 2012. LNCS, vol. 7287, pp. 448–460. Springer, Heidelberg (2012). doi:10.1007/978-3-642-29952-0_43
Tavakoli, A., Kansal, A., Nath, S.: On-line sensing task optimization for shared sensors. In: Proceedings of the 9th ACM/IEEE International Conference on Information Processing in Sensor Networks, pp. 47–57. ACM (2010)
Tian, W., Xue, R., Cao, J., Xiong, Q., Hu, Y.: An energy-efficient online parallel scheduling algorithm for cloud data centers. In: 2013 IEEE Ninth World Congress on Services (SERVICES), pp. 397–402. IEEE (2013)
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2017 Springer International Publishing AG
About this paper
Cite this paper
Fong, K.C.K., Li, M., Li, Y., Poon, SH., Wu, W., Zhao, Y. (2017). Scheduling Tasks to Minimize Active Time on a Processor with Unlimited Capacity. In: Gopal, T., Jäger , G., Steila, S. (eds) Theory and Applications of Models of Computation. TAMC 2017. Lecture Notes in Computer Science(), vol 10185. Springer, Cham. https://doi.org/10.1007/978-3-319-55911-7_18
Download citation
DOI: https://doi.org/10.1007/978-3-319-55911-7_18
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-55910-0
Online ISBN: 978-3-319-55911-7
eBook Packages: Computer ScienceComputer Science (R0)