Toward Minimum WCRT Bound for DAG Tasks Under Prioritized List Scheduling Algorithms-Reference-Cited by-同舟云学术

Toward Minimum WCRT Bound for DAG Tasks Under Prioritized List Scheduling Algorithms

Published:2022-11 Issue:11 Volume:41 Page:3874-3885
ISSN:0278-0070
Container-title:IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems
language:
Short-container-title:IEEE Trans. Comput.-Aided Des. Integr. Circuits Syst.

Author:

Chang Shuangshuang¹^ORCID,Bi Ran²,Sun Jinghao²,Liu Weichen³^ORCID,Yu Qi²,Deng Qingxu¹^ORCID,Gu Zonghua⁴^ORCID

Affiliation:

1. School of Computer Science and Engineering, Northeastern University, Shenyang, China

2. School of Computer Science and Technology, Dalian University of Technology, Dalian, China

3. School of Computer Science and Engineering, Nanyang Technological University, Jurong West, Singapore

4. Department of Applied Physics and Electronics, Umeå University, Umeå, Sweden

Funder

National Key Research and Development Program of China

National Natural Science Foundation of China

Liaoning Revitalization Talents Program

China Scholarship Council

Nanyang Technological University, Singapore, under its NAP

Publisher

Institute of Electrical and Electronics Engineers (IEEE)

Subject

Electrical and Electronic Engineering,Computer Graphics and Computer-Aided Design,Software

Link

Cited by 3 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Enhancement of System Performance Using PeSche Scheduling Algorithm on Multiprocessors;Advances in Systems Analysis, Software Engineering, and High Performance Computing;2024-06-28