Table of Contents Author Guidelines Submit a Manuscript
The Scientific World Journal
Volume 2014 (2014), Article ID 404375, 23 pages
http://dx.doi.org/10.1155/2014/404375
Research Article

A DAG Scheduling Scheme on Heterogeneous Computing Systems Using Tuple-Based Chemical Reaction Optimization

College of Information Science and Engineering, East China University of Science and Technology, Shanghai 200237, China

Received 1 April 2014; Revised 5 May 2014; Accepted 8 May 2014; Published 24 June 2014

Academic Editor: Yu-Bo Yuan

Copyright © 2014 Yuyi Jiang et al. This is an open access article distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.

Linked References

  1. J. L. R. L. Graham, E. L. Lawler, and A. R. Kan, “Optimization and approximation in deterministic sequencing and scheduling: a survey,” Annals of Discrete Mathematics, vol. 5, pp. 287–326, 1979. View at Google Scholar · View at Scopus
  2. C. Papadimitriou and M. Yannakakis, “Towards an architecture-independent analysis of parallel algorithms,” in Proceedings of the 20th Annual ACM Symposium on Theory of Computing (STOC '88), pp. 510–513, 1988. View at Publisher · View at Google Scholar
  3. V. Sarkar, Partitioning and Scheduling Parallel Programs for Multiprocessors, The MIT Press, Cambridge, Mass, USA, 1989.
  4. P. Chrétienne, “Task scheduling with interprocessor communication delays,” European Journal of Operational Research, vol. 57, no. 3, pp. 348–354, 1992. View at Publisher · View at Google Scholar
  5. M. A. Khan, “Scheduling for heterogeneous systems using constrained critical paths,” Parallel Computing, vol. 38, no. 4-5, pp. 175–193, 2012. View at Publisher · View at Google Scholar · View at Scopus
  6. J. Xu, Y. S. Albert Lam, and O. K. Victor Li, “Stock portfolio selection using chemical reaction optimization,” in Proceedings of the International Conference on Operations Research and Financial Engineering (ICORFE '11), pp. 458–463, 2011.
  7. Y.-K. Kwok and I. Ahmad, “Static scheduling algorithms for allocating directed task graphs to multiprocessors,” ACM Computing Surveys, vol. 31, no. 4, pp. 406–471, 1999. View at Publisher · View at Google Scholar · View at Scopus
  8. H. Topcuoglu, S. Hariri, and M.-Y. Wu, “Performance-effective and low-complexity task scheduling for heterogeneous computing,” IEEE Transactions on Parallel and Distributed Systems, vol. 13, no. 3, pp. 260–274, 2002. View at Publisher · View at Google Scholar · View at Scopus
  9. A. Amini, T. Y. Wah, M. R. Saybani, and S. R. A. S. Yazdi, “A study of density-grid based clustering algorithms on data streams,” in Proceedings of the 8th International Conference on Fuzzy Systems and Knowledge Discovery (FSKD '11), pp. 1652–1656, Shanghai, China, July 2011. View at Publisher · View at Google Scholar · View at Scopus
  10. H. Cheng, “A high efficient task scheduling algorithm based on heterogeneous multi-core processor,” in Proceedings of the 2nd International Workshop on Database Technology and Applications (DBTA '10), pp. 1–14, Wuhan, China, November 2010. View at Publisher · View at Google Scholar · View at Scopus
  11. T. Tsuchiya, T. Osada, and T. Kikuno, “A new heuristic algorithm based on gas for multiprocessor scheduling with task duplication,” in Proceedings of the 3rd International Conference on Algorithms and Architectures for Parallel Processing (ICAPP '97), pp. 295–308, Melbourne, Australia, December 1997. View at Publisher · View at Google Scholar
  12. R. Bajaj and D. P. Agrawal, “Improving scheduling of tasks in a heterogeneous environment,” IEEE Transactions on Parallel and Distributed Systems, vol. 15, no. 2, pp. 107–118, 2004. View at Publisher · View at Google Scholar · View at Scopus
  13. H.-W. Ge, L. Sun, Y.-C. Liang, and F. Qian, “An effective PSO and AIS-based hybrid intelligent algorithm for job-shop scheduling,” IEEE Transactions on Systems, Man, and Cybernetics A: Systems and Humans, vol. 38, no. 2, pp. 358–368, 2008. View at Publisher · View at Google Scholar · View at Scopus
  14. N. B. Ho and J. C. Tay, “Solving multiple-objective flexible job shop problems by evolution and local search,” IEEE Transactions on Systems, Man and Cybernetics C: Applications and Reviews, vol. 38, no. 5, pp. 674–685, 2008. View at Publisher · View at Google Scholar · View at Scopus
  15. E. S. H. Hou, N. Ansari, and H. Ren, “Genetic algorithm for multiprocessor scheduling,” IEEE Transactions on Parallel and Distributed Systems, vol. 5, no. 2, pp. 113–120, 1994. View at Publisher · View at Google Scholar · View at Scopus
  16. J.-J. Hwang, Y.-C. Chow, F. D. Anger, and C.-Y. Lee, “Scheduling precedence graphs in systems with interprocessor communication times,” SIAM Journal on Computing, vol. 18, no. 2, pp. 244–257, 1989. View at Google Scholar · View at Scopus
  17. M. Iverson, F. Özgüner, and G. Follen, “Parallelizing existing applications in a distributed heterogeneous environment,” in Proceedings of the IEEE International Conference on Heterogeneous Computing Workshop (HCW '95), pp. 93–100, 1995.
  18. M. H. Kashani and M. Jahanshahi, “Using simulated annealing for task scheduling in distributed systems,” in Proceedings of the International Conference on Computational Intelligence, Modelling, and Simulation (CSSim '09), pp. 265–269, Brno, Czech Republic, September 2009. View at Publisher · View at Google Scholar · View at Scopus
  19. S. Kim and J. Browne, “A general approach to mapping of parallel computation upon multiprocessor architectures,” in Proceedings of the International Conference on Parallel Processing, vol. 3, pp. 1–8, 1988.
  20. A. Y. S. Lam and V. O. K. Li, “Chemical-reaction-inspired metaheuristic for optimization,” IEEE Transactions on Evolutionary Computation, vol. 14, no. 3, pp. 381–399, 2010. View at Publisher · View at Google Scholar
  21. H. Li, L. Wang, and J. Liu, “Task scheduling of computational grid based on particle swarm algorithm,” in Proceedings of the 3rd International Joint Conference on Computational Sciences and Optimization (CSO '10), vol. 2, pp. 332–336, Huangshan, China, May 2010. View at Publisher · View at Google Scholar · View at Scopus
  22. M.-Y. Wu and D. D. Gajski, “Hypertool: a programming aid for message-passing systems,” IEEE Transactions on Parallel and Distributed Systems, vol. 1, no. 3, pp. 330–343, 1990. View at Publisher · View at Google Scholar · View at Scopus
  23. G. C. Sih and E. A. Lee, “Compile-time scheduling heuristic for interconnection-constrained heterogeneous processor architectures,” IEEE Transactions on Parallel and Distributed Systems, vol. 4, no. 2, pp. 175–187, 1993. View at Publisher · View at Google Scholar · View at Scopus
  24. H. El-Rewini and T. G. Lewis, “Scheduling parallel program tasks onto arbitrary target machines,” Journal of Parallel and Distributed Computing, vol. 9, no. 2, pp. 138–153, 1990. View at Google Scholar · View at Scopus
  25. F.-T. Lin, “Fuzzy job-shop scheduling based on ranking level (lambda, 1) interval-valued fuzzy numbers,” IEEE Transactions on Fuzzy Systems, vol. 10, no. 4, pp. 510–522, 2002. View at Publisher · View at Google Scholar · View at Scopus
  26. B. Liu, L. Wang, and Y.-H. Jin, “An effective PSO-based memetic algorithm for flow shop scheduling,” IEEE Transactions on Systems, Man, and Cybernetics B: Cybernetics, vol. 37, no. 1, pp. 18–27, 2007. View at Publisher · View at Google Scholar · View at Scopus
  27. F. Pop, C. Dobre, and V. Cristea, “Genetic algorithm for DAG scheduling in Grid environments,” in Proceedings of the IEEE 5th International Conference on Intelligent Computer Communication and Processing (ICCP '09), pp. 299–305, Cluj-Napoca, Romania, August 2009. View at Publisher · View at Google Scholar · View at Scopus
  28. R. Shanmugapriya, S. Padmavathi, and S. M. Shalinie, “Contention awareness in task scheduling using tabu search,” in Proceedings of the IEEE International Advance Computing Conference (IACC '09), pp. 272–277, Patiala, India, March 2009. View at Publisher · View at Google Scholar · View at Scopus
  29. L. Shi and Y. Pan, “An efficient search method for job-shop scheduling problems,” IEEE Transactions on Automation Science and Engineering, vol. 2, no. 1, pp. 73–77, 2005. View at Publisher · View at Google Scholar
  30. P. Choudhury, R. Kumar, and P. P. Chakrabarti, “Hybrid scheduling of dynamic task graphs with selective duplication for multiprocessors under memory and time constraints,” IEEE Transactions on Parallel and Distributed Systems, vol. 19, no. 7, pp. 967–980, 2008. View at Publisher · View at Google Scholar · View at Scopus
  31. S. Song, K. Hwang, and Y.-K. Kwok, “Risk-resilient heuristics and genetic algorithms for security-assured grid job scheduling,” IEEE Transactions on Computers, vol. 55, no. 6, pp. 703–719, 2006. View at Publisher · View at Google Scholar · View at Scopus
  32. D. P. Spooner, J. Cao, S. A. Jarvis, L. He, and G. R. Nudd, “Performance-aware workflow management for grid computing,” The Computer Journal, vol. 48, no. 3, pp. 347–357, 2005. View at Publisher · View at Google Scholar · View at Scopus
  33. K. Li, X. Tang, and K. Li, “Energy-efficient stochastic task scheduling on heterogeneous computing systems,” IEEE Transactions on Parallel and Distributed Systems, 2014. View at Publisher · View at Google Scholar
  34. J. Wang, Q. Duan, Y. Jiang, and X. Zhu, “A new algorithm for grid independent task schedule: genetic simulated annealing,” in Proceedings of the World Automation Congress (WAC '10), pp. 165–171, Kobe, Japan, September 2010. View at Scopus
  35. L. He, D. Zou, Z. Zhang, C. Chen, H. Jin, and S. Jarvis, “Developing resource consolidation frameworks for moldable virtual machines in clouds,” Future Generation Computer Systems, vol. 32, pp. 69–81, 2012. View at Publisher · View at Google Scholar · View at Scopus
  36. Y. Xu, K. Li, J. Hu, and K. Li, “A genetic algorithm for task scheduling on heterogeneous computing systems using multiple priority queues,” Information Sciences, vol. 270, pp. 255–287, 2014. View at Google Scholar
  37. Y. Xu, K. Li, L. He, and T. K. Truonga, “A DAG scheduling scheme on heterogeneous computing systems using double molecular structure-based chemical reaction optimization,” Journal of Parallel and Distributed Computing, vol. 73, no. 9, pp. 1306–1322, 2013. View at Publisher · View at Google Scholar
  38. J. Xu, A. Lam, and V. Li, “Chemical reaction optimization for the grid scheduling problem,” in Proceedings of the IEEE International Conference on Communications (ICC '10), pp. 1–5, Cape Town, South Africa, May 2010. View at Publisher · View at Google Scholar
  39. B. Varghese, G. Mckee, and V. Alexandrov, “Can agent intelligence be used to achieve fault tolerant parallel computing systems?” Parallel Processing Letters, vol. 21, no. 4, pp. 379–396, 2011. View at Publisher · View at Google Scholar · View at Scopus
  40. J. Xu, A. Lam, and V. Li, “Chemical reaction optimization for task scheduling in grid computing,” IEEE Transactions on Parallel and Distributed Systems, vol. 22, no. 10, pp. 1624–1631, 2011. View at Publisher · View at Google Scholar
  41. T. K. Truong, K. Li, and Y. Xu, “Chemical reaction optimization with greedy strategy for the 0-1 knapsack problem,” Applied Soft Computing Journal, vol. 13, no. 4, pp. 1774–1780, 2013. View at Publisher · View at Google Scholar · View at Scopus
  42. V. A. F. Almeida, I. M. M. Vasconcelos, J. N. C. Arabe, and D. A. Menasce, “Using random task graphs to investigate the potential benefits of heterogeneity in parallel systems,” in Proceedings of the ACM/IEEE Conference on Supercomputing (Supercomputing '92), pp. 683–691, IEEE Computer Society Press, Los Alamitos, Calif, USA, 1992.