Abstract
We are given a set of n jobs and a single processor that can vary its speed dynamically. Each job J j is characterized by its processing requirement (work) p j , its release date r j and its deadline d j . We are also given a budget of energy E and we study the scheduling problem of maximizing the throughput (i.e. the number of jobs which are completed on time). We show that the problem can be solved by dynamic programming when all the jobs are released at the same time in O(n 4 logn logP), where P is the sum of the processing requirements of the jobs. For the more general case of agreeable deadlines, where the jobs can be ordered such that for every i < j, both r i ≤ r j and d i ≤ d j , we propose a dynamic programming algorithm solving the problem optimally in O(n 6 logn logP). In addition, we consider the weighted case where every job j is also associated with a weight w j and we are interested in maximizing the weighted throughput. For this case, we prove that the problem becomes \({\cal NP}\)-hard in the ordinary sense and we propose a pseudo-polynomial time algorithm.
This work has been supported by the ANR project TODO (09-EMER-010), by PHC CAI YUANPEI (27927VE) and by the ALGONOW project of the THALES program.
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 subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Baptiste, P.: An O(n 4) algorithm for preemptive scheduling of a single machine to minimize the number of late jobs. Operations Research Letters 24(4), 175–180 (1999)
Graham, R.L., Lawler, E.L., Lenstra, J.K., Rinnooy Kan, A.H.G.: Optimization and Approximation in Deterministic Sequencing and Scheduling: A Survey. Annals of Operations Research 5, 287–326 (1979)
Yao, F.F., Demers, A.J., Shenker, S.: A Scheduling Model for Reduced CPU Energy. In: Symposium on Foundations of Computer Science (FOCS), pp. 374–382 (1995)
Kise, H., Ibaraki, T., Mine, H.: A Solvable Case of the One-Machine Scheduling Problem with Ready and Due Times. Operations Research Letters 26(4), 121–126 (1978)
Moore, J.M.: An n job, one machine sequencing algorithm for minimizing the number of late jobs. Management Science 15, 102–109 (1968)
Lawler, E.L.: A dynamic programming algorithm for preemptive scheduling of a single machine to minimize the number of late jobs. Annals of Operations Research 26, 125–133 (1990)
Lawler, E.L.: Knapsack-like scheduling problems, the Moore-Hodgson algorithm and the ‘tower of sets’ property. Mathematical and Computer Modeling, 91–106 (1994)
Bansal, N., Chan, H.-L., Lam, T.-W., Lee, L.-K.: Scheduling for Speed Bounded Processors. In: Aceto, L., Damgård, I., Goldberg, L.A., Halldórsson, M.M., Ingólfsdóttir, A., Walukiewicz, I. (eds.) ICALP 2008, Part I. LNCS, vol. 5125, pp. 409–420. Springer, Heidelberg (2008)
Chan, H.-L., Chan, W.-T., Lam, T.W., Lee, L.-K., Mak, K.-S., Wong, P.W.H.: Energy Efficient Online Deadline Scheduling. In: SODA 2007, pp. 795–804 (2007); ACM Transactions on Algorithms
Chan, H.-L., Lam, T.-W., Li, R.: Tradeoff between Energy and Throughput for Online Deadline Scheduling. In: Jansen, K., Solis-Oba, R. (eds.) WAOA 2010. LNCS, vol. 6534, pp. 59–70. Springer, Heidelberg (2011)
Chan, J.W.-T., Lam, T.-W., Mak, K.-S., Wong, P.W.H.: Online Deadline Scheduling with Bounded Energy Efficiency. In: Cai, J.-Y., Cooper, S.B., Zhu, H. (eds.) TAMC 2007. LNCS, vol. 4484, pp. 416–427. Springer, Heidelberg (2007)
Li, M.: Approximation Algorithms for Variable Voltage Processors: Min Energy, Max Throughput and Online Heuristics. In: Dong, Y., Du, D.-Z., Ibarra, O. (eds.) ISAAC 2009. LNCS, vol. 5878, pp. 372–382. Springer, Heidelberg (2009)
Lam, T.-W., Lee, L.-K., To, I.K.K., Wong, P.W.H.: Energy Efficient Deadline Scheduling in Two Processor Systems. In: Tokuyama, T. (ed.) ISAAC 2007. LNCS, vol. 4835, pp. 476–487. Springer, Heidelberg (2007)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2013 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Angel, E., Bampis, E., Chau, V., Letsios, D. (2013). Throughput Maximization for Speed-Scaling with Agreeable Deadlines. In: Chan, TH.H., Lau, L.C., Trevisan, L. (eds) Theory and Applications of Models of Computation. TAMC 2013. Lecture Notes in Computer Science, vol 7876. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-38236-9_2
Download citation
DOI: https://doi.org/10.1007/978-3-642-38236-9_2
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-38235-2
Online ISBN: 978-3-642-38236-9
eBook Packages: Computer ScienceComputer Science (R0)