Abstract
Energy-efficient scheduling of stochastic tasks is considered in this paper. The main characteristic of a stochastic task is that its execution time is a random variable whose actual value is not known in advance, but only its probability distribution. Our performance measures are the probability that the total execution time does not exceed a given bound and the probability that the total energy consumption does not exceed a given bound. Both probabilities need to be maximized. However, maximizations of the two performance measures are conflicting objectives. Our strategy is to fix one and maximize the other. Our investigation includes the following two aspects, with the purpose of maximizing the probability for the total execution time not to exceed a given bound, under the constraint that the probability for the total energy consumption not to exceed a given bound is at least certain value. First, we explore the technique of optimal processor speed setting for a given set of stochastic tasks on a processor with variable speed. It is found that the simple equal speed method (in which all tasks are executed with the same speed) yields high quality solutions. Second, we explore the technique of optimal stochastic task scheduling for a given set of stochastic tasks on a multiprocessor system, assuming that the equal speed method is used. We propose and evaluate the performance of several heuristic stochastic task scheduling algorithms. Our simulation studies identify the best methods among the proposed heuristic methods.
Similar content being viewed by others
References
Ahmadizar F, Ghazanfari M, Ghomi SMTF (2010) Group shops scheduling with makespan criterion subject to random release dates and processing times. Comput Oper Res 37(1):152–162
Ando E, Nakata T, Yamashita M (2009) Approximating the longest path length of a stochastic DAG by a normal distribution in linear time. J Discrete Algorithms 7(4):420–438
Burden RL, Faires JD, Reynolds AC (1981) Numerical analysis, 2nd edn. Prindle, Weber & Schmidt, Boston
Canon L-C, Jeannot E (2009) Precise evaluation of the efficiency and the robustness of stochastic DAG schedules. Research report RR-6895 INRIA
Chandrakasan AP, Sheng S, Brodersen RW (1992) Low-power CMOS digital design. IEEE J Solid State Circuits 27(4):473–484
Chen L, Megow N, Rischke R, Stougie L (2015) Stochastic and robust scheduling in the cloud. In: 18th Int’l Workshop on Approximation Algorithms for Combinatorial Optimization Problems (APPROX’15) and 19th Int’l Workshop on Randomization and Computation (RANDOM’15), pp 175–186
Chrétienne P, Coffman EG, Lenstra JK, Liu Z (eds) (1995) Scheduling theory and its applications. Wiley, Chichester
Dong F, Luo J, Song A, Jin J (2010) Resource load based stochastic DAGs scheduling mechanism for grid environment. In: 12th IEEE International Conference on High Performance Computing and Communications, pp 197–204
Furht B, Escalante A (eds) (2010) Handbook of cloud computing. Springer, New York
Gu J, Gu X, Gu M (2009) A novel parallel quantum genetic algorithm for stochastic job shop scheduling. J Math Anal Appl 355(1):63–81
Jeannot E, Namyst R, Roman J (eds) (2011) Euro-Par 2011 parallel processing. LNCS 6852. Springer, Berlin
Li K, Tang X, Li K (2014) Energy-efficient stochastic task scheduling on heterogeneous computing systems. IEEE Trans Parallel Distrib Syst 25(11):2867–2876
Li K, Tang X, Veeravalli B, Li K (2015) Scheduling precedence constrained stochastic tasks on heterogeneous cluster systems. IEEE Trans Comput 64(1):191–204
Megow N, Uetz M, Vredeveld T (2006) Models and algorithms for stochastic online scheduling. Math Oper Res 31(3):513–525
Möhring RH, Schulz AS, Uetz M (1999) Approximation in stochastic scheduling: the power of LP-based priority policies. J ACM 46(6):924–942
Peng Z, Cui D, Zuo J, Li Q, Xu B, Lin W (2015) Random task scheduling scheme based on reinforcement learning in cloud computing. Cluster Comput 18(4):1595–1607
Rothkopf MH (1966) Scheduling with random service times. Manage Sci 12(9):703–713
Sarin SC, Nagarajan B, Liao L (2010) Stochastic scheduling: expectation-variance analysis of a schedule. Cambridge University Press, Cambridge
Scharbrodt M, Schickinger T, Steger A (2006) A new average case analysis for completion time scheduling. J ACM 53(1):121–146
Shin SY, Gantenbein R, Kuo T-W, Hong J (2011) Reliable and autonomous computational science. Birkhäuser, Basel
Skutella M, Uetz M (2005) Stochastic machine scheduling with precedence constraints. SIAM J Comput 34(4):788–802
Tang X, Li K, Liao G, Fang K, Wu F (2011) A stochastic scheduling algorithm for precedence constrained tasks on grid. Future Gener Comput Syst 27(8):1083–1091
Tongsima S, Sha EHM, Chantrapornchai C, Surma DR, Passos NL (2000) Probabilistic loop scheduling for applications with uncertain execution time. IEEE Trans Comput 49(1):65–80
Wang L, Ranjan R, Chen J, Benatallah B (eds) (2012) Cloud computing: methodology, systems, and applications. CRC Press, Boca Raton
Weiss G (1992) Turnpike optimality of Smith’s rule in parallel machines stochastic scheduling. Math Oper Res 17(2):255–270
Weiss G, Pinedo M (1980) Scheduling tasks with exponential service times on non-identical processors to minimize various cost functions. J Appl Probab 17(1):187–202
Xhafa F, Abraham A (eds) (2008) Metaheuristics for scheduling in distributed computing environments. Springer, Berlin
Zhai B, Blaauw D, Sylvester D, Flautner K (2004) Theoretical and practical limits of dynamic voltage scaling. In: Proceedings of the 41st Design Automation Conference, pp 868–873
Zhang W, Bai E, He H, Cheng AMK (2015) Solving energy-aware real-time tasks scheduling problem with shuffled frog leaping algorithm on heterogeneous platforms. Sensors 15(6):13778–13804
Zhang W, Xie H, Cao B, Cheng AMK (2014) Energy-aware real-time task scheduling for heterogeneous multiprocessors with particle swarm optimization algorithm. Math Prob Eng, Article ID 287475
Zhang Z, Su S, Zhang J, Shuang K, Xu P (2015) Energy aware virtual network embedding with dynamic demands: online and offline, part 3. Comput Netw 93:448–459
Acknowledgements
The author deeply appreciates eighteen (18) anonymous reviewers for their corrections, criticism, and comments on the original manuscript.
Author information
Authors and Affiliations
Corresponding author
Appendices
Appendix 1: Derivation of \(\partial F_T/\partial s_i\) and \(\partial F_E/\partial s_i\)
Notice that
Furthermore, we have
Therefore, we get
By letting
we have
Since
and
we obtain
It is clear that
Since
we get
Consequently, we get
In a similar way, we can also derive
It is clear that
and
Consequently, we get
Appendix 2: Calculation of \(\partial F_i(\mathbf{y})/\partial y_j\)
First, we have
and
for all \(1\le j\le n\). Next, we have
for all \(1\le i\le n\). Recall that
which implies that
Similarly, we can also get
which implies that
Hence, we have
for all \(1\le i\le n\), and
for all \(1\le i\le n\) and all \(1\le j\not =i\le n\).
Rights and permissions
About this article
Cite this article
Li, K. Energy constrained scheduling of stochastic tasks. J Supercomput 74, 485–508 (2018). https://doi.org/10.1007/s11227-017-2137-0
Published:
Issue Date:
DOI: https://doi.org/10.1007/s11227-017-2137-0