Abstract
We study the following flow shop scheduling problem on two processors. We are given n jobs with a common deadline D, where each job j has workload \(p_{i,j}\) on processor i and a set of processors which can vary their speed dynamically. Job j can be executed on the second processor if the execution of job j is completed on the first processor. Our objective is to find a feasible schedule such that all jobs are completed by the common deadline D with minimized energy consumption. For this model, we present a linear program for the discrete speed case, where the processor can only run at specific speeds in \(S = \{s_1,s_2,\cdots ,s_q\}\) and the job execution order is fixed. We also provide a \(m^{\alpha -1}\)-approximation algorithm for the arbitrary order case and for continuous speed model where m is the number of processors and \(\alpha \) is a parameter of the processor.
We then introduce a new variant of flow shop scheduling problem called sense-and-aggregate model motivated by data aggregation in wireless sensor networks where the base station needs to receive data from sensors and then compute a single aggregate result. In this model, the first processor will receive unit size data from sensors and the second processor is responsible for calculating the aggregate result. The second processor can decide when to aggregate and the workload that needs to be done to aggregate x data will be f(x) and another unit size data will be generated as the result of the partial aggregation which will then be used in the next round aggregation. Our objective is to find a schedule such that all data are received and aggregated by the deadline with minimum energy consumption. We present an \(O(n^5)\) dynamic programming algorithm when \(f(x)=x\) and a greedy algorithm when \(f(x)=x-1\).
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
References
Albers, S.: Energy-efficient algorithms. Commun. ACM 53(5), 86–96 (2010)
Albers, S.: Algorithms for dynamic speed scaling. In: Proceedings of 28th STACS 2011, vol. 9, pp. 1–11. LIPIcs (2011)
Brucker, P.: Scheduling Algorithms, vol. 3. Springer, Heidelberg (2007)
Fang, K., Uhan, N.A., Zhao, F., Sutherland, J.W.: Flow shop scheduling with peak power consumption constraints. Ann. OR 206(1), 115–145 (2013)
Gaujal, B., Navet, N.: Navet.: Dynamic voltage scaling under EDF revisited. Real-Time Syst. 37(1), 77–97 (2007)
Johnson, S.M.: Optimal two-and three-stage production schedules with setup times included. Nav. Res. Logist. Q. 1(1), 61–68 (1954)
Kwon, W.-C., Kim, T.: Optimal voltage allocation techniques for dynamically variable voltage processors. ACM TECS 4(1), 211–230 (2005)
Li, M., Yao, A.C., Yao, F.F.: Discrete and continuous min-energy schedules for variable voltage processors. Proc. Nat. Acad. Sci. U.S.A. 103(11), 3983–3987 (2006)
Li, M., Yao, F.F., Yuan, H.: An O(n\(^2\)) algorithm for computing optimal continuous voltage schedules. CoRR abs/1408.5995 (2014)
Mu, Z., Li, M.: DVS scheduling in a line or a star network of processors. J. Comb. Optim. 29(1), 16–35 (2015)
Wierman, A., Andrew, L.L.H., Tang, A.: Power-aware speed scaling in processor sharing systems: optimality and robustness. Perform. Eval. 69(12), 601–622 (2012)
Yao, F.F., Demers, A.J., Shenker, S.: A scheduling model for reduced CPU energy. In: 36th FOCS, pp. 374–382. IEEE Computer Society (1995)
Acknowledgments
This work was fully supported by a grant from the Research Grants Council of the Hong Kong Special Administrative Region, China [Project No. CityU 117913].
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2016 Springer International Publishing Switzerland
About this paper
Cite this paper
Chau, V., Fong, K.C.K., Li, M., Wang, K. (2016). Flow Shop for Dual CPUs in Dynamic Voltage Scaling. In: Dinh, T., Thai, M. (eds) Computing and Combinatorics . COCOON 2016. Lecture Notes in Computer Science(), vol 9797. Springer, Cham. https://doi.org/10.1007/978-3-319-42634-1_42
Download citation
DOI: https://doi.org/10.1007/978-3-319-42634-1_42
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-42633-4
Online ISBN: 978-3-319-42634-1
eBook Packages: Computer ScienceComputer Science (R0)