skip to main content
10.1145/3469968.3469996acmotherconferencesArticle/Chapter ViewAbstractPublication PagesicbdcConference Proceedingsconference-collections
research-article

Load Deployment Decision Algorithm Based on CPU+GPU Heterogeneous Processing Platform

Published:06 October 2021Publication History

ABSTRACT

In order to give full play to the multi-core parallel computing ability of CPU+GPU heterogeneous processing platform and maximize the efficient utilization of platform resources, this paper analyses the architecture characteristics of the platform, improves the HEFT algorithm, and proposes a load deployment decision algorithm. Firstly, the algorithm pre judges the load, establishes the scheduling queue from large to small, and pre allocates the task to GPU and CPU; then it uses HEFT algorithm to sort the tasks, but in the processor selection stage, the algorithm only selects the corresponding GPU and CPU from the two scheduling queues. Simulation results show that, compared with the classic HEFT algorithm, the load deployment decision algorithm greatly improves the utilization rate of GPU and the speedup ratio in the calculation process. It is a more load balanced algorithm with shorter scheduling length and higher efficiency.

References

  1. ATEF A, HAGRAS T, MAHDY Y B, Lower-bound complexity algorithm for task scheduling on heterogeneous grid[J]. Computing, 2017, 99(11):1125-1145.Google ScholarGoogle ScholarDigital LibraryDigital Library
  2. ZHANG W, HU Y, HE H, Linear and dynamic programming algorithms for real-time task scheduling with task duplication[J]. Journal of supercomputing, 2017(1):1-16.Google ScholarGoogle Scholar
  3. SHIN I, EASWARAN A, LEE I. Hierarchical scheduling framework for virtual clustering of multiprocessors[C]// Euromicro conference on real-time systems. IEEE Computer Society, 2008:181-190.Google ScholarGoogle Scholar
  4. TSAI Y L, LIU H C, HUANG K C. Adaptive dual-criteria task group allocation for clustering-based multi-workflow scheduling on parallel computing platform[J]. Journal of supercomputing, 2015, 71(10):3811-3831.Google ScholarGoogle ScholarDigital LibraryDigital Library
  5. MU. Advanced list scheduling heuristic for task scheduling with communication contention for parallel embedded systems[J]. Science China (Information sciences), 2010, 53(11):2272-2286.Google ScholarGoogle Scholar
  6. MU P, NEZAN J F, RAULET M. A list scheduling heuristic with new node priorities and critical child technique for task scheduling with communication contention [J]. Lecture notes in electrical engineering, 2013, 73:217-236.Google ScholarGoogle Scholar
  7. ALEBRAHIM S, AHMAD I. Task scheduling for heterogeneous computing systems [J]. Journal of supercomputing, 2017, 73(6):2313-2338.Google ScholarGoogle ScholarDigital LibraryDigital Library
  8. TOPCUOGLU H, HARIRI S, WU M Y. Performance-effective and low-complexity task scheduling for heterogeneous computing [J]. IEEE transactions on parallel & distributed systems, 2002, 13(3):260-274.Google ScholarGoogle ScholarDigital LibraryDigital Library
  9. CANON L-C, JEANNOT E, SAKELLARIOU R, Comparative evaluation of the robustness of dag scheduling heuristics[A]. Proceedings of grid computing, Achievements and Prospects[C]. Springer, 2008: 73-84.Google ScholarGoogle Scholar
  10. Yang Di, Ma Jinquan, Yue Chunsheng, Longest path list scheduling algorithm for heterogeneous processing platforms [J]. Journal of University of information engineering, 2021 (S2): 3Google ScholarGoogle Scholar
  11. Wang Xuecheng. Research on task scheduling technology based on CPU+GPU heterogeneous signal processing platform [D]. Zhengzhou: University of information engineering, 2019Google ScholarGoogle Scholar

Recommendations

Comments

Login options

Check if you have access through your login credentials or your institution to get full access on this article.

Sign in
  • Published in

    cover image ACM Other conferences
    ICBDC '21: Proceedings of the 6th International Conference on Big Data and Computing
    May 2021
    218 pages
    ISBN:9781450389808
    DOI:10.1145/3469968

    Copyright © 2021 ACM

    Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

    Publisher

    Association for Computing Machinery

    New York, NY, United States

    Publication History

    • Published: 6 October 2021

    Permissions

    Request permissions about this article.

    Request Permissions

    Check for updates

    Qualifiers

    • research-article
    • Research
    • Refereed limited
  • Article Metrics

    • Downloads (Last 12 months)5
    • Downloads (Last 6 weeks)0

    Other Metrics

PDF Format

View or Download as a PDF file.

PDF

eReader

View online with eReader.

eReader

HTML Format

View this article in HTML Format .

View HTML Format