CN102591703B - Task scheduling method and task scheduling device for operating system and computer - Google Patents
Task scheduling method and task scheduling device for operating system and computer Download PDFInfo
- Publication number
- CN102591703B CN102591703B CN201110003864.5A CN201110003864A CN102591703B CN 102591703 B CN102591703 B CN 102591703B CN 201110003864 A CN201110003864 A CN 201110003864A CN 102591703 B CN102591703 B CN 102591703B
- Authority
- CN
- China
- Prior art keywords
- task
- ready
- index
- priority
- node
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Active
Links
Classifications
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F9/00—Arrangements for program control, e.g. control units
- G06F9/06—Arrangements for program control, e.g. control units using stored programs, i.e. using an internal store of processing equipment to receive or retain programs
- G06F9/46—Multiprogramming arrangements
- G06F9/48—Program initiating; Program switching, e.g. by interrupt
- G06F9/4806—Task transfer initiation or dispatching
- G06F9/4812—Task transfer initiation or dispatching by interrupt, e.g. masked
- G06F9/4831—Task transfer initiation or dispatching by interrupt, e.g. masked with variable priority
Abstract
The invention discloses a task scheduling method and a task scheduling device for an operating system and a computer, wherein the method includes: triggering and scheduling a task of the operating system through switching of task states; obtaining link index corresponding to the task in a task index table according to priority of the task; and updating positions of the task in a ready task chain table according to the link index. By means of the task scheduling method and the task scheduling device for the operating system and the computer, the task scheduling method which is easy, flexible and efficient can be achieved, and working efficiency of task scheduling for the operating system is improved.
Description
Technical field
The present invention relates to embedded real-time operating system, specifically, particularly relate to a kind of method for scheduling task of operating system, device and computing machine.
Background technology
Embedded real-time operating system is that one can determining completion system function in the time, and to inside, external event can make the system of response in time.
Task scheduling is one of Core Feature of operating system, and its major function selects certain ready task according to a certain criterion, and jumps in this task and perform.Scheduler is exactly the module of scheduling feature of finishing the work.Most embedded real-time operating system is dispatched based on priority, and being specially operating system is each task matching priority, and scheduler, from each ready task, selects the tasks carrying that priority is the highest.
At present, the reference that the implementation method of embedded real-time operating system scheduler is more or the method improving the packet map table that μ C/OS-II proposes realize within stabilization time, find pending task, on it realizes, packet map table is first adopted to find the limit priority of ready state task; Maintain respective Task-list for each priority again, the task of same priority is inserted according to first in first out (First-in, First-out) principle/is deleted from chained list.Achieve the support that can use this characteristic of same priority to multiple task like this.But, need to consume extra data space by the lookup method of packet map table, and the number of priority is also restricted.
Therefore, the method for scheduling task in the operating system of currently available technology needs to consume extra data space, and priority and task one_to_one corresponding, underaction.
Summary of the invention
Fundamental purpose of the present invention is to provide a kind of method for scheduling task of operating system, device and computing machine, need to consume extra data space with the method for scheduling task solved in the operating system of prior art, and under same priority, support the problem of multiple task.
To achieve these goals, according to an aspect of the present invention, a kind of method for scheduling task of operating system is provided.
The method for scheduling task of operations according to the instant invention system comprises: the task of being triggered scheduling operation system by the conversion of task status; In task dictionary, sitation index corresponding to this task is obtained according to the priority of task; According to the sitation index more position of new task in ready task chained list.
Further, before the step obtaining sitation index corresponding to this task according to the priority of task in task dictionary, method also comprises: creation task concordance list, task dictionary comprises one or more index record, each index record is for recording first and the sitation index of last task node in ready task chained list corresponding to a priority, wherein, the corresponding one or more task node of any one priority, each task node is corresponding unique priority respectively.
Further, the step according to the sitation index more position of new task in ready task chained list comprises: obtain the node location of task in ready task chained list that sitation index characterizes, ready task chained list is for recording the node location of each priority tasks; Task is inserted or removes node location.
Further, after according to the step of the sitation index more position of new task in ready task chained list, method also comprises: according to the reposition of task in ready task chained list, obtain the new url index of this priority tasks in task dictionary, original sitation index is replaced by new join index.
Further, after the conversion by task status triggers the step of the task of scheduling operation system, method also comprises: the conversion whether handover success judging task status, wherein, when task status handoff failure, switch to delay state simultaneously, then by task delay Task-list, otherwise trigger the step success of the task of scheduling operation system.
Further, when moment arrival or the time-out of delay state, task switch success.
To achieve these goals, according to another aspect of the present invention, a kind of task scheduling apparatus of operating system is provided.
The task scheduling apparatus of operations according to the instant invention system comprises: trigger module, for being triggered the task of scheduling operation system by the conversion of task status; Scheduler module, for obtaining sitation index corresponding to this task according to the priority of task in task dictionary; First update module, for according to the sitation index more position of new task in ready task chained list.
Further, device also comprises: creation module, for creation task concordance list, task dictionary comprises one or more index record, each index record is for recording first and the sitation index of last task node in ready task chained list corresponding to a priority, wherein, the corresponding one or more task node of any one priority, each task node is corresponding unique priority respectively.
Further, the first update module comprises: acquisition module, and for obtaining the node location of task in ready task chained list that sitation index characterizes, ready task chained list is for recording the node location of each priority tasks; Change module, for task being inserted or removing node location.
Further, device also comprises: the second update module, for according to the reposition of task in ready task chained list, obtains the new url index of this priority tasks in task dictionary, original sitation index is replaced by new join index.
Further, device also comprises: judge module, for judging the conversion whether handover success of task status, wherein, when task status handoff failure, switch to delay state simultaneously, then by task delay Task-list, otherwise trigger the step success of the task of scheduling operation system, wherein, when moment arrival or the time-out of delay state, task switch success.
To achieve these goals, in accordance with a further aspect of the present invention, a kind of computing machine is provided.This computing machine comprises the task scheduling apparatus of any one operating system above-mentioned.
By the present invention, adopt the task of being triggered scheduling operation system by the conversion of task status; In task dictionary, sitation index corresponding to this task is obtained according to the priority of task; According to the sitation index more position of new task in ready task chained list, the method for scheduling task solved in the operating system of prior art needs to consume extra data space, and under same priority, support the problem of multiple task, and then it is simple to reach realization, flexible and efficient method for scheduling task, improves the effect of the work efficiency of operating system task scheduling.
Accompanying drawing explanation
Accompanying drawing described herein is used to provide a further understanding of the present invention, forms a part of the present invention, and schematic description and description of the present invention, for explaining the present invention, does not form inappropriate limitation of the present invention.In the accompanying drawings:
Fig. 1 is the process flow diagram of the method for scheduling task of operating system according to the embodiment of the present invention;
Fig. 2 is according to task status transition graph embodiment illustrated in fig. 1;
Fig. 3 is ready task chained list according to the embodiment of the present invention and task dictionary structural drawing;
Fig. 4 is the change structural drawing of Task-list when proceeding to running status according to any task of the embodiment of the present invention by ready state and task dictionary;
Fig. 5 is the change structural drawing of Task-list when proceeding to ready state according to any task of the embodiment of the present invention by blocked state and task dictionary;
Fig. 6 is the change structural drawing of Task-list when proceeding to blocked state according to any task of the embodiment of the present invention by ready state and task dictionary;
Fig. 7 is the change structural drawing of Task-list and task dictionary when entering ready state after any task wait timeout according to the embodiment of the present invention;
Fig. 8 is the structural representation of the task scheduling apparatus of operating system according to the embodiment of the present invention.
Embodiment
In order to make technical matters to be solved by this invention, technical scheme and beneficial effect clearly, understand, below in conjunction with drawings and Examples, the present invention is further elaborated.Should be appreciated that specific embodiment described herein only in order to explain the present invention, be not intended to limit the present invention.
The invention provides a kind of method for scheduling task of operating system.Fig. 1 is the process flow diagram of the method for scheduling task of operating system according to the embodiment of the present invention.As shown in Figure 1, the method for scheduling task of this operating system comprises the steps:
Step S102, triggers the task of scheduling operation system by the conversion of task status.
Step S104, obtains sitation index corresponding to this task according to the priority of task in task dictionary.This step realizes setting up the scheduling concordance list of task of being scheduled, the traffic order that the task of different priorities is corresponding different, i.e. corresponding different link position.
Step S106, according to the sitation index more position of new task in ready task chained list.This step realizes the node location being carried out this task in unified management ready task chained list by the sitation index of task dictionary record, the system of realization can obtain task dispatch state now efficiently, and does not need extra to safeguard multiple Task-list according to priority.
The above embodiment of the present invention is by safeguarding that the mode of ready task chained list (based on first in first out) and priority tasks concordance list realizes the scheduling to task, first the sitation index of different priorities task is preserved by creating also management role concordance list, such as this sitation index can provide the positional information of the insertion ready task chained list of correspondence for this task, make this task when transferring ready state to from suspended state, only need the positional information first obtaining this task can determine that this task is in ready state, so that system carries out running this task, save storage space.
The above embodiment of the present invention before the step obtaining sitation index corresponding to this task according to the priority of task in task dictionary, method can also comprise: creation task concordance list, task dictionary comprises one or more index record, each index record is for recording first and the sitation index of last task node in ready task chained list corresponding to a priority, wherein, the corresponding one or more task node of any one priority, each task node is corresponding unique priority respectively.This embodiment can be implemented as different priority tasks and sets up different chained commands, and the doubly linked list technology of employing takes up room less.
Preferably, the step according to the sitation index more position of new task in ready task chained list comprises: obtain the node location of task in ready task chained list that sitation index characterizes, ready task chained list is for recording the node location of each priority tasks; Task is inserted or removes node location.This embodiment can realize only the positional information of this node ready Task-list need being deleted when task transfers suspended state to from ready state, or when task transfers ready state to from suspended state, the node location that only need change pointed just realizes increasing this task in ready task chained list, the storage space of the method simply efficiently, not outside occupying volume.
In the above embodiment of the present invention after according to the step of the sitation index more position of new task in ready task chained list, method can also comprise: according to the reposition of task in ready task chained list, obtain the new url index of this priority tasks in task dictionary, original sitation index is replaced by new join index.
Wherein, after the conversion by task status triggers the step of the task of scheduling operation system, this embodiment can perform the conversion whether handover success judging task status, wherein, when task status handoff failure, switch to delay state simultaneously, then by task delay Task-list, otherwise trigger the step success of the task of scheduling operation system.Preferably, in above-described embodiment when the moment arrival of delay state or time-out, task switch is successfully.
The implementation method of the task scheduling that the above embodiment of the present invention is described, namely realize above-mentioned mentioned according to feature task scheduling rule (namely carrying out task scheduling according to the priority of task), find the method that corresponding task performs, support the task of multiple equal priority, and the adjustment of task priority.The dispatching method that the present invention proposes realizes simple, consuming time stable and flexible and efficient.
Be described in detail below in conjunction with the implementation procedure of example to the embodiment of the present invention.
Fig. 2 is according to task status transition graph embodiment illustrated in fig. 1.The present invention is by safeguarding that the mode of ready task chained list (based on first in first out) and priority tasks concordance list realizes the scheduling to task.Comprise task state transition and task scheduling, as shown in Figure 2, the implementation procedure that operating system describes task scheduling according to the State Transferring of task is as follows:
First, system creation task also arranges task status, the information such as priority, and with this assignment task control block (TCB) (TCB.Tack Control Block).The basic status of task can be divided into following three kinds: running status (Running), blocked state (Pending), ready state (Ready).
As shown in Figure 2, the transition relationship of above-mentioned three kinds of states of task and trigger condition comprise following a few class situation respectively:
Ready state is converted in the process of running status (Ready-> Running), current when being in the task generation state transition of running status Running, the task of being in the limit priority of ready state Ready will enter running status Running.If be in this priority by multiple task, so select task according to first in first out (FIFO:First-in, First-out).
Running state conversion is in the process of ready state (Running-> Ready), when higher priority task ready or the current task of being in running status Running change, this task can revise self priority in priority tasks concordance list.
Running state conversion is in the process of blocked state (Running-> Pending), the current following action of tasks carrying being in running status Running: wait for certain event; Call delay function (Delay) and wait for the some time; (Suspend) this task of hang-up; Wait enters Pending state.
Ready state is converted in the process of blocked state (Ready-> Pending), and current task is suspended.
Blocked state is converted in the process of ready state (Pending-> Ready), the current following action of tasks carrying being in blocked state: the event that system task is waited for occurs; Task (Suspended) after hang-up is waken up (Resume); If now task delay time enters ready state Ready to task when (Timeout) from blocked state Pending.
Secondly, system is each task creation doubly linked list of ready state, chained list afterbody points to Idle task, each node in this chained list comprises task control block (TCB) (TCB.Tack Control Block) and points to precursor pointer and the heir pointer of front and back node address, by this doubly linked list realize task when three kinds of states perform migration action each other, determine the position in node of this task.
In addition, also need to set up task dictionary, concordance list is that each task priority retains a task index record, records first and the sitation index of last task node in ready task chained list of this priority.
During task scheduling, system produces the switching between each state of task by the first node directly found in ready task chained list.
Such as, when certain task proceeds to ready state by suspended state, find the node location needing to insert ready task chained list from task dictionary according to own priority, and this task is inserted node corresponding to node location; When certain task proceeds to pending state by ready state, then can delete this node from ready task chained list, upgrade concordance list record simultaneously.
In addition, if if certain task calls delay function, then by this task delay Task-list.When each Interruption produces, in Interrupt Service Routine, successively the delay designations of task in chained list (tick number) is subtracted one.If certain task time delay moment arrives (tick is 0), then enter ready state, and insert ready task chained list.
By safeguarding that the mode of ready task chained list (based on first in first out) and priority tasks concordance list realizes the scheduling to task in the above embodiment of the present invention.Wherein, Fig. 3 is ready task chained list according to the embodiment of the present invention and task dictionary structural drawing.Specifically as shown in Figure 3, each node in ready task chained list comprises task control block (TCB) (TCB.Tack Control Block) and front and back node address; The task of equal priority (such as priority N or M etc.) can be connected on adjacent node according to FIFO Principle Chain.The sitation index of each task in task dictionary have recorded first of the task of equal priority (such as priority N or M etc.) in ready task chained list and the position of last node.When task scheduling, can operate ready task chained list according to the node location of sitation index record easily.
When just describing generation task scheduling below in detail, the handoff procedure between each state of this task.
Fig. 4 is the change structural drawing of Task-list when proceeding to running status according to any task of the embodiment of the present invention by ready state and task dictionary.When task status occurs to proceed to the migration of running status (Runing) by ready state (Ready), triggering tasks is dispatched.Now, scheduler directly finds the first node in ready task chained list, produces task switch subsequently.As shown in Figure 4, specifically can comprise the steps:
First, scheduler gets the gauge outfit node in ready state Task-list; Then, by empty for the pre pointed of second node of the next pointed of this gauge outfit node node; Again empty for present node next pointed node; Updating form head node again, using this second node as new gauge outfit node; Finally, upgrade the index record of task dictionary, first node position in task dictionary is pointed to the gauge outfit node after this renewal (i.e. second node).
Fig. 5 is the change structural drawing of Task-list when proceeding to ready state according to any task of the embodiment of the present invention by blocked state and task dictionary.When certain task proceeds to ready state (Ready) by blocked state (Pending), find the node location needing to insert ready task chained list from task dictionary according to own priority, insert node.As shown in Figure 5, specifically can comprise the steps:
First, obtain the task index record of task dictionary according to the priority of task self, namely obtain the chained address of the node of this priority in task dictionary; Secondly, the node of last task of equal priority can be obtained by index record; Then, this node can the task of the next pointed of the own node not pre pointed of first task node of equal priority; Meanwhile, the pre pointer of the next pointed own node of last original for same priority task node; Finally, the record in task dictionary is upgraded.
Fig. 6 is the change structural drawing of Task-list when proceeding to blocked state according to any task of the embodiment of the present invention by ready state and task dictionary.When certain task proceeds to blocked state by ready state, from ready task chained list, delete this node, upgrade concordance list record simultaneously.As shown in Figure 6, specifically can comprise the steps:
First, task control block (TCB) (TCB) node of self is obtained; Then, the task control block (TCB) node pointed by the next pointer of the next pointed present node of the previous node pointed by the pre pointer in present node; Now, be last task node of this priority recorded in task dictionary record at present node, upgrade the record in task dictionary.
Fig. 7 is the change structural drawing of Task-list and task dictionary when entering ready state after any task wait timeout according to the embodiment of the present invention.When certain task is by time delay, then in delay Task-list.When each Interruption produces, in Interrupt Service Routine, successively the time delay tick of task in chained list mark is subtracted one.If certain task time delay moment to (tick is 0), then enters ready state, and inserts ready task chained list.As shown in Figure 7, specifically can to comprise the steps:
First, system deletes this task node from delayed tasks chained list; Then from task dictionary, same priority task node index is obtained according to the priority of overtime task; Again the task node of the next pointed of last task node of the next pointed equal priority of overtime task node; Meanwhile, by the next pointed overtime task node of last task node of equal priority; And the node of last task of the pre pointed equal priority of overtime task; Finally perform the step of the record upgrading task dictionary.
It should be noted that, the embodiment of the present invention can perform in the step shown in the process flow diagram of accompanying drawing in the computer system of such as one group of computer executable instructions, and, although show logical order in flow charts, but in some cases, can be different from the step shown or described by order execution herein.
Fig. 8 is the structural representation of the task scheduling apparatus of operating system according to the embodiment of the present invention.As shown in Figure 8, this device comprises: trigger module 801, scheduler module 803 and the first update module 805.
Wherein, trigger module 801, for triggering the task of scheduling operation system by the conversion of task status; Scheduler module 803, for obtaining sitation index corresponding to this task according to the priority of task in task dictionary; First update module 805, for according to the sitation index more position of new task in ready task chained list.
Trigger module 801 in above-described embodiment can realize the function of step S102 in Fig. 1, and scheduler module 803 can realize the function of step S104 in Fig. 1, and the first update module 805 can realize the function of step S106 in Fig. 1.By this device by safeguarding that the mode of ready task chained list (based on first in first out) and priority tasks concordance list realizes the scheduling to task, the task node location after state switching that will dispatch is determined according to the sitation index in scheduler module 803, such as this sitation index can provide the positional information of the insertion ready task chained list of correspondence for this task, making this task when transferring ready state to from suspended state, only needing the positional information first obtaining this task can determine that this task is in ready state.Said apparatus of the present invention saves data space, improves the dispatching efficiency of system.Realize simple, consuming time stable, flexible and efficient task scheduling implementation method.
Preferably, this device can also comprise: creation module 807, for creation task concordance list, task dictionary comprises one or more index record, each index record is for recording first and the sitation index of last task node in ready task chained list corresponding to a priority, wherein, the corresponding one or more task node of any one priority, each task node is corresponding unique priority respectively.
Preferably, the first update module 805 can comprise: acquisition module 8051, and for obtaining the node location of task in ready task chained list that sitation index characterizes, ready task chained list is for recording the node location of each priority tasks; Change module 8052, for task being inserted or removing node location.
Preferably, said apparatus of the present invention can also comprise: the second update module 809, for according to the reposition of task in ready task chained list, obtain the new url index of this priority tasks in task dictionary, original sitation index is replaced by new join index.
Preferably, said apparatus of the present invention can also comprise: judge module 811, for judging the conversion whether handover success of task status, wherein, when task status handoff failure, switch to delay state simultaneously, then by task delay Task-list, otherwise trigger the step success of the task of scheduling operation system, wherein, when moment arrival or the time-out of delay state, task switch success.
To achieve these goals, present invention also offers a kind of computing machine.This computing machine comprises the task scheduling apparatus of any one operating system above-mentioned.
From above embodiment describes, can find out, present invention achieves following technique effect: the implementation method of task scheduling of the present invention, scheduler latency is stablized, and runs efficient, and supports the task of multiple equal priority, and the adjustment of task priority.While dirigibility is improved, decrease the use of data space.Realize simple, consuming time stable, flexible and efficient task scheduling implementation method, and support the task of multiple equal priority, and the adjustment of task priority.
Obviously, those skilled in the art should be understood that, above-mentioned of the present invention each module or each step can realize with general calculation element, they can concentrate on single calculation element, or be distributed on network that multiple calculation element forms, alternatively, they can realize with the executable program code of calculation element, thus, they can be stored and be performed by calculation element in the storage device, or they are made into multiple integrated circuit modules respectively, or the multiple module in them or step are made into single integrated circuit module to realize.Like this, the present invention is not restricted to any specific hardware and software combination.
Above-mentioned explanation illustrate and describes a preferred embodiment of the present invention, but as previously mentioned, be to be understood that the present invention is not limited to the form disclosed by this paper, should not regard the eliminating to other embodiments as, and can be used for other combinations various, amendment and environment, and can in invention contemplated scope described herein, changed by the technology of above-mentioned instruction or association area or knowledge.And the change that those skilled in the art carry out and change do not depart from the spirit and scope of the present invention, then all should in the protection domain of claims of the present invention.
Claims (10)
1. a method for scheduling task for operating system, is characterized in that, comprising:
The task of scheduling operation system is triggered by the conversion of task status;
In task dictionary, sitation index corresponding to this task is obtained according to the priority of described task;
The position of described task in ready task chained list is upgraded according to described sitation index;
Wherein, described task status comprise following one of at least: running status, blocked state, ready state;
Wherein, before the step obtaining sitation index corresponding to this task according to the priority of described task in task dictionary, described method also comprises:
Create described task dictionary, described task dictionary comprises one or more index record, each described index record is for recording first and the sitation index of last task node in described ready task chained list corresponding to a priority, wherein, the corresponding one or more described task node of any one priority, each described task node is corresponding unique described priority respectively.
2. method according to claim 1, is characterized in that, the step upgrading the position of described task in ready task chained list according to described sitation index comprises:
Obtain the node location of described task in described ready task chained list that described sitation index characterizes, described ready task chained list is for recording the node location of each priority tasks;
Described task is inserted or removes described node location.
3. the method according to any one of claim 1-2, it is characterized in that, after the step upgrading the position of described task in ready task chained list according to described sitation index, described method also comprises: according to the reposition of described task in described ready task chained list, obtain the new url index of this priority tasks in described task dictionary, original described sitation index is replaced by described new url index.
4. method according to claim 1, is characterized in that, after the conversion by task status triggers the step of the task of scheduling operation system, described method also comprises:
Judge the conversion whether handover success of described task status, wherein, when described task status handoff failure, switch to delay state simultaneously, then by described task delay Task-list, otherwise the success of the step of the task of described triggering scheduling operation system.
5. method according to claim 4, is characterized in that, when moment arrival or the time-out of described delay state, and described task switch success.
6. a task scheduling apparatus for operating system, is characterized in that, comprising:
Trigger module, for triggering the task of scheduling operation system by the conversion of task status;
Scheduler module, for obtaining sitation index corresponding to this task according to the priority of described task in task dictionary;
First update module, for upgrading the position of described task in ready task chained list according to described sitation index;
Wherein, described task status comprise following one of at least: running status, blocked state, ready state;
Wherein, described device also comprises:
Creation module, for creating described task dictionary, described task dictionary comprises one or more index record, each described index record is for recording first and the sitation index of last task node in described ready task chained list corresponding to a priority, wherein, the corresponding one or more described task node of any one priority, each described task node is corresponding unique described priority respectively.
7. device according to claim 6, is characterized in that, described first update module comprises:
Acquisition module, for obtaining the node location of described task in described ready task chained list that described sitation index characterizes, described ready task chained list is for recording the node location of each priority tasks;
Change module, for described task being inserted or removing described node location.
8. device according to claim 6, it is characterized in that, described device also comprises: the second update module, for according to the reposition of described task in described ready task chained list, obtain the new url index of this priority tasks in described task dictionary, original described sitation index is replaced by described new url index.
9. device according to claim 6, is characterized in that, described device also comprises:
Judge module, for judging the conversion whether handover success of described task status, wherein, when described task status handoff failure, switch to delay state, then by described task delay Task-list simultaneously, otherwise the success of the step of the task of described triggering scheduling operation system, wherein, when moment arrival or the time-out of described delay state, described task switch success.
10. a computing machine, is characterized in that, comprises the task scheduling apparatus of the operating system in claim 6-9 described in any one.
Priority Applications (2)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201110003864.5A CN102591703B (en) | 2011-01-10 | 2011-01-10 | Task scheduling method and task scheduling device for operating system and computer |
| PCT/CN2011/074391 WO2012094862A1 (en) | 2011-01-10 | 2011-05-20 | Method, apparatus and computer for task scheduling in operating system |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201110003864.5A CN102591703B (en) | 2011-01-10 | 2011-01-10 | Task scheduling method and task scheduling device for operating system and computer |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN102591703A CN102591703A (en) | 2012-07-18 |
| CN102591703B true CN102591703B (en) | 2015-05-06 |
Family
ID=46480413
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201110003864.5A Active CN102591703B (en) | 2011-01-10 | 2011-01-10 | Task scheduling method and task scheduling device for operating system and computer |
Country Status (2)
| Country | Link |
|---|---|
| CN (1) | CN102591703B (en) |
| WO (1) | WO2012094862A1 (en) |
Families Citing this family (8)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN103049325A (en) * | 2013-01-09 | 2013-04-17 | 浙江大学 | Method for implementing CSA (context save area) node manager on basis of TC1767 platform |
| CN103488536B (en) * | 2013-09-29 | 2017-12-05 | 华为技术有限公司 | Method for scheduling task, device and operating system |
| CN106201695A (en) * | 2016-07-15 | 2016-12-07 | 郑州飞机装备有限责任公司 | It is applicable to the multi-task scheduling method of embedded software system |
| CN109901917B (en) * | 2017-12-07 | 2022-04-22 | 龙芯中科技术股份有限公司 | Real-time operating system scheduling method and device and computer readable storage medium |
| CN109947468B (en) * | 2017-12-20 | 2021-07-02 | 北京谊安医疗系统股份有限公司 | Event delay method for realizing non-blocking and task-free switching |
| CN111277900B (en) * | 2018-12-05 | 2022-12-23 | 深圳市茁壮网络股份有限公司 | Starting method and device of set top box |
| CN111027196B (en) * | 2019-12-03 | 2023-04-28 | 南方电网科学研究院有限责任公司 | Simulation analysis task processing method and device for power equipment and storage medium |
| CN114579812B (en) * | 2022-03-14 | 2023-09-15 | 上海壁仞智能科技有限公司 | Management method and device of linked list queue, task management method and storage medium |
Citations (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101178664A (en) * | 2007-12-12 | 2008-05-14 | 北京中星微电子有限公司 | Task scheduling method and system in real-time operating system |
| CN101299197A (en) * | 2008-06-30 | 2008-11-05 | 北京中星微电子有限公司 | Method and unit for adding and deleting task |
Family Cites Families (5)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| KR100678930B1 (en) * | 1999-10-11 | 2007-02-07 | 삼성전자주식회사 | Real-time Control System for Digital Signal Processor |
| CN100349149C (en) * | 2003-01-24 | 2007-11-14 | 中兴通讯股份有限公司 | Process scheduling method in embedded type real time operating system |
| JP2008084009A (en) * | 2006-09-27 | 2008-04-10 | Toshiba Corp | Multiprocessor system |
| CN101014176A (en) * | 2007-02-05 | 2007-08-08 | 浪潮乐金信息系统有限公司 | Collection scheduling method based on priority time linked list in communication network management system |
| CN101266553B (en) * | 2008-05-06 | 2010-06-02 | 无锡紫芯集成电路系统有限公司 | Multitask management process based on embedded system |
-
2011
- 2011-01-10 CN CN201110003864.5A patent/CN102591703B/en active Active
- 2011-05-20 WO PCT/CN2011/074391 patent/WO2012094862A1/en active Application Filing
Patent Citations (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101178664A (en) * | 2007-12-12 | 2008-05-14 | 北京中星微电子有限公司 | Task scheduling method and system in real-time operating system |
| CN101299197A (en) * | 2008-06-30 | 2008-11-05 | 北京中星微电子有限公司 | Method and unit for adding and deleting task |
Non-Patent Citations (1)
| Title |
|---|
| ucos-ii的任务调度机制;CSDN;《http://blog.csdn.net/allen_1986/article/details/6059515》;20101206;第1－4页 * |
Also Published As
| Publication number | Publication date |
|---|---|
| CN102591703A (en) | 2012-07-18 |
| WO2012094862A1 (en) | 2012-07-19 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN102591703B (en) | Task scheduling method and task scheduling device for operating system and computer | |
| EP2871809B1 (en) | Message processing method, device and system for internet of things | |
| JP5405320B2 (en) | Virtual machine control device, virtual machine control method, and virtual machine control program | |
| KR100864964B1 (en) | Arithmetic Processing System and Arithmetic Processing Control Method, Task Management System and Task Management Method, and Storage Medium | |
| CA2200929C (en) | Periodic process scheduling method | |
| US8141079B2 (en) | Dynamic application scheduler in a polling system | |
| CN101604264B (en) | Task scheduling method and system for supercomputer | |
| EP3496335B1 (en) | Method and apparatus for managing broadcast message | |
| US20170329632A1 (en) | Device scheduling method, task manager and storage medium | |
| JP2008506187A (en) | Method and system for parallel execution of multiple kernels | |
| US7640549B2 (en) | System and method for efficiently exchanging data among processes | |
| CN111694675B (en) | Task scheduling method and device and storage medium | |
| CN106371900A (en) | Data processing method and device for realizing asynchronous call | |
| CN113132456B (en) | Edge cloud cooperative task scheduling method and system based on deadline perception | |
| EP4350515A1 (en) | Load balancing method for multi-thread forwarding, and related apparatus | |
| JP7161560B2 (en) | Artificial intelligence development platform management method, device, medium | |
| CN105335130A (en) | Processor and method for processing task | |
| JP2007519061A (en) | Task scheduling apparatus, task scheduling method, task scheduling program, recording medium, and transmission medium | |
| JP2904483B2 (en) | Scheduling a periodic process | |
| WO2023098614A1 (en) | Cloud instance capacity expansion/reduction method and related device therefor | |
| CN108241770B (en) | Message response distributed simulation method based on reflective memory network | |
| JPH07295840A (en) | Event management system for multiprogramming system | |
| WO2020246965A1 (en) | Task distribution across multiple processing devices | |
| CN103257894A (en) | Program management method and electronic terminal | |
| CN110362314A (en) | Information processing method and device, computer-readable medium, electronic equipment |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| C06 | Publication | ||
| PB01 | Publication | ||
| C10 | Entry into substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| C14 | Grant of patent or utility model | ||
| GR01 | Patent grant | ||
| C41 | Transfer of patent application or patent right or utility model | ||
| TR01 | Transfer of patent right |
Effective date of registration: 20151104 Address after: Dameisha Yantian District of Shenzhen City, Guangdong province 518085 Building No. 1 Patentee after: SHENZHEN ZTE MICROELECTRONICS TECHNOLOGY CO., LTD. Address before: 518057 Nanshan District Guangdong high tech Industrial Park, South Road, science and technology, ZTE building, Ministry of Justice Patentee before: ZTE Corporation |
|
| EE01 | Entry into force of recordation of patent licensing contract | ||
| EE01 | Entry into force of recordation of patent licensing contract |
Application publication date: 20120718 Assignee: Xi'an Chris Semiconductor Technology Co. Ltd. Assignor: SHENZHEN ZTE MICROELECTRONICS TECHNOLOGY CO., LTD. Contract record no.: 2019440020036 Denomination of invention: Task scheduling method and task scheduling device for operating system and computer Granted publication date: 20150506 License type: Common License Record date: 20190619 |