CN109710390A - The multi-task processing method and processing system of single-threaded processor - Google Patents
The multi-task processing method and processing system of single-threaded processor Download PDFInfo
- Publication number
- CN109710390A CN109710390A CN201811553868.9A CN201811553868A CN109710390A CN 109710390 A CN109710390 A CN 109710390A CN 201811553868 A CN201811553868 A CN 201811553868A CN 109710390 A CN109710390 A CN 109710390A
- Authority
- CN
- China
- Prior art keywords
- task
- waiting task
- waiting
- time interval
- subtask
- 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.)
- Granted
Links
Abstract
The invention discloses a kind of multi-task processing method of single-threaded processor and processing systems, wherein, it the treating method comprises following steps: S1: each waiting task being split respectively, it obtains and each waiting task multiple subtasks correspondingly, simultaneously, preset the time interval between adjacent subtask, wherein each waiting task splits position selection in the position for being delayed or waiting external information；S2: being alternately performed each waiting task, until all waiting tasks have been handled, wherein, behind every subtask executed in a waiting task, the next executable waiting task of circulation searching executes the pending subtask in the waiting task if finding.The multi-task processing method and processing system of the single-threaded processor effectively increase the utilization rate of processor, meanwhile, the processing speed time for improving the real-time of all tasks, shortening task.
Description
Technical field
The present invention relates to multitasking fields, specifically provide a kind of multi-task processing method of single-threaded processor.
Background technique
In recent years, Internet of Things industry development is more and more rapider, and consequent is embeded processor using increasingly
Extensively.When processor type selecting, enterprise often selects as far as possible on the basis of meeting functional requirement for save the cost
The processor of low price, however, the limited capacity of these processors, some are unable to graft procedure system, cannot achieve multitask
It runs simultaneously, subsequent task can only be executed again after completing a task, still, in the implementation procedure of task, often deposited
The case where being delayed or waiting external information, at this moment, processor is in idle condition, and can not but execute other tasks, utilization rate
It is extremely low.
Therefore, the utilization rate for how improving processor improves the real-time of all tasks, becomes that people are urgently to be resolved to be asked
Topic.
Summary of the invention
In consideration of it, the purpose of the present invention is to provide a kind of multi-task processing method of single-threaded processor and processing systems
System, to improve the utilization rate of processor, realize the quick processing of multitask.
One aspect of the present invention provides a kind of multi-task processing method of single-threaded processor, comprising: single-threaded processor
Multi-task processing method include the following steps: for being alternately performed multiple waiting tasks
S1: respectively splitting each waiting task, obtains and each waiting task multiple sons correspondingly
Task, meanwhile, preset the time interval between adjacent subtask, wherein the fractionation position selection of each waiting task is being prolonged
When or wait external information position；
S2: being alternately performed each waiting task, until having handled all waiting tasks, wherein every to have executed one
Behind a subtask in waiting task, the next executable waiting task of circulation searching, if finding, executing should be to
Pending subtask in processing task.
It is preferred that after having executed a subtask in a waiting task, circulation searching is next executable in S2
Waiting task, if finding, the step of executing the pending subtask in the waiting task, is as follows:
S21: after having executed a subtask in a waiting task, in all waiting tasks under circulation searching
One executable waiting task, into S22, if not finding, repeats the step if finding；
S22: the execution of waiting task last time is searched from execution position memory corresponding with the waiting task
The position arrived, and execute first pending subtask behind the position.
Further preferably, in S21 in all waiting tasks the next executable waiting task of circulation searching, if
It finds, into S22, if not finding, the step of repeating the step is as follows:
S211: setting and the one-to-one time interval storage unit of waiting task, wherein time interval storage unit
Time interval needed for middle storage executes next subtask inside corresponding waiting task；
S212: circulation searching time interval storage unit corresponding with waiting task, if finding time interval for the first time
The required time interval stored in storage unit is already expired, then makees waiting task corresponding with the time interval storage unit
For next executable waiting task, and enters S22 and repeat the step if not finding.
Further preferably, the time interval stored in the time interval storage unit it is every executed it is corresponding to
Behind a subtask in processing task, carried out more by the prefixed time interval between the subtask and next subtask
Newly.
Further preferably, further include the steps that priority is arranged for each waiting task before S21, then circulation searching in S212
And the corresponding time interval storage unit of waiting task is deposited by time interval corresponding with the high waiting task of priority
Storage unit circuits sequentially lookup to time interval storage unit corresponding with the low waiting task of priority.
It is multiple to be processed for being alternately performed the present invention also provides a kind of multitasking system of single-threaded processor
Task, comprising:
Waiting task split cells: respectively splitting each waiting task, obtains and each waiting task
One-to-one multiple subtasks, wherein the position selection that splits of each waiting task is being delayed or is waiting external information
Position；
Time interval setting unit: for presetting the time interval in each waiting task between adjacent subtask；
Waiting task execution unit: for being alternately performed each waiting task, up to having handled to be handled of institute
Business, wherein behind every subtask executed in a waiting task, circulation searching next executable to be processed
Business, if finding, executes the pending subtask in the waiting task.
It is preferred that the multitasking system of the single-threaded processor further includes executing correspondingly with waiting task
Position storage unit, for storing the position that the waiting task last time goes to, waiting task execution unit every time by
First behind the position that the last time stored in execution position storage unit corresponding with executable waiting task goes to
A pending subtask starts to execute.
Further preferably, the multitasking system of the single-threaded processor further includes corresponding with waiting task
Time interval storage unit, wherein storage executes inside corresponding waiting task in time interval storage unit
Time interval needed for next subtask, wherein waiting task execution unit circulation searching is next executable to be processed
Task is realized by circulation searching time interval storage unit corresponding with waiting task, is deposited if finding time interval for the first time
The required time interval stored in storage unit is already expired, then will waiting task conduct corresponding with the time interval storage unit
Next executable waiting task.
Further preferably, the time interval stored in the time interval storage unit it is every executed it is corresponding to
Behind a subtask in processing task, carried out more by the prefixed time interval between the subtask and next subtask
Newly.
Further preferably, the multitasking system of the single-threaded processor further includes priority setting unit, is used for
Priority is set for each waiting task, wherein when waiting task execution unit circulation searching is corresponding with waiting task
Between interval storage unit be from time interval storage unit corresponding with the high waiting task of priority to low with priority
The corresponding time interval storage unit of waiting task circuits sequentially lookup.
The multi-task processing method and processing system of single-threaded processor provided by the invention, each waiting task is existed
In the presence of being delayed or the position of external information being waited to be split, waiting task is set to be split into multiple subtasks, in every execution
Behind a complete subtask, all by the next executable waiting task of circulation searching from waiting task and execute therein
Subtask so recycles, until having executed all waiting tasks, during being somebody's turn to do, avoids the free time of processor.
The multi-task processing method of single-threaded processor provided by the invention effectively increases the utilization rate of processor, together
When, processing speed time for improving the real-time of all tasks, shortening task.
Detailed description of the invention
With reference to the accompanying drawing and embodiment the present invention is described in further detail:
Fig. 1 is the flow chart of the multi-task processing method of single-threaded processor provided by the invention；
Fig. 2 is the partial process view of S2；
Fig. 3 is the partial process view of S21.
Specific embodiment
The present invention is further explained below in conjunction with specific embodiment, but the not limitation present invention.
As shown in Figure 1, the present invention provides a kind of multi-task processing method of single-threaded processor, it is more for being alternately performed
A waiting task, includes the following steps:
S1: respectively splitting each waiting task, obtains and each waiting task multiple sons correspondingly
Task, meanwhile, preset the time interval between adjacent subtask, wherein the fractionation position selection of each waiting task is being prolonged
When or wait external information position；
Wherein, the fractionation of waiting task can be carried out in programming, in programming process, delay will be present or wait external
The position of information as split point, meanwhile, preset the time interval between adjacent subtask, the time interval table of adjacent subtask
Show needed after having executed current subtask by how long after can just continue to execute next subtask, wherein it is each to be processed
Time interval between each adjacent subtask of task can be the same or different, and can rule of thumb set interval.
S2: being alternately performed each waiting task, until having handled all waiting tasks, wherein every to have executed one
Behind a subtask in waiting task, the next executable waiting task of circulation searching, if finding, executing should be to
Pending subtask in processing task.
The multi-task processing method of the single-threaded processor believes each waiting task in the presence of delay or outside waiting
The position of breath is split, and waiting task is made to be split into multiple subtasks, it is every executed a subtask after, all will be from
The next executable waiting task of circulation searching and subtask therein is executed in waiting task, so recycled, until
All waiting tasks have been executed, during being somebody's turn to do, have avoided the free time of processor.
As the improvement of technical solution, as shown in Fig. 2, having executed a subtask in a waiting task in S2
Afterwards, the next executable waiting task of circulation searching, if finding, the pending son executed in the waiting task is appointed
The step of business, is as follows:
S21: after having executed a subtask in a waiting task, in all waiting tasks under circulation searching
One executable waiting task, into S22, if not finding, repeats the step if finding；
S22: the execution of waiting task last time is searched from execution position memory corresponding with the waiting task
The position arrived, and execute first pending subtask behind the position.
It can recorde the execution position of corresponding waiting task by execution position memory.
As the improvement of technical solution, circulation searching is next executable wait locate in all waiting tasks in S21
Reason task, if finding, into S22, if not finding, the step of repeating the step, is as follows:
S211: setting and the one-to-one time interval storage unit of waiting task, wherein time interval storage unit
Time interval needed for middle storage executes next subtask inside corresponding waiting task；
S212: circulation searching time interval storage unit corresponding with waiting task, if finding time interval for the first time
The required time interval stored in storage unit is already expired, then makees waiting task corresponding with the time interval storage unit
For next executable waiting task, and enters S22 and repeat the step if not finding.
Wherein, next executable waiting task determines that circulation is looked by whether reaching executable time interval
Time interval corresponding with each waiting task is looked for, is already expired if finding time interval, illustrates that the task can be held immediately
Row, then be immediately performed the task, wherein the related data in each waiting task implementation procedure can be deposited by corresponding
Reservoir is stored, and when executing the task again, required data are obtained from corresponding memory.
As the improvement of technical solution, the time interval that is stored in the time interval storage unit it is every executed and its
Behind a subtask in corresponding waiting task, pass through the prefixed time interval between the subtask and next subtask
It is updated.
As the improvement of technical solution, further include the steps that priority is arranged for each waiting task before S21, priority is got over
Height shows that the task is more urgent, need to preferentially execute, then, circulation searching time interval corresponding with waiting task in S212
Be then during storage unit from time interval storage unit corresponding with the high waiting task of priority to priority
The corresponding time interval storage unit of low waiting task circuits sequentially lookup, in order to guarantee the processing of each waiting task
Progress, in the case where being not provided with priority, the process of circulation searching time interval storage unit corresponding with waiting task
In be then from time interval storage unit corresponding with the waiting task lacked by lookup number to by search often to
The corresponding time interval storage unit of processing task circuits sequentially lookup.
It is multiple to be processed for being alternately performed the present invention also provides a kind of multitasking system of single-threaded processor
Task, comprising:
Waiting task split cells: respectively splitting each waiting task, obtains and each waiting task
One-to-one multiple subtasks, wherein the position selection that splits of each waiting task is being delayed or is waiting external information
Position, wherein the fractionation of waiting task can be carried out in programming, in programming process, delay will be present or wait external letter
The position of breath is as split point；
Time interval setting unit: for presetting the time interval in each waiting task between adjacent subtask,
In, the expression of the time interval of adjacent subtask executed need behind current subtask by how long after can just continue to execute this to
Next subtask in processing task, wherein the time interval between each adjacent subtask of each waiting task can
It can also be different, can rule of thumb set interval with identical；
Waiting task execution unit: for being alternately performed each waiting task, up to having handled to be handled of institute
Business, wherein behind every subtask executed in a waiting task, circulation searching next executable to be processed
Business, if finding, executes the pending subtask in the waiting task.
The multitasking system of the single-threaded processor believes each waiting task in the presence of delay or outside waiting
The position of breath is split, and waiting task is made to be split into multiple subtasks, it is every executed a subtask after, all will be from
The next executable waiting task of circulation searching and subtask therein is executed in waiting task, so recycled, until
All waiting tasks have been executed, during being somebody's turn to do, have avoided the free time of processor.
As the improvement of technical solution, the multitasking system of the single-threaded processor further includes and waiting task
One-to-one execution position storage unit, for storing the position that the waiting task last time goes to, waiting task
Execution unit is gone to by the last time stored in execution position storage unit corresponding with executable waiting task every time
Position after first pending subtask start to execute.
As the improvement of technical solution, the multitasking system of the single-threaded processor further includes and waiting task
One-to-one time interval storage unit, wherein storage executes corresponding to be processed in time interval storage unit
Time interval needed for next subtask inside business, wherein waiting task execution unit circulation searching is next executable
Waiting task by circulation searching corresponding with waiting task time interval storage unit realization, if find for the first time
Between be spaced the required time interval that stores in storage unit and be already expired, then will be corresponding to be processed with the time interval storage unit
Task is as next executable waiting task.
Wherein, next executable waiting task determines by whether reaching executable time interval, circulation from
Time interval is searched in time interval storage unit corresponding with each waiting task, is already expired if finding time interval,
Illustrate that the task can be immediately performed, be then immediately performed the task, wherein the dependency number in each waiting task implementation procedure
It is stored according to the memory that can pass through corresponding, when executing the task again, required data are from corresponding storage
It is obtained in device.
As the improvement of technical solution, the time interval that is stored in the time interval storage unit it is every executed and its
Behind a subtask in corresponding waiting task, pass through the prefixed time interval between the subtask and next subtask
It is updated.
As the improvement of technical solution, the multitasking system of the single-threaded processor further includes that priority setting is single
Member, for priority to be arranged for each waiting task, priority is higher, shows that the task is more urgent, need to preferentially execute, wherein
Waiting task execution unit circulation searching time interval storage unit corresponding with waiting task is by high with priority
The corresponding time interval storage unit of waiting task stores single to time interval corresponding with the low waiting task of priority
Member circuits sequentially lookup, and in order to guarantee the processing progress of each waiting task, in the case where being not provided with priority, circulation is looked into
Be then during looking for time interval storage unit corresponding with waiting task by with the waiting task that is lacked by lookup number
Corresponding time interval storage unit to time interval storage unit corresponding with waiting task often is searched successively
Circulation searching.
A specific embodiment of the invention is write according to progressive mode, and each embodiment is highlighted
Difference, similar portion can be with cross-reference.
Embodiments of the present invention are elaborated above in conjunction with attached drawing, but the present invention is not limited to above-mentioned implementations
Mode within the knowledge of a person skilled in the art can also be without departing from the purpose of the present invention
Various changes can be made.
Claims (10)
1. the multi-task processing method of single-threaded processor, for being alternately performed multiple waiting tasks, which is characterized in that including
Following steps:
S1: respectively splitting each waiting task, obtain with each waiting task multiple subtasks correspondingly,
Meanwhile presetting the time interval between adjacent subtask, wherein the fractionation position selection of each waiting task is being delayed or is waiting
Position to external information；
S2: being alternately performed each waiting task, until having handled all waiting tasks, wherein every to have executed one wait locate
Behind a subtask in reason task, it is to be processed to execute this if finding for the next executable waiting task of circulation searching
Pending subtask in task.
2. according to the multi-task processing method of single-threaded processor described in claim 1, it is characterised in that: in S2, executed one
Behind a subtask in a waiting task, the next executable waiting task of circulation searching, if finding, executing should
The step of pending subtask in waiting task, is as follows:
S21: after having executed a subtask in a waiting task, circulation searching is next in all waiting tasks
Executable waiting task, into S22, if not finding, repeats the step if finding；
S22: search what the waiting task last time went to from execution position memory corresponding with the waiting task
Position, and execute first pending subtask behind the position.
3. according to the multi-task processing method of single-threaded processor described in claim 2, it is characterised in that: needed in S21
The next executable waiting task of circulation searching in processing task, into S22, if not finding, repeats this if finding
The step of step, is as follows:
S211: setting and the one-to-one time interval storage unit of waiting task, wherein deposited in time interval storage unit
Time interval needed for storage executes next subtask inside corresponding waiting task；
S212: circulation searching time interval storage unit corresponding with waiting task, if finding time interval storage for the first time
The required time interval stored in unit is already expired, then will be under corresponding with time interval storage unit waiting task is used as
One executable waiting task, and enter S22 and repeat the step if not finding.
4. according to the multi-task processing method of single-threaded processor described in claim 3, it is characterised in that: the time interval is deposited
The time interval stored in storage unit passes through the son behind every subtask executed in corresponding waiting task
Prefixed time interval between task and next subtask is updated.
5. according to the multi-task processing method of single-threaded processor described in claim 3, it is characterised in that: further include before S21 for
The step of each waiting task setting priority, then circulation searching time interval storage corresponding with waiting task is single in S212
Member is from time interval storage unit corresponding with the high waiting task of priority to the waiting task pair low with priority
The time interval storage unit answered circuits sequentially lookup.
6. the multitasking system of single-threaded processor, for being alternately performed multiple waiting tasks, which is characterized in that packet
It includes:
Waiting task split cells: respectively splitting each waiting task, obtains with each waiting task one by one
Corresponding multiple subtasks, wherein each waiting task splits position selection in the position for being delayed or waiting external information；
Time interval setting unit: for presetting the time interval in each waiting task between adjacent subtask；
Waiting task execution unit: for being alternately performed each waiting task, until all waiting tasks have been handled,
In, behind every subtask executed in a waiting task, the next executable waiting task of circulation searching, if
It finds, then executes the pending subtask in the waiting task.
7. according to the multitasking system of single-threaded processor described in claim 6, it is characterised in that: further include with it is to be processed
The one-to-one execution position storage unit of task, it is to be processed for storing the position that the waiting task last time goes to
Task executing units are held by the last time stored in execution position storage unit corresponding with executable waiting task every time
First pending subtask behind the position gone starts to execute.
8. according to the multitasking system of single-threaded processor described in claim 6, it is characterised in that: further include with it is to be processed
The one-to-one time interval storage unit of task, wherein storage executes corresponding wait locate in time interval storage unit
Time interval needed for next subtask inside reason task, wherein waiting task execution unit circulation searching is next can
The waiting task of execution is realized by circulation searching time interval storage unit corresponding with waiting task, if searching for the first time
The required time interval stored into time interval storage unit is already expired, then will it is corresponding with the time interval storage unit to
Processing task is as next executable waiting task.
9. according to the multitasking system of single-threaded processor described in claim 8, it is characterised in that: the time interval is deposited
The time interval stored in storage unit passes through the son behind every subtask executed in corresponding waiting task
Prefixed time interval between task and next subtask is updated.
10. according to the multitasking system of single-threaded processor described in claim 8, it is characterised in that: further include priority
Setting unit, for for each waiting task be arranged priority, wherein waiting task execution unit circulation searching with it is to be processed
The corresponding time interval storage unit of task be from time interval storage unit corresponding with the high waiting task of priority to
Time interval storage unit corresponding with the low waiting task of priority circuits sequentially lookup.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201811553868.9A CN109710390B (en) | 2018-12-19 | 2018-12-19 | Multi-task processing method and system of single-thread processor |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201811553868.9A CN109710390B (en) | 2018-12-19 | 2018-12-19 | Multi-task processing method and system of single-thread processor |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN109710390A true CN109710390A (en) | 2019-05-03 |
| CN109710390B CN109710390B (en) | 2020-08-04 |
Family
ID=66256951
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201811553868.9A Active CN109710390B (en) | 2018-12-19 | 2018-12-19 | Multi-task processing method and system of single-thread processor |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN109710390B (en) |
Cited By (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN116225666A (en) * | 2023-05-06 | 2023-06-06 | 中国第一汽车股份有限公司 | Task scheduling method and device for operating system, electronic equipment and storage medium |
Citations (6)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| EP1727039A1 (en) * | 2005-05-27 | 2006-11-29 | Tse-Win Lo | A method for executing a graphic program using asymmetric linkages and an asynchronous procedure |
| CN102455933A (en) * | 2010-10-22 | 2012-05-16 | 深圳市科陆电子科技股份有限公司 | Method for increasing multi-tasking efficiency through thread management |
| CN102467415A (en) * | 2010-11-03 | 2012-05-23 | 大唐移动通信设备有限公司 | Service facade task processing method and equipment |
| CN103605498A (en) * | 2013-12-05 | 2014-02-26 | 用友软件股份有限公司 | Method and system for multi-thread execution of single-thread task |
| CN103970592A (en) * | 2013-01-25 | 2014-08-06 | 深圳市金证科技股份有限公司 | Single-thread multi-task processing method and server of transaction middleware |
| CN104699542A (en) * | 2015-03-31 | 2015-06-10 | 北京奇艺世纪科技有限公司 | Task processing method and system |
-
2018
- 2018-12-19 CN CN201811553868.9A patent/CN109710390B/en active Active
Patent Citations (6)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| EP1727039A1 (en) * | 2005-05-27 | 2006-11-29 | Tse-Win Lo | A method for executing a graphic program using asymmetric linkages and an asynchronous procedure |
| CN102455933A (en) * | 2010-10-22 | 2012-05-16 | 深圳市科陆电子科技股份有限公司 | Method for increasing multi-tasking efficiency through thread management |
| CN102467415A (en) * | 2010-11-03 | 2012-05-23 | 大唐移动通信设备有限公司 | Service facade task processing method and equipment |
| CN103970592A (en) * | 2013-01-25 | 2014-08-06 | 深圳市金证科技股份有限公司 | Single-thread multi-task processing method and server of transaction middleware |
| CN103605498A (en) * | 2013-12-05 | 2014-02-26 | 用友软件股份有限公司 | Method and system for multi-thread execution of single-thread task |
| CN104699542A (en) * | 2015-03-31 | 2015-06-10 | 北京奇艺世纪科技有限公司 | Task processing method and system |
Cited By (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN116225666A (en) * | 2023-05-06 | 2023-06-06 | 中国第一汽车股份有限公司 | Task scheduling method and device for operating system, electronic equipment and storage medium |
| CN116225666B (en) * | 2023-05-06 | 2023-08-15 | 中国第一汽车股份有限公司 | Task scheduling method and device for operating system, electronic equipment and storage medium |
Also Published As
| Publication number | Publication date |
|---|---|
| CN109710390B (en) | 2020-08-04 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| US7559062B2 (en) | Intelligent scheduler for multi-level exhaustive scheduling | |
| US7316017B1 (en) | System and method for allocatiing communications to processors and rescheduling processes in a multiprocessor system | |
| Tan et al. | Coupling task progress for mapreduce resource-aware scheduling | |
| JP4694595B2 (en) | Sleep queue management | |
| Blaß et al. | A ROS 2 response-time analysis exploiting starvation freedom and execution-time variance | |
| CN106569887B (en) | Fine-grained task scheduling method in cloud environment | |
| CN113535367A (en) | Task scheduling method and related device | |
| CN109033814B (en) | Intelligent contract triggering method, device, equipment and storage medium | |
| CN114168305A (en) | Task scheduling method, device, equipment and storage medium | |
| CN107977275B (en) | Task processing method based on message queue and related equipment | |
| CN112199180A (en) | Multitask scheduling method and device, electronic equipment and readable storage medium | |
| CN109710390A (en) | The multi-task processing method and processing system of single-threaded processor | |
| CN113268331A (en) | Robot calling method, robot calling device, management system and storage medium | |
| CN111158875B (en) | Multi-module-based multi-task processing method, device and system | |
| CN106534312B (en) | A kind of service request selection of facing mobile apparatus and dispatching method | |
| EP2840513B1 (en) | Dynamic task prioritization for in-memory databases | |
| Teng et al. | Scheduling real-time workflow on MapReduce-based cloud | |
| CN108509264A (en) | Overtime task dispatches system and method | |
| Mostafa | Proportional weighted round robin: A proportional share CPU scheduler in time sharing systems | |
| Srujana et al. | Sorted round robin algorithm | |
| Carroll et al. | Selfish multi-user task scheduling | |
| Kelefouras et al. | Workflow simulation aware and multi-threading effective task scheduling for heterogeneous computing | |
| KR19990050550A (en) | Real-Time Task Scheduling Method | |
| WO1992003794A1 (en) | Dual level scheduling of processes | |
| JPH11249917A (en) | Parallel computers, their batch processing method, and storage medium |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| PB01 | Publication | ||
| PB01 | Publication | ||
| SE01 | Entry into force of request for substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| GR01 | Patent grant | ||
| GR01 | Patent grant |