Task scheduling method and device
A task scheduling and task technology, applied in the computer field to achieve the effect of improving memory access efficiency and performance
- Summary
- Abstract
- Description
- Claims
- Application Information
AI Technical Summary
Problems solved by technology
Method used
Image
Examples
Embodiment 1
[0068] A task scheduling method provided by an embodiment of the present invention, such as figure 2 As shown, the task scheduling method includes:
[0069] S101. The task scheduling device adds each of the multiple tasks to the task queue of the data block corresponding to the task according to the correspondence between the multiple tasks to be executed and the M data blocks to be accessed by the multiple tasks.
[0070] Wherein, the M data blocks are in one-to-one correspondence with the M task queues.
[0071] Exemplary, such as image 3 As shown in , assuming that there are currently 3 data blocks to be accessed (DB 0 、DB 1 and DB 2 ). Among these three data blocks, DB 0 Corresponding to task queue 0, DB 1 Corresponding to task queue 1, DB 2 Corresponds to task queue 2.
[0072] Assume that in the current multiple tasks (task a, task b, task c, task d, task e, task f and task g), task a and DB 0 and DB2 There is a corresponding relationship, task b and DB 0 Th...
Embodiment 2
[0140] An embodiment of the present invention provides a task scheduling device, such as Figure 10 As shown, the task scheduling device includes: a task adding module 21 and a task executing module 22 .
[0141] The task adding module 21 is used to add each task in the multiple tasks to the data block corresponding to the task according to the corresponding relationship between the multiple tasks to be executed and the M data blocks to be accessed by the multiple tasks A task queue, wherein the M data blocks are in one-to-one correspondence with the M task queues.
[0142]The task execution module 22 is configured to use N threads to execute in parallel the tasks added by the above task adding module 21 to the N task queues in the above M task queues, wherein each thread in the N threads executes the N tasks Tasks in a task queue in the queue, different threads in the N threads execute tasks in different task queues, 2≤N≤M.
[0143] Further, such as Figure 11 As shown, th...
Embodiment 3
[0166] An embodiment of the present invention provides a task scheduling device, such as Figure 13 As shown, the task scheduling device includes:
[0167] One or more processors 31, memory 32, bus system 33, and one or more application programs, the one or more processors 31 and the memory 32 are connected through the bus system 33; the one or more One or more application programs are stored in the memory 32, the one or more application programs including instructions.
[0168] The processor 31 is used to execute the instructions, and is specifically used to replace the above-mentioned task adding module 21, task executing module 22, queue adding module 23, and queue deleting module 24, etc., to execute as figure 2 , Figure 6 , Figure 8 and Figure 9 The task scheduling method shown in any one of the accompanying drawings. That is, the processor 31 can be the integration of functional units or functional modules such as the above-mentioned task adding module 21, task ...
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