A hyper-heuristic scheduling algorithm for cloud

IEEE Transactions on Cloud Computing

Volumn 2, Issue 2, 2014, Pages 236-250

  Tsai, Chun Wei ^a   Huang, Wei Cheng ^b   Chiang, Meng Hsiu ^b   Chiang, Ming Chao ^b   Yang, Chu Sing ^c  

^a CHIA NAN UNIVERSITY OF PHARMACY AND SCIENCE   (Taiwan)

^b NATIONAL SUN YAT SEN UNIVERSITY   (Taiwan)

^c NATIONAL CHENG KUNG UNIVERSITY   (Taiwan)

Author keywords

Cloud computing; Evolutionary algorithm; Hadoop; Scheduling

Indexed keywords

CLOUD COMPUTING; EVOLUTIONARY ALGORITHMS; HEURISTIC ALGORITHMS; SCHEDULING;

CLOUD-COMPUTING; CLOUDSIM; COMPUTING SYSTEM; HADOOP; HEURISTIC SCHEDULING ALGORITHMS; HYPER-HEURISTICS; PERFORMANCE; RULE BASED; SCHEDULING; SIMPLE++;

SCHEDULING ALGORITHMS;

EID: 85071768834     PISSN: None     EISSN: 21687161     Source Type: Journal    
DOI: 10.1109/TCC.2014.2315797     Document Type: Article

References (62)

