Restart scheduling method of failure look-ahead threads
A scheduling method and thread technology, applied in the computer field, can solve problems that hinder the development of high-performance computing, high power consumption and heat dissipation, and difficulty in significantly improving performance, and achieve the effect of reducing the cost of thread restart and improving efficiency
- Summary
- Abstract
- Description
- Claims
- Application Information
AI Technical Summary
Problems solved by technology
Method used
Image
Examples
Embodiment 1
[0023] Embodiment 1: This forward-looking invalidation thread restart scheduling method, the specific operation steps are as follows:
[0024] A. Detect invalid look-ahead threads;
[0025] B. Calculate the resources occupied by each forward-looking invalid thread, denoted as M(i), i∈[0,n], n is the total number of all invalid threads;
[0026] C. Calculate the number of successor threads of each forward-looking failure thread, denoted as N(i), i∈[0,n], n is the total number of all failure threads;
[0027] D, determine the size of the sum of M(i) in step B and the total number M of existing idle resources, and select the execution thread;
[0028] E. Continue to return to step D for the remaining threads until all invalidated threads are re-executed;
[0029] F. Thread scheduling execution ends.
Embodiment 2
[0030] Embodiment 2: This embodiment is basically the same as Embodiment 1, and the special features are as follows:
[0031] The execution sequence of the step D thread directly depends on the parameters in the steps B and C, and the operation steps are as follows:
[0032] D1. When the sum of M(i) in step B is less than the total number M of existing free resources, go to step D11; when the sum of M(i) in step B is greater than the total number M of existing free resources, go to step D1. to step D21;
[0033] D11, judging whether the restart thread is a predecessor and successor thread each other, if so, first execute the predecessor thread and go to step D11; otherwise go to step D12;
[0034] D12, compare the resources M(i) occupied by restarting threads, and execute the threads with smaller M(i) first; go to step F;
[0035] D21, judging whether the restart thread is a predecessor and successor thread each other, if yes, first execute the predecessor thread and go to s...
Embodiment 3
[0037] Embodiment 3: The application environment of the solution described in this embodiment is a forward-looking thread parallel execution environment for multi-core processors. This embodiment does not limit the multi-core processor architecture and thread scheduling method in the application environment of the technical solution.
[0038] refer to figure 1 , the operation steps of this forward-looking failure thread restart scheduling method are as follows:
[0039] Step A (101), detecting invalid look-ahead threads.
[0040] Step B (102), calculating the resources M(i) occupied by each lookahead invalidated thread.
[0041] Step C (103), calculating the number N(i) of successor threads of each look-ahead invalidation thread.
[0042] Step D1 (104), judging whether the sum of M(i) is greater than the total number M of existing idle resources.
[0043] Step D11 (105), judging whether the restart thread is the predecessor thread or the successor thread of each other.
[...
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