Optimal task scheduling benefits from a duplicate-free state-space-Reference-Cited by-同舟云学术

Optimal task scheduling benefits from a duplicate-free state-space

Author:

Orr Michael,Sinnen Oliver

Publisher

Elsevier BV

Subject

Artificial Intelligence,Computer Networks and Communications,Hardware and Architecture,Theoretical Computer Science,Software

Reference44 articles.

1. Improved bounds on Bell numbers and on moments of sums of random variables;Berend;Probab. Math. Statist.,2010

3. Branch-And-Bound Applications in Combinatorial Data Analysis;Brusco,2006

4. Branch-and-bound algorithms;Bundy,1984

5. The foundations of thread-level parallelism in the supermatrix runtime system;Chan,2009

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

1. State-Space Search to Find Energy-Aware Pareto-Efficient Optimal Task Schedules;2024 IEEE International Parallel and Distributed Processing Symposium Workshops (IPDPSW);2024-05-27

3. A Guaranteed Approximation Algorithm for Scheduling Fork-Joins with Communication Delay;2023 IEEE International Parallel and Distributed Processing Symposium (IPDPS);2023-05

5. An Efficient Scheduling Algorithm for Distributed Heterogeneous Systems with Task Duplication Allowed;2021 IEEE Intl Conf on Parallel & Distributed Processing with Applications, Big Data & Cloud Computing, Sustainable Computing & Communications, Social Computing & Networking (ISPA/BDCloud/SocialCom/SustainCom);2021-09