1. M. Pinedo, Scheduling: Theory, Algorithms and Systems. Englewood Cliffs, NJ, USA: Prentice Hall, 1995.
2. Scheduling Theory and Its Applications, P. Chrfetienne, E. G. Coffman, J. K. Lenstra, and Z. Liu, eds., Hoboken, NJ, USA: Wiley, 1995.
3. A. Allahverdi, C. T. Ng, T. C. E. Cheng, and M. Y. Kovalyov, A survey of scheduling problems with setup times or costs, Eur. J. Oper. Res., vol. 187, no. 3, pp. 9851032, 2008.
4. M. Armbrust, A. Fox, R. Griffith, A. D. Joseph, R. Katz, A. Konwinski, G. Lee, D. Patterson, A. Rabkin, I. Stoica, and M. Zaharia, A view of cloud computing, Commun. ACM, vol. 53, no. 4, pp. 5058, 2010.
5. I. Foster, Y. Zhao, I. Raicu, and S. Lu, Cloud computing and grid computing 360-degree compared, in Proc. Grid Comput. Environ. Workshop, 2008, pp. 110.
6. K. Bilal, M. Manzano, S. Khan, E. Calle, K. Li, and A. Zomaya, On the characterization of the structural robustness of data center networks, IEEE Trans. Cloud Comput., vol. 1, no. 1, pp. 6477, Jan. Jun. 2013.
7. X. Lei, X. Liao, T. Huang, H. Li, and C. Hu, Outsourcing large matrix inversion computation to a public cloud, IEEE Trans. Cloud Comput., vol. 1, no. 1, pp. 7887, Jan. 2013.
8. M. R. Garey and D. S. Johnson, Computer and Intractability: A Guide to the Theory of NP-Completeness. San Francisco, CA, USA: Freeman, 1979.
9. C. W. Tsai and J. Rodrigues, Metaheuristic scheduling for cloud: A survey, IEEE Syst. J., vol. 8, no. 1, pp. 279297, Mar. 2014.
10. S. Kirkpatrick, C. D. Gelatt, and M. P. Vecchi, Optimization by simulated annealing, Science, vol. 220, no. 4598, pp. 671680, 1983.
11. J. H. Holland, Adaptation in Natural and Artificial Systems: An Introductory Analysis with Applications to Biology, Control, and Artificial Intelligence. Ann Arbor, MI, USA: Univ. of Michigan Press, 1975.
12. J. Kennedy and R. C. Eberhart, Particle swarm optimization, in Proc. IEEE Int. Conf. Neural Netw., 1995, pp. 19421948.
13. M. Dorigo and L. M. Gambardella, Ant colony system: A cooperative learning approach to the traveling salesman problem, IEEE Trans. Evol. Comput., vol. 1, no. 1, pp. 5366, Apr. 1997.
14. R. N. Calheiros, R. Ranjan, A. Beloglazov, C. A. De Rose, and R. Buyya, CloudSim: A toolkit for modeling and simulation of cloud computing environments and evaluation of resource provisioning algorithms, Softw.: Practice Experience, vol. 41, no. 1, pp. 2350, 2011.
15. J. Bazewicz, K. H. Ecker, E. Pesch, G. Schmidt, and J. Wȩglarz, Scheduling Computer and Manufacturing Processes. New York, NY, USA: Springer, 2001.
16. Y. T. J. Leung, Handbook of Scheduling: Algorithms, Models and Performance Analysis. London, U.K.: Chapman & Hall, 2004.
17. K. M. Elsayed and A. K. Khattab, Channel-aware earliest deadline due fair scheduling for wireless multimedia networks, Wireless Personal Commun., vol. 38, no. 2, pp. 233252, 2006.
18. W. H. Kohler, A preliminary evaluation of the critical path method for scheduling tasks on multiprocessor systems, IEEE Trans. Comput., vol. C-24, no. 12, pp. 12351238, Dec. 1975.
19. R. Ingalls and D. Morrice, PERT scheduling with resources using qualitative simulation graphs, in Proc. Simul. Conf., 2000, vol. 1, pp. 362370.
20. H.-J. Schutz and R. Kolisch, Approximate dynamic programming for capacity allocation in the service industry, Eur. J. Oper. Res., vol. 218, no. 1, pp. 239250, 2012.
21. D. Shi and T. Chen, Optimal periodic scheduling of sensor networks: A branch and bound approach, Syst. Control Lett., vol. 62, no. 9, pp. 732738, 2013.
22. S. M. Johnson, Optimal two- and three-stage production schedules with setup times included, Naval Res. Logistics Quart., vol. 1, no. 1, pp. 6168, 1954.
23. M. R. Garey, D. S. Johnson, and R. Sethi, The complexity of flowshop and jobshop scheduling, Math. Oper. Res., vol. 1, no. 2, pp. 117129, 1976.
24. D. Daniel and S. J. Lovesum, A novel approach for scheduling service request in cloud with trust monitor, in Proc. Int. Conf. Signal Process., Commun., Comput. Netw. Technol., 2011, pp. 509513.
25. Z. Wu, X. Liu, Z. Ni, D. Yuan, and Y. Yang, A market-oriented hierarchical scheduling strategy in cloud workflow systems, The J. Supercomput., vol. 63, no. 1, pp. 256293, 2013.
26. B. Saovapakhiran, G. Michailidis, and M. Devetsikiotis, Aggregated-DAG scheduling for job flow maximization in heterogeneous cloud computing, in Proc. IEEE Global Telecommun. Conf., 2011, pp. 16.
27. M. Rahman, X. Li, and H. Palit, Hybrid heuristic for scheduling data analytics workflow applications in hybrid cloud environment, in Proc. IEEE Int. Symp. Parallel Distrib. Process. Workshops, 2011, pp. 966974.
28. Apache Hadoop. [Online]. Available: http://hadoop.apache.org, 2014.
29. Y. M. Huang and Z. H. Nie. Cloud computing with Linux and Apache Hadoop. [Online]. Available: http://www.ibm.com/ developerworks/aix/library/au-cloud- apache/, 2014.
30. B. David. Open source cloud computing with Hadoop. [Online]. Available: http://www.linuxjournal.com/content/open-sourcecloud- computing-hadoop, 2014.
31. A. ODriscoll, J. Daugelaite, and R. D. Sleator, Big data, Hadoop and cloud computing in genomics, J. Biomed. Inf., vol. 46, no. 5, pp. 774781, 2013.
32. Y. Song, M. Wu, and L. Yang, Study of smart grid marketing system architecture based on Hadoop platform of cloud computing, J. Commun. Comput., vol. 9, pp. 741743, 2012.
33. A. Bala and I. Chana, A survey of various workflow scheduling algorithms in cloud environment, in Proc. Nat. Conf. Inf. Commun. Technol., 2011, pp. 2630.
34. N. Kaur, T. S. Aulakh, and R. S. Cheema, Comparison of workflow scheduling algorithms in cloud computing, Int. J. Adv. Comput. Sci. Appl., vol. 2, no. 10, pp. 8186, 2011.
35. J. Li, M. Qiu, Z. Ming, G. Quan, X. Qin, and Z. Gu, Online optimization for scheduling preemptable tasks on IaaS cloud systems, J. Parallel Distrib. Comput., vol. 72, no. 5, pp. 666677, 2012.
36. J. Li, M. Qiu, J. Niu, Y. Chen, and Z. Ming, Adaptive resource allocation for preemptable jobs in cloud systems, in Proc. Int. Conf. Intel. Syst. Design Appl., 2010, pp. 3136.
37. C. Lin and S. Lu, Scheduling scientific workflows elastically for cloud computing, in Proc. IEEE Int. Conf. Cloud Comput., 2011, pp. 746747.
38. S. Abrishami and M. Naghibzadeh, Deadline-constrained workflow scheduling in software as a service cloud, Scientia Iranica, vol. 19, no. 3, pp. 680689, 2012.
39. Y. C. Lee, C. Wang, A. Y. Zomaya, and B. B. Zhou, Profit-driven scheduling for cloud services with data access awareness, J. Parallel Distrib. Comput., vol. 72, no. 4, pp. 591602, 2012.
40. K. Kousalya and P. Balasubramanie, Ant algorithm for grid scheduling powered by local search, Int. J. Open Problem Comput. Sci. Math., vol. 1, no. 3, pp. 222240, 2008.
41. M. Zaharia, D. Borthakur, J. Sen Sarma, K. Elmeleegy, S. Shenker, and I. Stoica, Delay scheduling: A simple technique for achieving locality and fairness in cluster scheduling, in Proc. Eur. Conf. Comput. Syst., 2010, pp. 265278.
42. Yahoo!. Hadoop capacity scheduler. [Online]. Available: http://hadoop.apache.org/docs/r2.3.0/hadoop-yarn/hadoopyarn- site/CapacityScheduler.html, 2014.
43. H. H. Hoos and T. Stutzle, Stochastic Local Search: Foundations & Applications. San Mateo, CA, USA: Morgan Kaufmann, 2004.
44. P. Cowling and G. Kendall, A hyperheuristic approach to scheduling a sales summit, in Proc. Practice Theory Autom. Timetabling III, 2001, pp. 176190.
45. P. I. Cowling, G. Kendall, and E. Soubeiga, A hyperheuristic approach to scheduling a sales summit, in Proc. Practice Theory Autom. Timetabling, 2000, pp. 176190.
46. B. K. Ambati, J. Ambati, and M. M. Mokhtar, Heuristic combinatorial optimization by simulated Darwinian evolution: A polynomial time algorithm for the traveling salesman problem, Biol. Cybern., vol. 65, no. 1, pp. 3135, 1991.
47. L. Y. Tseng and S. B. Yang, A genetic approach to the automatic clustering problem, Pattern Recognit., vol. 34, no. 2, pp. 415424, 2001.
48. D. Laha and U. Chakraborty, An efficient hybrid heuristic for makespan minimization in permutation flow shop scheduling, The Int. J. Adv. Manuf. Technol., vol. 44, no. 5/6, pp. 559569, 2009.
49. L. Ramakrishnan, C. Koelbel, Y.-S. Kee, R. Wolski, D. Nurmi, D. Gannon, G. Obertelli, A. YarKhan, A. Mandal, T. M. Huang, K. Thyagaraja, and D. Zagorodnov, VGrADS: Enabling e-science workflows on grids and clouds with fault tolerance, in Proc. Conf. High Performance Comput. Netw., Storage Anal., 2009, pp. 47:147:12.
50. M. Mao and M. Humphrey, Auto-scaling to minimize cost and meet application deadlines in cloud workflows, in Proc. Int. Conf. High Performance Comput., Netw., Storage Anal., 2011, pp. 112.
51. Y. Zhao, M. Wilde, I. Foster, J. Voeckler, T. Jordan, E. Quigg, and J. Dobson, Grid middleware services for virtual data discovery, composition, and integration, in Proc. Workshop Middleware Grid Comput., 2004, pp. 5762.
52. A. OBrien, S. Newhouse, and J. Darlington, Mapping of scientific workflow within the e-protein project to distributed resources, in Proc. UK e-Science All Hands Meeting, Nottingham, U.K., 2004, pp. 404409.
53. R. Kolisch andA. Sprecher, PSPLIBAproject scheduling problem library: OR softwareORSEP operations research software exchange program, Eur. J. Oper. Res., vol. 96, no. 1, pp. 205216, 1997.
54. J. Blythe, S. Jain, E. Deelman, Y. Gil, and K. Vahi, Task scheduling strategies for workflow-based applications in grids, in Proc. IEEE Int. Symp. Cluster Comput. Grid, 2005, pp. 759767.
55. S. Benedict and V. Vasudevan, Scheduling of scientific workflows using simulated annealing algorithm for computational grids, Int. J. Soft. Comput., vol. 2, no. 5, pp. 606611, 2007.
56. J. Yu and R. Buyya, A budget constrained scheduling of workflow applications on utility grids using genetic algorithms, in Proc. Workflows Support Large-Scale Sci., 2006, pp. 110.
57. T. Chen, B. Zhang, X. Hao, and Y. Dai, Task scheduling in grid based on particle swarm optimization, in Proc. Int. Symp. Parallel Distrib. Comput., 2006, pp. 238245.
58. W. N. Chen and J. Zhang, An ant colony optimization approach to a grid workflow scheduling problem with various QoS requirements, IEEE Trans. Syst., Man, Cybern., Part C: Appl. Rev., vol. 39, no. 1, pp. 2943, Jan. 2009.
59. O. OMalley. TeraByte Sort on Apache Hadoop. [Online]. Available: http://sortbenchmark.org/YahooHadoop.pdf, 2014.
60. I. T. Archive. World Cup 98. [Online]. Available: http://ita.ee.lbl. gov/html/contrib/WorldCup.html, 2014.
61. Amazon, Amazon elastic mapreduce. [Online]. Available: http:// aws.amazon.com/elasticmapreduce, 2014.
62. H. S. Shin, K. H. Kim, C. Y. Kim, and S. I. Jung, The new approach for inter-communication between guest domains on virtualmachine monitor, in Proc. Int. Symp. Comput. Inf. Sci., 2007, pp. 16.