An Improving List Scheduling Algorithm Based on Reinforcement Learning and Task Duplication-Reference-Cited by-同舟云学术

An Improving List Scheduling Algorithm Based on Reinforcement Learning and Task Duplication

Published:2022-12-23 Issue: Volume: Page:
ISSN:
Container-title:Proceedings of the 2022 5th International Conference on Algorithms, Computing and Artificial Intelligence
language:
Short-container-title:

Author:

Wang Zhi¹^ORCID,Duan Hancong¹^ORCID,Cheng Yamin¹^ORCID

Affiliation:

1. School of Computer Science and Engineering, School of Computer Science and Engineering,University of Electronic Science and Technology of China,Chengdu,Sichuan,China, China

Publisher

ACM

Link

https://dl.acm.org/doi/pdf/10.1145/3579654.3579657

Reference21 articles.

1. Yu-Kwong Kwok and Ishfaq Ahmad . Static scheduling algorithms for allocating directed task graphs to multiprocessors. ACM Computing Surveys (CSUR), 31(4):406–471 , 1999 . Yu-Kwong Kwok and Ishfaq Ahmad. Static scheduling algorithms for allocating directed task graphs to multiprocessors. ACM Computing Surveys (CSUR), 31(4):406–471, 1999.

2. Luiz F Bittencourt , Rizos Sakellariou , and Edmundo RM Madeira . Dag scheduling using a lookahead variant of the heterogeneous earliest finish time algorithm . In 2010 18th Euromicro conference on parallel, distributed and network-based processing , pages 27– 34 . IEEE, 2010. Luiz F Bittencourt, Rizos Sakellariou, and Edmundo RM Madeira. Dag scheduling using a lookahead variant of the heterogeneous earliest finish time algorithm. In 2010 18th Euromicro conference on parallel, distributed and network-based processing, pages 27–34. IEEE, 2010.

3. A compile-time scheduling heuristic for interconnection-constrained heterogeneous processor architectures

4. List Scheduling Algorithm for Heterogeneous Systems by an Optimistic Cost Table

5. Performance-effective and low-complexity task scheduling for heterogeneous computing