Table of Contents Author Guidelines Submit a Manuscript
Scientific Programming
Volume 2016 (2016), Article ID 3676149, 11 pages
http://dx.doi.org/10.1155/2016/3676149
Research Article

HSIP: A Novel Task Scheduling Algorithm for Heterogeneous Computing

1School of Software Technology, Dalian University of Technology, Dalian 116620, China
2Liaoning Police College, Dalian 116036, China
3School of Computer Science and Technology, Dalian University of Technology, Dalian 116024, China

Received 22 September 2015; Revised 9 January 2016; Accepted 16 February 2016

Academic Editor: Bronis R. de Supinski

Copyright © 2016 Guan Wang 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. M. Maheswaran, T. D. Braun, and H. J. Siegel, “Heterogeneous distributed computing,” in Encyclopedia of Electrical and Electronics Engineering, J. G. Webster, Ed., vol. 8, pp. 679–690, John Wiley & Sons, New York, NY, USA, 1999. View at Google Scholar
  2. D. G. Feitelson, L. Rudolph, U. Schwiegelshohn, K. C. Sevcik, and P. Wong, “Theory and practice in parallel job scheduling,” in Job Scheduling Strategies for Parallel Processing, vol. 1291 of Lecture Notes in Computer Science, pp. 1–34, Springer, Berlin, Germany, 1997. View at Publisher · View at Google Scholar
  3. Y. K. Kwok and I. Ahmad, “Benchmarking the task graph scheduling algorithms,” in Proceedings of the 1st Merged International and Symposium on Parallel and Distributed Processing, and IEEE Parallel Processing Symposium (IPPS/SPDP '98), pp. 531–537, March-April 1998.
  4. J. C. Liou and M. Palis, “A comparison of general approaches to multiprocessor scheduling,” in Proceedings of the 11th International Parallel Processing Symposium, pp. 152–156, IEEE, Geneva, Switzerland, April 1997.
  5. T. Hagras and J. Janeček, “A high performance, low complexity algorithm for compile-time task scheduling in heterogeneous systems,” Parallel Computing, vol. 31, no. 7, pp. 653–670, 2005. View at Publisher · View at Google Scholar · View at Scopus
  6. 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
  7. E. U. Munir, S. Mohsin, A. Hussain, M. W. Nisar, and S. Ali, “SDBATS: a novel algorithm for task scheduling in heterogeneous computing systems,” in Proceedings of the IEEE 27th International Parallel and Distributed Processing Symposium Workshops & PhD Forum (IPDPSW '13), pp. 43–53, IEEE, Cambridge, Mass, USA, May 2013. View at Publisher · View at Google Scholar · View at Scopus
  8. H. Arabnejad and J. G. Barbosa, “List scheduling algorithm for heterogeneous systems by an optimistic cost table,” IEEE Transactions on Parallel and Distributed Systems, vol. 25, no. 3, pp. 682–694, 2014. View at Publisher · View at Google Scholar · View at Scopus
  9. M. Maheswaran, S. Ali, H. J. Siegel, D. Hensgen, and R. F. Freund, “Dynamic mapping of a class of independent tasks onto heterogeneous computing systems,” Journal of Parallel & Distributed Computing, vol. 59, no. 2, pp. 107–131, 1999. View at Publisher · View at Google Scholar · View at Scopus
  10. J.-K. Kim, S. Shivle, H. J. Siegel et al., “Dynamically mapping tasks with priorities and multiple deadlines in a heterogeneous environment,” Journal of Parallel and Distributed Computing, vol. 67, no. 2, pp. 154–169, 2007. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at Scopus
  11. W. Sun, Y. Zhang, and Y. Inoguchi, “Dynamic task flow scheduling for heterogeneous distributed computing: algorithm and strategy,” IEICE Transactions on Information and Systems, vol. E90-D, no. 4, pp. 736–744, 2007. View at Publisher · View at Google Scholar · View at Scopus
  12. J. G. Barbosa and B. Moreira, “Dynamic scheduling of a batch of parallel task jobs on heterogeneous clusters,” Parallel Computing, vol. 37, no. 8, pp. 428–438, 2011. View at Publisher · View at Google Scholar · View at Scopus
  13. E. S. H. Hou, N. Ansari, and H. Ren, “A 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
  14. R. C. Correa, A. Ferreira, and P. Rebreyend, “Integrating list heuristics into genetic algorithms for multiprocessor scheduling,” in Proceedings of the 8th IEEE Symposium on Parallel and Distributed Processing, pp. 462–469, New Orleans, La, USA, October 1996. View at Scopus
  15. M. K. Dhodhi, I. Ahmad, A. Yatama, and I. Ahmad, “An integrated technique for task matching and scheduling onto distributed heterogeneous computing systems,” Journal of Parallel and Distributed Computing, vol. 62, no. 9, pp. 1338–1361, 2002. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at Scopus
  16. M. I. Daoud and N. Kharma, “A high performance algorithm for static task scheduling in heterogeneous distributed computing systems,” Journal of Parallel and Distributed Computing, vol. 68, no. 4, pp. 399–409, 2008. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at Scopus
  17. T. Hagras and J. Janecek, “A simple scheduling heuristic for heterogeneous computing environments,” in Proceedings of the Second International Conference on Parallel and Distributed Computing (ISPDC '03), pp. 104–110, IEEE, 2003.
  18. E. Ilavarasan, P. Thambidurai, and R. Mahilmannan, “High performance task scheduling algorithm for heterogeneous computing system,” in Distributed and Parallel Computing, pp. 193–203, Springer, Berlin, Germany, 2005. View at Google Scholar
  19. E. Ilavarasan and P. Thambidurai, “Low complexity performance effective task scheduling algorithm for heterogeneous computing environments,” Journal of Computer Science, vol. 3, no. 2, pp. 94–103, 2007. View at Publisher · View at Google Scholar
  20. X. Tang, K. Li, G. Liao, and R. Li, “List scheduling with duplication for heterogeneous computing systems,” Journal of Parallel and Distributed Computing, vol. 70, no. 4, pp. 323–329, 2010. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at Scopus
  21. S. Bansal, P. Kumar, and K. Singh, “An improved duplication strategy for scheduling precedence constrained graphs in multiprocessor systems,” IEEE Transactions on Parallel and Distributed Systems, vol. 14, no. 6, pp. 533–544, 2003. View at Publisher · View at Google Scholar · View at Scopus
  22. P. F. Dutot, T. N'Takpé, F. Suter, and H. Casanova, “Scheduling parallel task graphs on (almost) homogeneous multicluster platforms,” IEEE Transactions on Parallel & Distributed Systems, vol. 20, no. 7, pp. 940–952, 2009. View at Publisher · View at Google Scholar
  23. A. K. Amoura, E. Bampis, and J.-C. König, “Scheduling algorithms for parallel Gaussian elimination with communication costs,” IEEE Transactions on Parallel and Distributed Systems, vol. 9, no. 7, pp. 679–686, 1998. View at Publisher · View at Google Scholar · View at Scopus
  24. Y. C. Chung and S. Ranka, “Applications and performance analysis of a compile-time optimization approach for list scheduling algorithms on distributed memory multiprocessors,” in Proceedings of the ACM/IEEE Conference on Supercomputing (Supercomputing '92), pp. 512–521, IEEE, Minneapolis, Minn, USA, November 1992. View at Publisher · View at Google Scholar
  25. Montage: An Astronomical Image Mosaic Engine, 2013, http://montage.ipac.caltech.edu/.
  26. USC Epigenome Center, 2013, http://epigenome.usc.edu/.