CN106293918A - A kind of dispatch the method for process, system and computer - Google Patents
A kind of dispatch the method for process, system and computer Download PDFInfo
- Publication number
- CN106293918A CN106293918A CN201610657757.7A CN201610657757A CN106293918A CN 106293918 A CN106293918 A CN 106293918A CN 201610657757 A CN201610657757 A CN 201610657757A CN 106293918 A CN106293918 A CN 106293918A
- Authority
- CN
- China
- Prior art keywords
- priority
- groups
- query
- queue
- priority query
- 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.)
- Pending
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/4843—Task transfer initiation or dispatching by program, e.g. task dispatcher, supervisor, operating system
- G06F9/4881—Scheduling strategies for dispatcher, e.g. round robin, multi-level priority queues
Landscapes
- Engineering & Computer Science (AREA)
- Software Systems (AREA)
- Theoretical Computer Science (AREA)
- Physics & Mathematics (AREA)
- General Engineering & Computer Science (AREA)
- General Physics & Mathematics (AREA)
- Information Retrieval, Db Structures And Fs Structures Therefor (AREA)
Abstract
The invention discloses a kind of method dispatching process, including: intrasystem process is assigned in the priority groups of correspondence according to process task classification；Process in each described priority groups is assigned in the priority query of correspondence according to the deadline of each process；Wherein, in described priority query, process is ranked from small to large according to the deadline of each process；Each described priority groups is dispatched successively according to the priority order from high in the end of each described priority groups, and priority order from high in the end according to priority query dispatches each priority query successively in each described priority groups, the process in each priority query is according to Queue sequence successively management and running；The method has preferably taken into account the fairness of process scheduling and the real-time of scheduling；The invention discloses a kind of system dispatching process and computer, there is the effect above.
Description
Technical field
The present invention relates to field of computer technology, dispatch the method for process, system and computer particularly to a kind of.
Background technology
Along with the development of linux operating system, systematic difference scene is more and more extensive, and different scenes is for IO speed
Degree, there is different requirements the process switching time, and therefore for different application scenarios, the demand of its process scheduling is different
, need to take into account the real-time of the fairness of process and scheduling.Therefore, how while pursuing interactive task response speed,
Better ensure that the fairness of process scheduling, thus improve the Whole Response speed of system, be that those skilled in the art need to solve
Technical problem certainly.
Summary of the invention
It is an object of the invention to provide a kind of method dispatching process, the method is pursuing the same of interactive task response speed
Time, better ensure that the fairness of process scheduling, thus improve the Whole Response speed of system；It is another object of the present invention to carry
For a kind of system dispatching process and computer.
For solving above-mentioned technical problem, the present invention provides a kind of method dispatching process, including:
Intrasystem process is assigned in the priority groups of correspondence according to process task classification；
Process in each described priority groups is assigned in the priority query of correspondence according to the deadline of each process；
Wherein, in described priority query, process is ranked from small to large according to the deadline of each process；
Each described priority groups is dispatched successively according to the priority order from high in the end of each described priority groups, and respectively
Dispatch each priority query successively according to the priority order from high in the end of priority query in described priority groups, each preferentially
Process in level queue is according to Queue sequence successively management and running.
Wherein, also include: the priority query for specifying arranges Queue time sheet；Then the priority query specified according to
When Queue sequence starts to dispatch process, corresponding Queue time sheet starts timing, when Queue time sheet reaches the scheduled time, refers to
When there is off-duty process in fixed priority query, off-duty process joined than the priority query specified is excellent
In the priority query of the first low one-level of level.
Wherein, off-duty process is joined the priority query of one-level lower than the priority of the priority query specified
In, including:
Off-duty process is joined the team of the priority query of one-level lower than the priority of the priority query specified
Tail.
Wherein, when the Priority Queuing process of one-level lower than the priority of the priority query specified, according to row
Team's order management and running successively, and judge whether that off-duty process arrives fortune according to the deadline of off-duty process
The row time, if existing, then priority scheduling is run and is arrived operation time off-duty process.
Wherein, intrasystem process is assigned in the priority groups of correspondence according to process task classification, including:
Intrasystem process is assigned in the priority groups of correspondence according to process task classification；Wherein, described priority
Group is that real-time task priority groups, interactive task priority groups, common task are excellent according to priority order from high in the end successively
First level group and idle task priority groups.
The present invention also provides for a kind of system dispatching process, including:
Divide priority groups module, for intrasystem process to be assigned to the priority groups of correspondence according to process task classification
In；
Divide priority query's module, for the process in each described priority groups being distributed according to the deadline of each process
In corresponding priority query；Wherein, in described priority query, process is entered from small to large according to the deadline of each process
Row is queued up；
Scheduler module, is used for the order from high in the end of the priority according to each described priority groups and dispatches each described excellent successively
First level group, and in each described priority groups according to the priority order from high in the end of priority query dispatch successively each preferentially
Level queue, the process in each priority query is according to Queue sequence successively management and running.
Wherein, also include:
Queue time sheet arranges module, arranges Queue time sheet for the priority query for specifying；
Described scheduler module includes:
Judging unit, is used for when the priority query specified starts to dispatch process according to Queue sequence, corresponding queue
Timeslice starts timing, when Queue time sheet reaches the scheduled time, it is intended that priority query in whether exist off-duty
Process；
Fall priority unit, if for there is off-duty process, joining more preferential than specify by off-duty process
In the priority query of the low one-level of priority of level queue.
Wherein, described fall priority unit is specially off-duty process joined than the priority query specified excellent
The unit of the tail of the queue of the priority query of the first low one-level of level.
Wherein, described point of priority groups module specifically includes 4 priority groups, described priority groups according to priority from height
Order on earth is real-time task priority groups, interactive task priority groups, common task priority groups and idle task successively
Priority groups.
The present invention also provides for a kind of computer, including: according to the system of the scheduling process described in any of the above-described item.
The method of scheduling process provided by the present invention, including: intrasystem process is distributed according to process task classification
In corresponding priority groups；Process in each described priority groups is assigned to the excellent of correspondence according to the deadline of each process
In first level queue；Wherein, in described priority query, process is ranked from small to large according to the deadline of each process；According to
The priority of each described priority groups order from high in the end dispatches each described priority groups successively, and in each described priority groups
The interior priority according to priority query order from high in the end dispatches each priority query, entering in each priority query successively
Journey is according to Queue sequence successively management and running；
Visible, the method, while pursuing interactive task response speed, better ensures that the fairness of process scheduling, from
And improve the Whole Response speed of system；Present invention also offers a kind of system dispatching process and computer, having above-mentioned has
Benefit effect, does not repeats them here.
Accompanying drawing explanation
In order to be illustrated more clearly that the embodiment of the present invention or technical scheme of the prior art, below will be to embodiment or existing
In having technology to describe, the required accompanying drawing used is briefly described, it should be apparent that, the accompanying drawing in describing below is only this
Inventive embodiment, for those of ordinary skill in the art, on the premise of not paying creative work, it is also possible to according to
The accompanying drawing provided obtains other accompanying drawing.
The flow chart of the method for the scheduling process that Fig. 1 is provided by the embodiment of the present invention；
The schematic diagram of process is dispatched in the priority groups that Fig. 2 is provided by the embodiment of the present invention；
The schematic diagram of process is dispatched in the priority query that Fig. 3 is provided by the embodiment of the present invention；
The structured flowchart of the system of the scheduling process that Fig. 4 is provided by the embodiment of the present invention.
Detailed description of the invention
The core of the present invention is to provide a kind of method dispatching process, and the method is pursuing the same of interactive task response speed
Time, better ensure that the fairness of process scheduling, thus improve the Whole Response speed of system；Another core of the present invention is to carry
For a kind of system dispatching process and computer.
For making the purpose of the embodiment of the present invention, technical scheme and advantage clearer, below in conjunction with the embodiment of the present invention
In accompanying drawing, the technical scheme in the embodiment of the present invention is clearly and completely described, it is clear that described embodiment is
The a part of embodiment of the present invention rather than whole embodiments.Based on the embodiment in the present invention, those of ordinary skill in the art
The every other embodiment obtained under not making creative work premise, broadly falls into the scope of protection of the invention.
Refer to the flow chart of the method for the scheduling process that Fig. 1, Fig. 1 are provided by the embodiment of the present invention；The method is permissible
Including:
S100, by intrasystem process according to process task classification be assigned to correspondence priority groups in；
Wherein, number and the setting of priority groups can be configured according to process task classification, such as real-time task class
Type, idle task type etc., it is respectively provided with priority for the priority groups arranged, dispatches according to priority excellent the most successively
Process in first level group；Therefore, the quality that arranges of priority groups directly affects the fairness of process scheduling and the real-time of scheduling.
4 priority groups, respectively real-time task priority groups realtime, interactive task priority groups generally can be set
SCHED_IO, common task priority groups SCHED_NORMAL, idle task priority groups SCHED_IDEL, and priority groups presses
It is real-time task priority groups, interactive task priority groups, common task priority successively according to priority order from high in the end
Group and idle task priority groups.
Priority groups is i.e. set and is referred to as group, and priority, scheduler module or scheduler are set for each priority groups
Preferentially from the group of high priority, choose process to dispatch.In group, process is scheduling, in order as in figure 2 it is shown, here may be used
To arrange group timeslice, the size of group timeslice determined according to the process scheduling operation time in group.
S110, by the process in each described priority groups according to the deadline of each process be assigned to correspondence priority team
In row；Wherein, in described priority query, process is ranked from small to large according to the deadline of each process；
S120, dispatch each described priority groups successively according to the priority order from high in the end of each described priority groups,
And priority order from high in the end according to priority query dispatches each priority query successively in each described priority groups,
Process in each priority query is according to Queue sequence successively management and running.
Wherein, due to the process in each priority groups also at least 1, entering in the most each priority groups
Journey has multiple, and the significance level of the process in same priority groups also not exclusively as, accordingly, it would be desirable to be each priority
The priority query that component pairing is answered is called for short queue, and the significance level of the process in each priority query is similar to.The most each
The number of the priority query in priority groups can unanimously can also be inconsistent, be determined according to the practical situation of user.
Here priority query divides and can divide according to the sequencing of deadline time period.Each priority query has
Having the priority of oneself, the setting of priority here can determine according to deadline.Such as each priority groups is divided
Being 10 priority queries, the priority of these 10 priority queries sets according to deadline time period sequencing from high to low
Fixed, the deadline time of the priority query that i.e. priority is the highest is the nearest, most starts to dispatch this priority in i.e. this preferential group
Queue, the deadline time of the priority query that priority is minimum is the most remote, the most finally dispatches.
Detailed process: carry out organizing interior scheduling, sets predetermined number (such as 10) individual priority query, each priority team in group
The process of priority scheduling high priority in row.Process priority height calculates according to the deadline of process.Deadline is the least
Then task is the most urgent, so a higher priority can be calculated.The process of same priority wait in queue time
Between the most long, it from deadline more close to, if therefore a process is not the most dispatched, its priority will carry
High.Thus ensure that task time, sheet can dynamically adjust, it is ensured that while task fairness, preferentially complete the task of being down to the wire.
Predetermined number (such as 10) individual priority is set in each group.Deadline according to process is divided in different priority, when
There is the process waiting time long, priority can be promoted.Process will join by component partition, dispatch different priority from high to low
Group, in group, then deadline according to process dispatches, i.e. polling dispatching successively in queue.
Illustrating said process: if the method is divided into 4 groups, each group of 10 queue queue again, then process one is divided into
Being 40 queue, the corresponding different priority of each queue, each priority has a queue queue, is used for storing same
All processes of priority.It is right in each queue correspondence bitmap that the state of all of queue is mapped on a bitmap
, as long as there is the process that can be scheduled in the position answered, then the position on corresponding bitmap just puts 1 in queue.Scheduler travels through
All queue putting 1 are scheduling by bitmap.By traversal bitmap, queue scheduling order first can be guided, secondly
It is possible to prevent occur that process is omitted；Improve system reliability.
Based on technique scheme, the method for the scheduling process that the embodiment of the present invention provides, interactive task can pursued
While response speed, better ensure that the fairness of process scheduling, thus improve the Whole Response speed of system.
Based on technique scheme, in order to be further ensured that fairness and the response speed of process scheduling, can be to specify
Priority query Queue time sheet is set；Then when the priority query specified starts to dispatch process according to Queue sequence, right
The Queue time sheet answered starts timing, when Queue time sheet reaches the scheduled time, it is intended that priority query in exist and do not transport
During the process gone, off-duty process is joined the priority query of one-level lower than the priority of the priority query specified
In.The i.e. task of same priority enters a queue, and queue has the timeslice of oneself, and timeslice is finished, and remaining task drops
Low priority is to next queue.
Wherein, Queue time sheet here can be that each priority query is configured, it is also possible to specifies for user
Priority query be set, such as when exist 4 priority groups, during Mei Zu Nei You10Ge priority query, for each excellent
The priority query of the priority row front 9 in first level group arranges Queue time sheet.Concrete facilities is according to user's actual need
It is determined.
Here Queue time sheet plays the effect of timing, the most each Priority Queuing being provided with Queue time sheet
The time of operation process not can exceed that Queue time leaf length.Concrete timing can be carried out according to addition or subtractive way, example
Such as subtractive way particularly as follows: specify queue to have a Queue time sheet queue_time, in queue, process scheduling is once,
Queue_time can reduce accordingly.If after queu_time is kept to 0, queue also have process be not carried out, then will be remaining
Process priority decline, thus ensure that high-priority task will not take the too many time, thus allow high priority process and low
Priority process fair competition, improves fairness.
Crossing of concrete degradation can be called to join lower than the priority of the priority query specified by off-duty process
The tail of the queue of the priority query of one-level；As it is shown on figure 3, the process being not carried out in queue1 adds the tail of the queue in queue2 to,
I.e. queue2 first dispatches original process in queue2 when dispatching process, finally according still further to the sequential scheduling of the off-duty process added
The process being added.
The most it is not performed when deadline, the most generally according to Queue sequence further for avoiding the process added
Management and running successively and it needs to judge whether that off-duty process arrives according to the deadline of off-duty process in real time
The operation time, i.e. judge whether interpolation process there are the fast process arriving deadline and be also not carried out, if existing, the most excellent
First management and running arrive operation time off-duty process；After this process scheduling is complete, proceed according still further to order before
Scheduling.
System and computer that embodiment of the present invention offer is dispatched process below are introduced, scheduling described below
The method of the system of process and computer and above-described scheduling process can be mutually to should refer to.
Refer to the structured flowchart of the system of the scheduling process that Fig. 4, Fig. 4 are provided by the embodiment of the present invention；This system can
To include:
Divide priority groups module 100, for intrasystem process is assigned to the preferential of correspondence according to process task classification
In level group；
Point priority query's module 200, for by the process in each described priority groups according to the deadline of each process
It is assigned in the priority query of correspondence；Wherein, in described priority query process according to each process deadline from little to
Rank greatly；
Scheduler module 300, is used for the order from high in the end of the priority according to each described priority groups and dispatches each institute successively
State priority groups, and priority order from high in the end according to priority query is dispatched respectively successively in each described priority groups
Priority query, the process in each priority query is according to Queue sequence successively management and running.Scheduler module 300 can be specially
Scheduler.
Based on technique scheme, this system also includes:
Queue time sheet arranges module, arranges Queue time sheet for the priority query for specifying；
Described scheduler module 300 includes:
Judging unit, is used for when the priority query specified starts to dispatch process according to Queue sequence, corresponding queue
Timeslice starts timing, when Queue time sheet reaches the scheduled time, it is intended that priority query in whether exist off-duty
Process；
Fall priority unit, if for there is off-duty process, joining more preferential than specify by off-duty process
In the priority query of the low one-level of priority of level queue.
Optionally, described fall priority unit is specially and joins off-duty process than the priority query specified
The unit of the tail of the queue of the priority query of the low one-level of priority.
Optionally, described point of priority groups module 100 specifically includes 4 priority groups, and described priority groups is according to preferentially
Level order from high in the end is real-time task priority groups, interactive task priority groups, common task priority groups and sky successively
Not busy task priority group.
The present invention also provides for a kind of computer, including: according to the system of the scheduling process described in any of the above-described item.
In description, each embodiment uses the mode gone forward one by one to describe, and what each embodiment stressed is real with other
Executing the difference of example, between each embodiment, identical similar portion sees mutually.For device disclosed in embodiment
Speech, owing to it corresponds to the method disclosed in Example, so describe is fairly simple, relevant part sees method part explanation
?.
Professional further appreciates that, in conjunction with the unit of each example that the embodiments described herein describes
And algorithm steps, it is possible to electronic hardware, computer software or the two be implemented in combination in, in order to clearly demonstrate hardware and
The interchangeability of software, the most generally describes composition and the step of each example according to function.These
Function performs with hardware or software mode actually, depends on application-specific and the design constraint of technical scheme.Specialty
Technical staff specifically should can be used for using different methods to realize described function to each, but this realization should not
Think beyond the scope of this invention.
The method described in conjunction with the embodiments described herein or the step of algorithm can direct hardware, processor be held
The software module of row, or the combination of the two implements.Software module can be placed in random access memory (RAM), internal memory, read-only deposit
Reservoir (ROM), electrically programmable ROM, electrically erasable ROM, depositor, hard disk, moveable magnetic disc, CD-ROM or technology
In any other form of storage medium well known in field.
Above method, system and the computer of scheduling process provided by the present invention is described in detail.Herein
Applying specific case to be set forth principle and the embodiment of the present invention, the explanation of above example is only intended to help
Understand method and the core concept thereof of the present invention.It should be pointed out that, for those skilled in the art, do not taking off
On the premise of the principle of the invention, it is also possible to the present invention is carried out some improvement and modification, these improve and modification also falls into this
In invention scope of the claims.
Claims (10)
1. the method dispatching process, it is characterised in that including:
Intrasystem process is assigned in the priority groups of correspondence according to process task classification；
Process in each described priority groups is assigned in the priority query of correspondence according to the deadline of each process；Its
In, in described priority query, process is ranked from small to large according to the deadline of each process；
Each described priority groups is dispatched successively according to the priority order from high in the end of each described priority groups, and each described
The interior priority according to priority query of priority groups order from high in the end dispatches each priority query, each priority team successively
Process in row is according to Queue sequence successively management and running.
The method of scheduling process the most according to claim 1, it is characterised in that also include: for the priority query specified
Queue time sheet is set；Then when the priority query specified starts to dispatch process according to Queue sequence, corresponding Queue time
Sheet starts timing, when Queue time sheet reaches the scheduled time, it is intended that priority query in when there is off-duty process, will
Off-duty process joins in the priority query of one-level lower than the priority of the priority query specified.
The method of scheduling process the most according to claim 2, it is characterised in that off-duty process is joined than appointment
Priority query the low one-level of priority priority query in, including:
Off-duty process is joined the tail of the queue of the priority query of one-level lower than the priority of the priority query specified.
The method of scheduling process the most according to claim 3, it is characterised in that preferential when than the priority query specified
Level low one-level Priority Queuing process time, according to Queue sequence successively management and running, and according to off-duty process
Deadline judges whether that off-duty process arrives the operation time, if existing, then when priority scheduling is run and arrived operation
Between off-duty process.
The method of scheduling process the most according to claim 4, it is characterised in that by intrasystem process according to process task
Classification is assigned in the priority groups of correspondence, including:
Intrasystem process is assigned in the priority groups of correspondence according to process task classification；Wherein, described priority groups is pressed
It is real-time task priority groups, interactive task priority groups, common task priority successively according to priority order from high in the end
Group and idle task priority groups.
6. the system dispatching process, it is characterised in that including:
Divide priority groups module, for intrasystem process being assigned in the priority groups of correspondence according to process task classification；
Divide priority query's module, right for the process in each described priority groups is assigned to according to the deadline of each process
In the priority query answered；Wherein, in described priority query, process is arranged from small to large according to the deadline of each process
Team；
Scheduler module, is used for the order from high in the end of the priority according to each described priority groups and dispatches each described priority successively
Group, and priority order from high in the end according to priority query dispatches each priority team successively in each described priority groups
Row, the process in each priority query is according to Queue sequence successively management and running.
The system of scheduling process the most according to claim 6, it is characterised in that also include:
Queue time sheet arranges module, arranges Queue time sheet for the priority query for specifying；
Described scheduler module includes:
Judging unit, is used for when the priority query specified starts to dispatch process according to Queue sequence, corresponding Queue time
Sheet starts timing, when Queue time sheet reaches the scheduled time, it is intended that priority query in whether there is off-duty process；
Fall priority unit, if for there is off-duty process, joining off-duty process than the priority team specified
In the priority query of the low one-level of priority of row.
The system of scheduling process the most according to claim 7, it is characterised in that described fall priority unit is specially will not
The process run joins the unit of the tail of the queue of the priority query of one-level lower than the priority of the priority query specified.
The system of scheduling process the most according to claim 8, it is characterised in that described point of priority groups module specifically includes
4 priority groups, described priority groups is real-time task priority groups successively according to priority order from high in the end, appoints alternately
Business priority groups, common task priority groups and idle task priority groups.
10. a computer, it is characterised in that including: according to the system of the scheduling process described in any one of claim 6-9.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201610657757.7A CN106293918A (en) | 2016-08-11 | 2016-08-11 | A kind of dispatch the method for process, system and computer |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201610657757.7A CN106293918A (en) | 2016-08-11 | 2016-08-11 | A kind of dispatch the method for process, system and computer |
Publications (1)
| Publication Number | Publication Date |
|---|---|
| CN106293918A true CN106293918A (en) | 2017-01-04 |
Family
ID=57670214
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201610657757.7A Pending CN106293918A (en) | 2016-08-11 | 2016-08-11 | A kind of dispatch the method for process, system and computer |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN106293918A (en) |
Cited By (11)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN106874129A (en) * | 2017-02-04 | 2017-06-20 | 北京信息科技大学 | A kind of operating system process scheduling order determines method and control method |
| CN107992865A (en) * | 2018-01-26 | 2018-05-04 | 重庆邮电大学 | A kind of vehicle identification method and system based on video analysis |
| CN108762896A (en) * | 2018-03-26 | 2018-11-06 | 福建星瑞格软件有限公司 | One kind being based on Hadoop cluster tasks dispatching method and computer equipment |
| CN109067699A (en) * | 2018-06-22 | 2018-12-21 | 中国建设银行股份有限公司 | The distribution of login task executes system and method, storage medium |
| CN110457127A (en) * | 2019-08-15 | 2019-11-15 | 浙江方大智控科技有限公司 | System and method is arranged in flow of task priority-based |
| CN110941483A (en) * | 2019-10-23 | 2020-03-31 | 创达特（苏州）科技有限责任公司 | Queue processing method, device and equipment |
| CN111143045A (en) * | 2019-12-11 | 2020-05-12 | 青岛海尔科技有限公司 | Task scheduling method and device of smart home operating system and storage medium |
| CN111541623A (en) * | 2020-04-10 | 2020-08-14 | 深圳前海微众银行股份有限公司 | Data processing method and device |
| CN112368679A (en) * | 2018-07-06 | 2021-02-12 | 苹果公司 | System for scheduling threads for execution |
| CN112667369A (en) * | 2020-06-08 | 2021-04-16 | 宸芯科技有限公司 | Thread scheduling method and device, storage medium and electronic equipment |
| CN117076138A (en) * | 2023-10-17 | 2023-11-17 | 西安羚控电子科技有限公司 | System simulation-oriented resource cross-platform integration and scheduling method and device |
Citations (6)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN1517867A (en) * | 2003-01-07 | 2004-08-04 | 松下电器产业株式会社 | Process scheduling device, process ccheduling method, program and recording medium |
| CN101246437A (en) * | 2008-01-28 | 2008-08-20 | 中兴通讯股份有限公司 | Built-in real-time system course equalization scheduling method |
| CN102981973A (en) * | 2012-11-05 | 2013-03-20 | 曙光信息产业(北京)有限公司 | Method of executing requests in memory system |
| CN104991816A (en) * | 2015-06-25 | 2015-10-21 | 浪潮(北京)电子信息产业有限公司 | Process scheduling method and apparatus |
| CN105320571A (en) * | 2015-11-27 | 2016-02-10 | 浪潮(北京)电子信息产业有限公司 | Process scheduling method |
| CN106095557A (en) * | 2016-06-20 | 2016-11-09 | 浪潮(北京)电子信息产业有限公司 | The improved method of a kind of O1 dispatching algorithm and device |
-
2016
- 2016-08-11 CN CN201610657757.7A patent/CN106293918A/en active Pending
Patent Citations (6)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN1517867A (en) * | 2003-01-07 | 2004-08-04 | 松下电器产业株式会社 | Process scheduling device, process ccheduling method, program and recording medium |
| CN101246437A (en) * | 2008-01-28 | 2008-08-20 | 中兴通讯股份有限公司 | Built-in real-time system course equalization scheduling method |
| CN102981973A (en) * | 2012-11-05 | 2013-03-20 | 曙光信息产业(北京)有限公司 | Method of executing requests in memory system |
| CN104991816A (en) * | 2015-06-25 | 2015-10-21 | 浪潮(北京)电子信息产业有限公司 | Process scheduling method and apparatus |
| CN105320571A (en) * | 2015-11-27 | 2016-02-10 | 浪潮(北京)电子信息产业有限公司 | Process scheduling method |
| CN106095557A (en) * | 2016-06-20 | 2016-11-09 | 浪潮(北京)电子信息产业有限公司 | The improved method of a kind of O1 dispatching algorithm and device |
Cited By (17)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN106874129A (en) * | 2017-02-04 | 2017-06-20 | 北京信息科技大学 | A kind of operating system process scheduling order determines method and control method |
| CN106874129B (en) * | 2017-02-04 | 2020-01-10 | 北京信息科技大学 | Method for determining process scheduling sequence of operating system and control method |
| CN107992865A (en) * | 2018-01-26 | 2018-05-04 | 重庆邮电大学 | A kind of vehicle identification method and system based on video analysis |
| CN108762896A (en) * | 2018-03-26 | 2018-11-06 | 福建星瑞格软件有限公司 | One kind being based on Hadoop cluster tasks dispatching method and computer equipment |
| CN108762896B (en) * | 2018-03-26 | 2022-04-12 | 福建星瑞格软件有限公司 | Hadoop cluster-based task scheduling method and computer equipment |
| CN109067699A (en) * | 2018-06-22 | 2018-12-21 | 中国建设银行股份有限公司 | The distribution of login task executes system and method, storage medium |
| CN109067699B (en) * | 2018-06-22 | 2021-09-28 | 中国建设银行股份有限公司 | Login task distribution execution system and method, and storage medium |
| CN112368679A (en) * | 2018-07-06 | 2021-02-12 | 苹果公司 | System for scheduling threads for execution |
| CN110457127A (en) * | 2019-08-15 | 2019-11-15 | 浙江方大智控科技有限公司 | System and method is arranged in flow of task priority-based |
| CN110941483A (en) * | 2019-10-23 | 2020-03-31 | 创达特（苏州）科技有限责任公司 | Queue processing method, device and equipment |
| CN111143045A (en) * | 2019-12-11 | 2020-05-12 | 青岛海尔科技有限公司 | Task scheduling method and device of smart home operating system and storage medium |
| CN111143045B (en) * | 2019-12-11 | 2024-03-22 | 青岛海尔科技有限公司 | Task scheduling method and device of intelligent home operating system and storage medium |
| CN111541623A (en) * | 2020-04-10 | 2020-08-14 | 深圳前海微众银行股份有限公司 | Data processing method and device |
| CN111541623B (en) * | 2020-04-10 | 2022-12-06 | 深圳前海微众银行股份有限公司 | Data processing method and device |
| CN112667369A (en) * | 2020-06-08 | 2021-04-16 | 宸芯科技有限公司 | Thread scheduling method and device, storage medium and electronic equipment |
| CN117076138A (en) * | 2023-10-17 | 2023-11-17 | 西安羚控电子科技有限公司 | System simulation-oriented resource cross-platform integration and scheduling method and device |
| CN117076138B (en) * | 2023-10-17 | 2024-02-23 | 西安羚控电子科技有限公司 | System simulation-oriented resource cross-platform integration and scheduling method and device |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN106293918A (en) | A kind of dispatch the method for process, system and computer | |
| WO2017167105A1 (en) | Task-resource scheduling method and device | |
| CN105320571B (en) | A kind of process scheduling method | |
| CN110489217A (en) | A kind of method for scheduling task and system | |
| CN106155781B (en) | A kind of real-time task scheduling method in multiple agent platform | |
| CN112380020A (en) | Computing power resource allocation method, device, equipment and storage medium | |
| CN106648461A (en) | Memory management device and method | |
| CN104239154B (en) | Job scheduling method and job scheduler in a kind of Hadoop clusters | |
| CN103927225A (en) | Multi-core framework Internet information processing and optimizing method | |
| CN112506634B (en) | Fairness operation scheduling method based on reservation mechanism | |
| CN105373426B (en) | A kind of car networking memory aware real time job dispatching method based on Hadoop | |
| CN113282381B (en) | Task scheduling method, device, computer equipment and storage medium | |
| EP3495953A1 (en) | Techniques for behavioral pairing in a task assignment system | |
| CN114968566A (en) | Container scheduling method and device under shared GPU cluster | |
| CN112148454A (en) | Edge computing method supporting serial and parallel and electronic equipment | |
| CN101902487A (en) | Queue scheduling method and device based on linked list | |
| CN110336859A (en) | Task scheduling system under multi-tenant environment | |
| CN102981973A (en) | Method of executing requests in memory system | |
| CN105677744A (en) | Method and apparatus for increasing service quality in file system | |
| CN110308979A (en) | The asynchronous process frame and its implementation of task based access control scheduling | |
| CN110011936A (en) | Thread scheduling method and device based on multi-core processor | |
| CN117149388A (en) | Batch task scheduling method and system, electronic equipment and storage medium | |
| CN112199180A (en) | Multitask scheduling method and device, electronic equipment and readable storage medium | |
| CN112925616A (en) | Task allocation method and device, storage medium and electronic equipment | |
| CN102546423A (en) | Method and device for queue scheduling and network device |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| C06 | Publication | ||
| PB01 | Publication | ||
| C10 | Entry into substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| RJ01 | Rejection of invention patent application after publication | ||
| RJ01 | Rejection of invention patent application after publication |
Application publication date: 20170104 |