Device driver comprehensive scheduling method for device idle time period adjustment
A technology of idle time and scheduling method, applied in data processing applications, computing, resources, etc., to achieve the effect of shortening waiting time, shortening idle waiting time, and improving equipment utilization
- Summary
- Abstract
- Description
- Claims
- Application Information
AI Technical Summary
Problems solved by technology
Method used
Image
Examples
Embodiment 1
[0048] A device-driven comprehensive scheduling method for equipment idle time period adjustment, characterized in that: the scheduling method mainly includes the following steps: adopting the method of building a process table, using the device number, the process number and the length of the process path as three attributes, and Arrange in descending order of process path length; when the equipment is idle, it means that the equipment has no schedulable process at this time, then find the non-schedulable process that needs to be processed by the equipment in order in the table, and take this process as the desired priority Processing procedure; determine the to-be-processed path of the to-be-preferred processing procedure, virtualize the to-be-prioritized processing procedure as the root node, use recursive traversal to traverse its immediate previous processes, and determine its to-be-processed path; prioritize the scheduling of the to-be-processed path , until the processin...
Embodiment 2
[0050] The above-mentioned device-driven comprehensive scheduling method for adjusting the idle time period of the device, the specific implementation steps of the scheduling method are as follows:
[0051] Step 1: Create a process table with process number, equipment number and process path length as attributes;
[0052] Step 2: Calculate the process path length of each process, and record the corresponding data in the table;
[0053] Step 3: After creating the table, arrange in descending order according to the length of the process path;
[0054] Step 4: Create a process tree according to the constraint relationship between processes. Each node contains three elements, which are the process number, equipment number and the processing time of the process;
[0055] Step 5: When all equipment has schedulable processes, select the process with the longest path length for processing;
[0056] Step 6: When the longest path is not unique, select the process with the shortest time ...
Embodiment 3
[0071] In the device-driven comprehensive scheduling method for adjusting device idle time periods, the process path length is the path length from the root node to the process node, that is, the sum of the processing time of each process on the path and the communication time between nodes.
[0072] In the device-driven comprehensive scheduling method for adjusting the idle time period of the device, the proposed priority processing procedure is to look up the table in order to find out the procedure that first affects the idle waiting period of the device when the device is idle.
[0073] In the device-driven comprehensive scheduling method for adjusting the idle time period of the device, the determination of the processing path of the proposed priority processing process is to virtualize the proposed priority processing process as the root node, and traverse its immediate preceding process, and finally determine a total The path with the shortest path length is taken as the...
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, Popular Technical Reports.
© 2024 PatSnap. All rights reserved.Legal|Privacy policy|Modern Slavery Act Transparency Statement|Sitemap|About US| Contact US: help@patsnap.com