Abstract
Scheduling is a problem in computer science with a wide range of applicability in industry. The Heterogeneous Computing Scheduling Problem (HCSP) belongs to the parallel computing area and is applicable to scheduling in clusters and high performance data centers. HCSP has been solved traditionally as a mono-objective problem that aims at minimizing the makespan (termination time of the last task) and has been solved by Branch and Bound (B&B) algorithms. HCSP with energy is a multi-objective optimization problem with two objectives: minimize the makespan and the energy consumption by the machines. In this paper, an integer linear programming model for HCSP is presented. In addition, a multi-objective method called TwoPILP (Two-Phase Integer Linear Programming) is proposed for this model. TwoPILP consists of two phases. The first minimizes the makespan using a classic branch and bound method. The second phase minimizes the energy consumption by selecting adequate voltage levels. The proposed model provides advantages over mono-objective models which are discussed in the paper sections. The experimentation presented compares TwoPILP versus B&B and NSGA-II, showing that TwoPILP achieves better results than B&B and NSGA-II. This method offers the advantage of providing only one solution to the user, which is particularly useful for applications where there is no decision maker for choosing from a set of solutions delivered by multi-objective optimization methods.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
References
Garey, A.M., Johnson, D.S.: Computers and Intractability: A Guide to the Theory of NP-completeness. Freeman, San Francisco (1979)
ENERGY, S.: Energy Star. History: ENERGY STAR (2011)
TOP500.org: The 43rd top500 list published during isc14 in Leipzig, Germany. ISC (2014)
Friese, R., Brinks, T., Oliver, C., Siegel, H.J., Maciejewski, A.A.: Analyzing the trade-offs between minimizing makespan and minimizing energy consumption in a heterogeneous resource allocation problem. In: INFOCOMP, The Second International Conference on Advanced Communications and Computation (2012)
Pooranian, Z., Harounabadi, A., Shojafar, M., Hedayat, N.: New hybrid algorithm for task scheduling in grid computing to decrease missed task. World Acad. Sci. Eng. Technol. 55, 924–928 (2011)
Pooranian, Z., Shojafar, M., Javadi, B.: Independent task scheduling in grid computing based on queen bee algorithm. IAES Int. J. Artif. Intell. (IJ-AI) 1(4), 171–181 (2012)
Chaturvedi, A.K., Sahu, R.: New heuristic for scheduling of independent tasks in computational grid. Int. J. Grid Distrib. Comput. 4(3), 25–36 (2011)
Raj, R.J.S., Vasudevan, V.: Beyond simulated annealing in grid scheduling. Int. J. Comput. Sci. Eng. (IJCSE) 3(3), 1312–1318 (2011)
Huacuja, H.J.F., Santiago, A., Pecero, J.E., Dorronsoro, B., Bouvry, P., Monterrubio, J.C.S., Barbosa, J.J.G., Santillan, C.G.: A comparison between memetic algorithm and seeded genetic algorithm for multi-objective independent task scheduling on heterogeneous machines. Design of Intelligent Systems Based on Fuzzy Logic, pp. 377–389. Neural Networks and Nature-Inspired Optimization. Springer International Publishing, Berlin (2015)
Guzek, M., Pecero, J.E., Dorronsoro, B., Bouvry, P., Khan, S.U.: A cellular genetic algorithm for scheduling applications and energy-aware communication optimization. In: 2010 International Conference on High Performance Computing and Simulation (HPCS), pp. 241–248. IEEE (2010)
Deb K., A. S., P. A. and M. T.: A fast elitist non-dominated sorting genetic algorithm for multi-objective optimization: Nsga-ii. In: Proceedings of the 6th International Conference on Parallel Problem Solving from Nature, vol. 1917 (2000)
Chang, P.C., Chen, S.H., Zhang, Q., Lin, J.L.: MOEA/D for flowshop scheduling problems. In: IEEE Congress on Evolutionary Computation. CEC 2008 (IEEE World Congress on Computational Intelligence), pp. 1433–1438 (2008)
Yagmahan, B., Yenisey, M.M.: A multi-objective ant colony system algorithm for flow shop scheduling problem. Expert Syst. Appl. 37(2), 1361–1368 (2010)
Graham, R., Lawler, E., Lenstra, J., Kan, A.R.: Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey. North-Holland Publishing Company, Amsterdam (1979)
Braunt, T.D., Siegel, H.J., Beck, N., Boloni, L.L., Maheswarans, M.: A comparison study of eleven static heuristics for mapping a class of independent tasks onto heterogeneous distributed computing systems. J. Parallel Distrib. Comput. 61, 810–837 (2001)
Diaz, C.O., Guzek, M., Pecero, J.E., Danoy, G., Bouvry, P., Khan, S.U.: Energy-aware fast scheduling heuristics in heterogeneous computing systems. In: 2011 International Conference on High Performance Computing and Simulation (HPCS), pp. 478–484. IEEE (2011)
Guzek, M., Diaz, C.O., Pecero, J.E., Bouvry, P., Zomaya, A.Y.: Impact of voltage levels number for energy-aware bi-objective dag scheduling for multi-processors systems. In: Papasratorn, B., Charoenkitkarn, N., Lavangnananda, K., Chutimaskul, W., Vanijja, V. (eds.) IAIT 2012. CCIS, vol. 344, pp. 70–80. Springer, Heidelberg (2012)
Ishibuchi, H., Yoshida, T., Murata, T.: Balance between genetic search and local search in memetic algorithms for multiobjective permutation flowshop scheduling. IEEE Trans. Evol. Comput. 7(2), 204–223 (2003)
Conway, R.W., Maxwell, W.L., Miller, L.W.: Theory of Scheduling. Courier Corporation, New York (2012)
Jones, A., Rabelo, L.C., Sharawi, A.T.: Survey of job shop scheduling techniques. Wiley Encyclopedia of Electrical and Electronics Engineering. Wiley, New York (1999)
CECAL: HCSP - Heterogeneous Computing Scheduling Problem. CECAL, 1993. http://www.fing.edu.uy/inco/grupos/cecal/hpc/HCSP/index.html. Accessed 1 September 2013
Lee, Y.C., Zomaya, A.Y.: Energy efficient distributed computing systems. Wiley Series on Parallel and Distributed Computing, vol. 88, pp. 1–34. Wiley, New York (2012)
Emami, M., Ghiasi, Y., Jaberi, N.: Energy-aware scheduling using dynamic voltage-frequency scaling. CoRR, vol. abs/1206.1984 (2012)
Pecero, J.E., Bouvry, P., Fraire Huacuja, H.J., Khan, S.U.: A multi-objective grasp algorithm for joint optimization of energy consumption and schedule length of precedence-constrained applications. In: Cloud and Green Computing (CGC 2011) (2011)
Pecero, J.E., Bouvry, P., Barrios, C.J.: Low energy and high performance scheduling on scalable computing systems. In: Latin-American Conference on High Performance Computing, pp. 1–8 (2010)
Lee, Y.C., Zomaya, A.Y.: Energy conscious scheduling for distributed computing systems under different operating conditions. IEEE Trans. Parallel Distrib. Syst. 22, 1374–1381 (2011)
Mokotoff, E., Jimeno, J.: Heuristics based on partial enumeration for the unrelated parallel processor scheduling problem. Annals of Operations Research, pp. 133–150. Kluwer Academic Publishers, Netherlands (2002)
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2015 Springer International Publishing Switzerland
About this paper
Cite this paper
Soto-Monterrubio, J.C., Fraire-Huacuja, H.J., Frausto-Solís, J., Cruz-Reyes, L., Pazos R., R., Javier González-Barbosa, J. (2015). TwoPILP: An Integer Programming Method for HCSP in Parallel Computing Centers. In: Pichardo Lagunas, O., Herrera Alcántara, O., Arroyo Figueroa, G. (eds) Advances in Artificial Intelligence and Its Applications. MICAI 2015. Lecture Notes in Computer Science(), vol 9414. Springer, Cham. https://doi.org/10.1007/978-3-319-27101-9_35
Download citation
DOI: https://doi.org/10.1007/978-3-319-27101-9_35
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-27100-2
Online ISBN: 978-3-319-27101-9
eBook Packages: Computer ScienceComputer Science (R0)