DAG task scheduling method based on Monte Carlo tree search
A task scheduling and tree search technology, applied in other database retrieval, other database indexing, program startup/switching and other directions, can solve problems such as long execution time, and achieve the effect of solving long execution time, improving search efficiency, and ensuring algorithm efficiency
- Summary
- Abstract
- Description
- Claims
- Application Information
AI Technical Summary
Problems solved by technology
Method used
Image
Examples
Example Embodiment
[0043] The present invention will be further described below in conjunction with the drawings and specific embodiments:
[0044] Example: such as figure 1 The shown DAG task scheduling method based on Monte Carlo tree search includes the following steps:
[0045] (1-1) Use the CPOP algorithm to find the critical path of the DAG graph;
[0046] (1-2) Selection phase: Set the root node of the search tree to S 0 , From the root node S 0 At the beginning, after passing a node, start to judge whether the passed node has been expanded;
[0047] If the passed node has not been expanded, enter the expansion stage; if the expansion is completed, the node with the largest UCT value is selected as the search path node, and the process is calculated using the following formula:
[0048]
[0049]
[0050]
[0051] Among them, Cpuct is an important hyperparameter, which is mainly used to balance the weight between exploration and utilization; N(s,a) represents the number of visits to the current ta...
PUM
Abstract
Description
Claims
Application Information
- R&D Engineer
- R&D Manager
- IP Professional
- Industry Leading Data Capabilities
- Powerful AI technology
- Patent DNA Extraction
Browse by: Latest US Patents, China's latest patents, Technical Efficacy Thesaurus, Application Domain, Technology Topic.
© 2024 PatSnap. All rights reserved.Legal|Privacy policy|Modern Slavery Act Transparency Statement|Sitemap