CN107885589A - A kind of job scheduling method and device - Google Patents
A kind of job scheduling method and device Download PDFInfo
- Publication number
- CN107885589A CN107885589A CN201711174181.XA CN201711174181A CN107885589A CN 107885589 A CN107885589 A CN 107885589A CN 201711174181 A CN201711174181 A CN 201711174181A CN 107885589 A CN107885589 A CN 107885589A
- Authority
- CN
- China
- Prior art keywords
- job
- priority
- instruction
- pending
- scheduling
- 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
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
Abstract
The present invention provides a kind of job scheduling method and device.Methods described includes：According to the priority tag pre-set, judge whether pending operation is priority job；If the pending operation is priority job, according to the preferential identification module pre-established, the instruction for performing corresponding operation is sent to the pending operation.Job scheduling method and device provided by the invention, job scheduling algorithm is intelligent, the algorithm is converted into a variety of common job scheduling algorithms by configuring, so as to meet the needs of different user job scheduling.
Description
Technical field
The present invention relates to resource configuration technology field, and in particular to a kind of job scheduling method and device.
Background technology
Can job scheduling major function be to meet the resource of user job according to information in job control block, auditing system
Demand, according to certain algorithms, some operations are chosen from the pool queue of external memory and then call in internal memory, for they create into
Journey, the necessary resource of distribution, then the process newly created is inserted into ready queue, it is ready to carry out.
Job scheduling algorithm common at present has following several：The high preferential, SJF of prerequisite variable, response ratio,
Equalized scheduling algorithm and priority scheduling algorithm.
1) prerequisite variable algorithm
The order for entering input # according to operation in principle is dispatched, if the resource of operation, which is not being met, will postpone scheduling,
Can preferentially it be scheduled into when being met etc. resource.
The advantages of this algorithm：There is certain fairness.
The shortcomings that this algorithm：Average turnaround time length, the throughput of system is low, when having big operation, many small operation meetings
Postpone scheduling.
2) time short job priority
Priority scheduling calculates time short operation, and scheduling is then postponed in the case of resource is ungratified.So require user
There is an estimation in advance to the calculating time of operation, dispatch on this basis.
The advantages of this algorithm：Due to the selected Activity Calculation time so can not complete and log off as soon as possible,
The average latency of operation is reduced, so improving the throughput of system.
The shortcomings that this algorithm：Big operation can be unsatisfied with, and under limiting case some big operations cannot be dispatched all the time.
3) the high person's priority algorithm of response ratio
Consider and calculate stand-by period time, both consider and calculate time short job priority, it is contemplated that big operation length
The problem of phase waits.Defined according to below equation：
The response ratio R=stand-by period/calculating time
The Activity Calculation time that the time is estimation is calculated, the calculating time is shorter, and response ratio is higher；On the other hand big operation etc.
Treat that the time is longer, response ratio also can be bigger.One operation is completed later, it is necessary to recalculate each operation in input
Response ratio, highest will be by priority scheduling.
4) priority number dispatching algorithm
Priority number is specified for each operation, the high operation of priority number is first scheduled.Adopted for the equal operation of priority number
Use prerequisite variable.
The formulating rules of priority number：Operation emergency program, estimation calculate time, operation stand-by period, resource bid situation
Etc. considering.
5) equalized scheduling algorithm
Performed using the process of different resource, so as to the time for reducing operation to wait same category of device and expending, accelerated simultaneously
Job execution.
Dispatching algorithm should accomplish：Operations as more as possible are run within the unit interval；Processor is set to keep busy condition；Make I/
O device sufficiently utilizes；It is fair and reasonable to all operations.
Because the different and every kind of dispatching algorithm of the demand of user job can only use one kind in one-stop operation, completion
Sequencing and whether should priority arrangement it is different, cause conventional job scheduling algorithm can not meet having for complexity
The job scheduling of greater demand, such as prerequisite variable algorithm, because some user job needs to fulfil ahead of schedule, and according to operation
Order can not meet the algorithm for preferentially completing the operation.
From the above, it can be seen that differing due to user job, such as prerequisite variable algorithm, because some should be first
The operation that processing is completed can not dispatch in time to be handled, and causes the operation to postpone scheduling, it is impossible to provide demand in time.Conventional
Job scheduling algorithm is combined overstocked with the user job feature of itself, it is impossible to which general, user job is single and short operation is in the majority can
Prerequisite variable algorithm can be selected, if having long operation in user job wherein, select prerequisite variable algorithm will
Cause the long operation to take for a long time, delay short job scheduling behind.
Therefore, a kind of method how is proposed, it is possible to increase the efficiency of the job scheduling of resource distribution, turn into urgently to be resolved hurrily
Problem.
The content of the invention
For in the prior art the defects of, the invention provides a kind of job scheduling method and device.
In a first aspect, the present invention provides a kind of job scheduling method, including：
According to the priority tag pre-set, judge whether pending operation is priority job；
If the pending operation is priority job, according to the preferential identification module pre-established, wait to hold to described
Row operation sends the instruction for performing corresponding operation.
Second aspect, the present invention provide a kind of job scheduling device, including：
Judging unit, for according to the priority tag pre-set, judging whether pending operation is priority job；
Execution unit, if being priority job for the pending operation, according to the preferential identification mould pre-established
Block, the instruction for performing corresponding operation is sent to the pending operation.
The third aspect, present invention also offers a kind of computer equipment, including memory and processor, the processor and
The memory completes mutual communication by bus；The memory storage has and can referred to by the program of the computing device
Order, the processor call described program instruction to be able to carry out following method：
According to the priority tag pre-set, judge whether pending operation is priority job；
If the pending operation is priority job, according to the preferential identification module pre-established, wait to hold to described
Row operation sends the instruction for performing corresponding operation.
Fourth aspect, present invention also offers a kind of computer program, including program code, described program code is used to hold
The following operation of row：
The processor is used to call the logical order in the memory, to perform following method：
According to the priority tag pre-set, judge whether pending operation is priority job；
If the pending operation is priority job, according to the preferential identification module pre-established, wait to hold to described
Row operation sends the instruction for performing corresponding operation.
5th aspect, the present invention provide a kind of computer-readable recording medium, are stored thereon with computer program, the calculating
Method when machine program is executed by processor for storing foregoing computer program.
Job scheduling method and device provided by the invention, by whether adding the mark of user job and whether pressing
The judgement of executive mode set in advance, the process that user job is called in is enriched, while meet the user according to different demands
Process is called in operation so that each user job can access and meet different user job dispatching requirements, reduce exploitation work
Measure, be widely used；By gradually forming the process of judgement to the process that user job is dispatched, i.e., constantly form intelligent operation
Process is called in, so as to realize that resource makes full use of and intelligentized traffic scheduling.
Brief description of the drawings
In order to illustrate more clearly about the embodiment of the present invention or technical scheme of the prior art, below will be to embodiment or existing
There is the required accompanying drawing used in technology description to be briefly described, it should be apparent that, drawings in the following description are this hairs
Some bright embodiments, for those of ordinary skill in the art, on the premise of not paying creative work, can be with root
Other accompanying drawings are obtained according to these accompanying drawings.
Fig. 1 is the schematic flow sheet of job scheduling method provided in an embodiment of the present invention；
Fig. 2 is the method flow schematic diagram for the job scheduling that further embodiment of this invention provides；
Fig. 3 is the structural representation of job scheduling device provided in an embodiment of the present invention；
Fig. 4 is the structured flowchart of computer equipment provided in an embodiment of the present invention.
Embodiment
To make the purpose, technical scheme and advantage of the embodiment of the present invention 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
Part of the 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 the premise of creative work is not made, belongs to the scope of protection of the invention.
Fig. 1 is the schematic flow sheet of job scheduling method provided in an embodiment of the present invention, as shown in figure 1, methods described bag
Include：
The priority tag that S101, basis are pre-set, judges whether pending operation is priority job；
If S102, the pending operation are priority job, according to the preferential identification module that pre-establishes, to described
Pending operation sends the instruction for performing corresponding operation.
Specifically, for the different desired user jobs of variety classes, it is necessary to carry out rational operation allotment, methods described
Including：Be in advance each mark for needing to be set priority by the operation of priority job scheduling, can according to each operation whether
Need preferentially to complete, the mark of priority is set to each operation, it is readily identified to identify the characteristics of most prominent, shows itself thing
It is engaged in feature, indicates the major function that different meaning, difference and ownership between things is mark.Priority symbol processing is done to things,
Article characteristic is shown, is advantageous to the preferential execution of job task.
When there is many tasks to perform, server needs that first the priority tag of each operation is identified, and judges
Whether first operation is priority job；
If first operation needs priority job, according to the preferential identification module pre-established, to institute
State pending operation and send the instruction for performing corresponding operation, the corresponding priority scheduling of described first Job execution operation
Perform corresponding operation.
Job scheduling method provided in an embodiment of the present invention, by whether adding the mark of user job and whether pressing
The judgement of executive mode set in advance, the process that user job is called in is enriched, while meet the user according to different demands
Process is called in operation so that each user job can access and meet different user job dispatching requirements, reduce exploitation work
Measure, be widely used；By gradually forming the process of judgement to the process that user job is dispatched, i.e., constantly form intelligent operation
Process is called in, so as to realize that resource makes full use of and intelligentized traffic scheduling.
Alternatively, the specific of the preferential identification module establishes process and is：
If the first operation is the priority job, and receives the execute instruction of first kind module, then described is judged
Whether one operation is according to the 3rd type block progress job scheduling, if so, then creating process and distributing resource；
If first operation is the priority job, and receives the execute instruction of Second Type module and asynchronously hold
The instruction of the operation of row second, then whether first operation is judged according to the 3rd type block progress job scheduling, if so, then creating
Build process and distribute resource.
On the basis of above-described embodiment, the preferential identification module pre-established is user's work for a certain type
Industry, the attribute identified by remembering passing user job, if running into same user job, can add its category automatically
Property；Method is performed for the user job preferentially completed, can equally be remembered and applied to the user job scheduling of next time, will
The executive mode record of user job each time, and counted, therefrom select the optimal of each type of user job
Executive mode, so as to constitute preferential identification module.
It is as follows specifically to establish process：
It is the mark with priority for first operation, and receives the execute instruction of first kind module, then
Whether first operation is judged according to the 3rd type block progress job scheduling, if so, then creating process and distributing resource；
If first operation is the priority job, and receives the execute instruction of Second Type module and asynchronously hold
The instruction of the operation of row second, then whether first operation is judged according to the 3rd type block progress job scheduling, if so, then creating
Build process and distribute resource.Wherein, first operation and second operation represent different operations respectively, and the second operation is
Any operation of difference and the first operation, is not specifically to limit certain operation；The first kind module, Second Type module
Different types of dispatching algorithm is represented respectively with the 3rd type block, can be any dispatching algorithm of the prior art, is had
Which kind of body represents and do not do specific restriction in embodiments of the present invention.
Specific for the preferential identification module of clearer explanation establishes process, give a concrete illustration now for
It is bright.
Fig. 2 is the method flow schematic diagram for the job scheduling that further embodiment of this invention provides, as shown in Figure 2.
First, it is determined that whether operation is priority job scheduling, if having priority tag, need further to sentence
It is disconnected；
Secondly, if being first kind module using SJF, need to further determine whether to make in sequence
Industry is that the 3rd type block is scheduled, if be scheduled using sequent modular, the further process that creates is carried out and divided
With resource；
Again, if being Second Type module using long job priority, need judge in the process whether and meanwhile hold
Other operations of row are the second operation, if not performing other operations, need to further determine whether operation in sequence i.e. the
Three type blocks are scheduled, and are scheduled according to sequent modular, then further establishment process and distribute resource.
Executive mode therein can be according to the demand sets itself of user, it is not limited to the execution side in embodiment
Formula.
Priority job is first determined whether for user job, if not priority job, then further determine whether by suitable
Sequence carries out job scheduling, if then all user jobs carry out job scheduling in sequence, according to the time sequencing of operation generation
Carry out order execution, such case is single mainly for user job and is completed one by one with time shorter situation；If not
Then all user jobs will enter in establishment process and distribution resource simultaneously, the mistake that some user job will not be caused to wait
Journey.
It is probably short time operation for identified priority job it could also be possible that growing if user job priority job
Time operation.
For SJF, the situation for the user job for needing first to complete in advance for possibility in the case of certain, preferentially
Arrange to complete, priority user operation can be preferential complete in the user job of sequence if the user job is to complete in order
Into；If the user job is not required in order, priority user operation first with all user jobs simultaneously create process and
Distribute preferential establishment process and distribution resource in resource.
For long job priority, because the time of long operation may be relatively long, into determining whether simultaneously, if hold
The other user jobs of row, i.e., simultaneously other user jobs are carried out with establishment process and distribution resource.If it is otherwise, into next
Whether step performs in sequence, and consideration is that some does not complete this long operation and can not continue user job task below, or
Person directly preferentially performs in all user jobs out of order；If yes perform simultaneously, be not just related to sequencing problem, directly
Process and distribution resource are preferentially created in all user jobs.
Job scheduling method provided in an embodiment of the present invention, by whether adding the mark of user job and whether pressing
The judgement of executive mode set in advance, the process that user job is called in is enriched, while meet the user according to different demands
Process is called in operation so that each user job can access and meet different user job dispatching requirements, reduce exploitation work
Measure, be widely used；By gradually forming the process of judgement to the process that user job is dispatched, i.e., constantly form intelligent operation
Process is called in, so as to realize that resource makes full use of and intelligentized traffic scheduling.
Alternatively, the foundation of the preferential identification module also includes：
If first operation is the priority job, and receives the execute instruction of the Second Type module, and connects
Receive while perform the instruction of the second operation, then create process and distribute resource.
On the basis of above-described embodiment, also include during preferential identification module is established according to long job priority
That is Second Type module, then need judge in the process whether and meanwhile perform other operations i.e. the second operation, if held simultaneously
Other operations of row, direct establishment process simultaneously distribute resource.
Job scheduling method provided in an embodiment of the present invention, by whether adding the mark of user job and whether pressing
The judgement of executive mode set in advance, the process that user job is called in is enriched, while meet the user according to different demands
Process is called in operation so that each user job can access and meet different user job dispatching requirements, reduce exploitation work
Measure, be widely used；By gradually forming the process of judgement to the process that user job is dispatched, i.e., constantly form intelligent operation
Process is called in, so as to realize that resource makes full use of and intelligentized traffic scheduling.
Alternatively, the preferential identification module that the basis pre-establishes, send and performed relatively to the pending operation
The instruction for the operation answered is specially：
The different priority levels pre-set according to the pending operation；
According to the height of the priority level, the instruction of corresponding operation is sent to the pending operation.
On the basis of above-described embodiment, the operation of priority scheduling is being needed to set priority level for each, such as
Can be arranged as required to for 1 grade, 2 grades, 3 grades ....
For the operation for needing priority scheduling identified, the operation of the priority of highest level is first carried out, according to from height
Performed successively to low order.
For example, there is 10 operations to need to perform, wherein have 9 there is priority tag, 21 grade of operation, 32 grades
Operation, 43 grades of operation, in the operation for needing 9 preferentially to perform, preferential execution priority is not high, 43 grades of work
Industry, 32 grades of operation is then performed again, finally perform 21 grade of operation.
Also include creating new logo characteristic functions, due to each user job number, the difference such as complexity, attribute,
Preferential significance level can not be distinguished well for being only limited to the ranks such as mark I, II, III, and mark color etc. can be voluntarily set
Characteristic strengthens the own characteristic of user job, so that the priority definition of user job is more accurate more extensive.
Specific example, two chassis beds need car to come out two steel balls, two wooden pearls, how about more efficient, can define
Wooden pearl is that priority job is not completed in sequence, then during execution, the two preferential Che Muzhu of chassis bed are completed simultaneously
Car steel ball, such efficiency highest, resource make full use of simultaneously, efficiently complete work.
Job scheduling method provided in an embodiment of the present invention, by whether adding the mark of user job and whether pressing
The judgement of executive mode set in advance, the process that user job is called in is enriched, while meet the user according to different demands
Process is called in operation so that each user job can access and meet different user job dispatching requirements, reduce exploitation work
Measure, be widely used；By gradually forming the process of judgement to the process that user job is dispatched, i.e., constantly form intelligent operation
Process is called in, so as to realize that resource makes full use of and intelligentized traffic scheduling.
Fig. 3 is the structural representation of job scheduling device provided in an embodiment of the present invention, as shown in figure 3, described device bag
Include：Judging unit 10 and execution unit 20, wherein：
Judging unit 10 is used to, according to the priority tag pre-set, judge whether pending operation is priority job；
If execution unit 20 is priority job for the pending operation, according to the preferential identification mould pre-established
Block, the instruction for performing corresponding operation is sent to the pending operation.
Specifically, for the different desired user jobs of variety classes, it is necessary to carry out rational operation allotment, methods described
Including：Be in advance each mark for needing to be set priority by the operation of priority job scheduling, can according to each operation whether
Need preferentially to complete, the mark of priority is set to each operation, it is readily identified to identify the characteristics of most prominent, shows itself thing
It is engaged in feature, indicates the major function that different meaning, difference and ownership between things is mark.Priority symbol processing is done to things,
Article characteristic is shown, is advantageous to the preferential execution of job task.
When there is many tasks to perform, judging unit 10 needs that first the priority tag of each operation is identified,
Judge whether first operation is priority job；
If first operation is priority job, if execution unit 20 is used for the pending operation and made to be preferential
Industry, then according to the preferential identification module pre-established, the instruction for performing corresponding operation is sent to the pending operation.
Job scheduling device provided in an embodiment of the present invention, by whether adding the mark of user job and whether pressing
The judgement of executive mode set in advance, the process that user job is called in is enriched, while meet the user according to different demands
Process is called in operation so that each user job can access and meet different user job dispatching requirements, reduce exploitation work
Measure, be widely used；By gradually forming the process of judgement to the process that user job is dispatched, i.e., constantly form intelligent operation
Process is called in, so as to realize that resource makes full use of and intelligentized traffic scheduling.
Alternatively, the specific of the preferential identification module establishes process and is：
If the first operation is the priority job, and receives the execute instruction of first kind module, then described is judged
Whether one operation is according to the 3rd type block progress job scheduling, if so, then creating process and distributing resource；
If first operation is the priority job, and receives the execute instruction of Second Type module and asynchronously hold
The instruction of the operation of row second, then whether first operation is judged according to the 3rd type block progress job scheduling, if so, then creating
Build process and distribute resource.
On the basis of above-described embodiment, the preferential identification module pre-established is user's work for a certain type
Industry, the attribute identified by remembering passing user job, if running into same user job, can add its category automatically
Property；Method is performed for the user job preferentially completed, can equally be remembered and applied to the user job scheduling of next time, will
The executive mode record of user job each time, and counted, therefrom select the optimal of each type of user job
Executive mode, so as to constitute preferential identification module.
It is as follows specifically to establish process：
Be the mark with priority for first operation, and preset using first kind module, then according to
3rd Type model carries out job scheduling；
If first operation is the mark with priority, and is preset using Second Type module, and herein
During, the second operation is performed when different, then is scheduled according to the 3rd Type model.
Wherein, first operation and second operation represent different operations respectively, are not specifically to limit certain
Operation；The first kind priviledge module, Second Type priviledge module and the 3rd type block represent different types of tune respectively
Algorithm is spent, can be any dispatching algorithm of the prior art, which kind of is specifically represented and not done in embodiments of the present invention specifically
Restriction.
Job scheduling device provided in an embodiment of the present invention, by whether adding the mark of user job and whether pressing
The judgement of executive mode set in advance, the process that user job is called in is enriched, while meet the user according to different demands
Process is called in operation so that each user job can access and meet different user job dispatching requirements, reduce exploitation work
Measure, be widely used；By gradually forming the process of judgement to the process that user job is dispatched, i.e., constantly form intelligent operation
Process is called in, so as to realize that resource makes full use of and intelligentized traffic scheduling.
Alternatively, the foundation of the preferential identification module also includes：
If first operation is the priority job, and receives the execute instruction of the Second Type module, and connects
Receive while perform the instruction of the second operation, then create process and distribute resource.
On the basis of above-described embodiment, also include during preferential identification module is established according to long job priority
That is Second Type module, then need judge in the process whether and meanwhile perform other operations i.e. the second operation, if held simultaneously
Other operations of row, direct establishment process simultaneously distribute resource.
Job scheduling device provided in an embodiment of the present invention, by whether adding the mark of user job and whether pressing
The judgement of executive mode set in advance, the process that user job is called in is enriched, while meet the user according to different demands
Process is called in operation so that each user job can access and meet different user job dispatching requirements, reduce exploitation work
Measure, be widely used；By gradually forming the process of judgement to the process that user job is dispatched, i.e., constantly form intelligent operation
Process is called in, so as to realize that resource makes full use of and intelligentized traffic scheduling.
Alternatively, the execution unit is specially：
The different priority levels pre-set according to the pending operation；
According to the height of the priority level, the instruction of corresponding operation is sent to the pending operation.
On the basis of above-described embodiment, the operation of priority scheduling is being needed to set priority level for each, such as
Can be arranged as required to for 1 grade, 2 grades, 3 grades ....
For the operation for needing priority scheduling identified, the operation of highest level is first carried out, it is suitable according to from high to low
Sequence performs successively.
Job scheduling device provided in an embodiment of the present invention, by whether adding the mark of user job and whether pressing
The judgement of executive mode set in advance, the process that user job is called in is enriched, while meet the user according to different demands
Process is called in operation so that each user job can access and meet different user job dispatching requirements, reduce exploitation work
Measure, be widely used；By gradually forming the process of judgement to the process that user job is dispatched, i.e., constantly form intelligent operation
Process is called in, so as to realize that resource makes full use of and intelligentized traffic scheduling.
The structured flowchart of Fig. 4 computer equipments provided in an embodiment of the present invention, as shown in figure 4, the computer equipment bag
Include：Processor (processor) 601, memory (memory) 602 and bus 603；
Wherein, the processor 601 and the memory 602 complete mutual communication by the bus 603；
The processor 601 is used to call the programmed instruction in the memory 602, to perform above-mentioned each method embodiment
The method provided, such as including：
According to the priority tag pre-set, judge whether pending operation is priority job；
If the pending operation is priority job, according to the preferential identification module pre-established, wait to hold to described
Row operation sends the instruction for performing corresponding operation.
The embodiment of the present invention discloses a kind of computer program product, and the computer program product is non-transient including being stored in
Computer program on computer-readable recording medium, the computer program include programmed instruction, when described program instructs quilt
When computer performs, computer is able to carry out the method that above-mentioned each method embodiment is provided, such as including：
According to the priority tag pre-set, judge whether pending operation is priority job；
If the pending operation is priority job, according to the preferential identification module pre-established, wait to hold to described
Row operation sends the instruction for performing corresponding operation.
The embodiment of the present invention provides a kind of non-transient computer readable storage medium storing program for executing, the non-transient computer readable storage
Medium storing computer instructs, and the computer instruction makes the computer perform the side that above-mentioned each method embodiment is provided
Method, such as including：
According to the priority tag pre-set, judge whether pending operation is priority job；
If the pending operation is priority job, according to the preferential identification module pre-established, wait to hold to described
Row operation sends the instruction for performing corresponding operation.
One of ordinary skill in the art will appreciate that：Realizing all or part of step of above method embodiment can pass through
Programmed instruction related hardware is completed, and foregoing program can be stored in a computer read/write memory medium, the program
Upon execution, the step of execution includes above method embodiment；And foregoing storage medium includes：ROM, RAM, magnetic disc or light
Disk etc. is various can be with the medium of store program codes.
Through the above description of the embodiments, those skilled in the art can be understood that each embodiment can
Realized by the mode of software plus required general hardware platform, naturally it is also possible to pass through hardware.Based on such understanding, on
The part that technical scheme substantially in other words contributes to prior art is stated to embody in the form of software product, should
Computer software product can store in a computer-readable storage medium, such as ROM/RAM, magnetic disc, CD, including some fingers
Make to cause a computer equipment (can be personal computer, server, or network equipment etc.) to perform each implementation
Method described in some parts of example or embodiment.
Device and system embodiment described above is only schematical, wherein described be used as separating component explanation
Unit can be or may not be physically separate, can be as the part that unit is shown or may not be
Physical location, you can with positioned at a place, or can also be distributed on multiple NEs.Can be according to the actual needs
Some or all of module therein is selected to realize the purpose of this embodiment scheme.Those of ordinary skill in the art are not paying
In the case of performing creative labour, you can to understand and implement.
Claims (10)
- A kind of 1. job scheduling method, it is characterised in that including：According to the priority tag pre-set, judge whether pending operation is priority job；If the pending operation is priority job, according to the preferential identification module pre-established, to the pending work Industry sends the instruction for performing corresponding operation.
- 2. according to the method for claim 1, it is characterised in that the specific of the preferential identification module establishes process and be：If the first operation is the priority job, and receives the execute instruction of first kind module, then judge that described first makees Whether industry is according to the 3rd type block progress job scheduling, if so, then creating process and distributing resource；If first operation is the priority job, and receives the execute instruction of Second Type module and asynchronously perform The instruction of two operations, then judge first operation whether according to the 3rd type block carry out job scheduling, if so, then create into Journey simultaneously distributes resource.
- 3. according to the method for claim 2, it is characterised in that the foundation of the preferential identification module also includes：If first operation is the priority job, and receives the execute instruction of the Second Type module, and receives The instruction of the second operation is performed simultaneously, then creates process and distribute resource.
- 4. according to the method for claim 1, it is characterised in that the preferential identification module that the basis pre-establishes, give The pending operation, which is sent, to be performed the instruction of corresponding operation and is specially：The different priority levels pre-set according to the pending operation；According to the height of the priority level, the instruction of corresponding operation is sent to the pending operation.
- A kind of 5. job scheduling device, it is characterised in that including：Judging unit, for according to the priority tag pre-set, judging whether pending operation is priority job；Execution unit, if being priority job for the pending operation, according to the preferential identification module that pre-establishes, to The pending operation sends the instruction for performing corresponding operation.
- 6. device according to claim 5, it is characterised in that the specific of the preferential identification module establishes process and be：If the first operation is the priority job, and receives the execute instruction of first kind module, then judge that described first makees Whether industry is according to the 3rd type block progress job scheduling, if so, then creating process and distributing resource；If first operation is the priority job, and receives the execute instruction of Second Type module and asynchronously perform The instruction of two operations, then judge first operation whether according to the 3rd type block carry out job scheduling, if so, then create into Journey simultaneously distributes resource.
- 7. device according to claim 6, it is characterised in that the foundation of the preferential identification module also includes：If first operation is the priority job, and receives the execute instruction of the Second Type module, and receives The instruction of the second operation is performed simultaneously, then creates process and distribute resource.
- 8. device according to claim 5, it is characterised in that the execution unit is specially：The different priority levels pre-set according to the pending operation；According to the height of the priority level, the instruction of corresponding operation is sent to the pending operation.
- 9. a kind of computer equipment, it is characterised in that including memory and processor, the processor and the memory pass through Bus completes mutual communication；The memory storage has can be by the programmed instruction of the computing device, the processor Described program instruction is called to be able to carry out the method as described in Claims 1-4 is any.
- 10. a kind of computer-readable recording medium, is stored thereon with computer program, it is characterised in that the computer program quilt The method as described in Claims 1-4 is any is realized during computing device.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201711174181.XA CN107885589B (en) | 2017-11-22 | 2017-11-22 | Job scheduling method and device |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201711174181.XA CN107885589B (en) | 2017-11-22 | 2017-11-22 | Job scheduling method and device |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN107885589A true CN107885589A (en) | 2018-04-06 |
| CN107885589B CN107885589B (en) | 2021-02-12 |
Family
ID=61778127
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201711174181.XA Active CN107885589B (en) | 2017-11-22 | 2017-11-22 | Job scheduling method and device |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN107885589B (en) |
Cited By (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN109808740A (en) * | 2019-02-14 | 2019-05-28 | 内蒙古伊泰准东铁路有限责任公司 | Train scheduling method, apparatus and system |
| CN112001426A (en) * | 2020-08-03 | 2020-11-27 | 中国建设银行股份有限公司 | Automatic operation and maintenance method, system, device and storage medium for computer operation |
Citations (11)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US20030037091A1 (en) * | 2001-08-09 | 2003-02-20 | Kozo Nishimura | Task scheduling device |
| US20060190943A1 (en) * | 2005-02-22 | 2006-08-24 | Northrop Grumman Corporation | System and a method for scheduling tasks |
| US20090288090A1 (en) * | 2008-05-15 | 2009-11-19 | Fujitsu Limited | Priority control program, apparatus and method |
| CN101707543A (en) * | 2009-11-30 | 2010-05-12 | 北京中科大洋科技发展股份有限公司 | Enterprise media bus system supporting multi-task type and enterprise media bus method supporting multi-task type |
| US20120297070A1 (en) * | 2011-05-20 | 2012-11-22 | Jianxiong Shi | Apparatus and methods for optimizing scheduled operations in hybrid network environments |
| CN102929720A (en) * | 2012-09-24 | 2013-02-13 | 曙光信息产业(北京)有限公司 | Energy-saving job scheduling system |
| CN103761147A (en) * | 2014-01-15 | 2014-04-30 | 清华大学 | Method and system for managing calculation examples in cloud platforms |
| CN104021044A (en) * | 2013-02-28 | 2014-09-03 | 中国移动通信集团浙江有限公司 | Job scheduling method and device |
| CN104657212A (en) * | 2015-02-13 | 2015-05-27 | 北京亚信数据有限公司 | Task scheduling method and system |
| CN104735095A (en) * | 2013-12-18 | 2015-06-24 | 中国移动通信集团四川有限公司 | Method and device for job scheduling of cloud computing platform |
| CN107239336A (en) * | 2016-03-28 | 2017-10-10 | 中兴通讯股份有限公司 | A kind of method and device for realizing task scheduling |
-
2017
- 2017-11-22 CN CN201711174181.XA patent/CN107885589B/en active Active
Patent Citations (11)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US20030037091A1 (en) * | 2001-08-09 | 2003-02-20 | Kozo Nishimura | Task scheduling device |
| US20060190943A1 (en) * | 2005-02-22 | 2006-08-24 | Northrop Grumman Corporation | System and a method for scheduling tasks |
| US20090288090A1 (en) * | 2008-05-15 | 2009-11-19 | Fujitsu Limited | Priority control program, apparatus and method |
| CN101707543A (en) * | 2009-11-30 | 2010-05-12 | 北京中科大洋科技发展股份有限公司 | Enterprise media bus system supporting multi-task type and enterprise media bus method supporting multi-task type |
| US20120297070A1 (en) * | 2011-05-20 | 2012-11-22 | Jianxiong Shi | Apparatus and methods for optimizing scheduled operations in hybrid network environments |
| CN102929720A (en) * | 2012-09-24 | 2013-02-13 | 曙光信息产业(北京)有限公司 | Energy-saving job scheduling system |
| CN104021044A (en) * | 2013-02-28 | 2014-09-03 | 中国移动通信集团浙江有限公司 | Job scheduling method and device |
| CN104735095A (en) * | 2013-12-18 | 2015-06-24 | 中国移动通信集团四川有限公司 | Method and device for job scheduling of cloud computing platform |
| CN103761147A (en) * | 2014-01-15 | 2014-04-30 | 清华大学 | Method and system for managing calculation examples in cloud platforms |
| CN104657212A (en) * | 2015-02-13 | 2015-05-27 | 北京亚信数据有限公司 | Task scheduling method and system |
| CN107239336A (en) * | 2016-03-28 | 2017-10-10 | 中兴通讯股份有限公司 | A kind of method and device for realizing task scheduling |
Cited By (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN109808740A (en) * | 2019-02-14 | 2019-05-28 | 内蒙古伊泰准东铁路有限责任公司 | Train scheduling method, apparatus and system |
| CN112001426A (en) * | 2020-08-03 | 2020-11-27 | 中国建设银行股份有限公司 | Automatic operation and maintenance method, system, device and storage medium for computer operation |
Also Published As
| Publication number | Publication date |
|---|---|
| CN107885589B (en) | 2021-02-12 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN110442451B (en) | Deep learning-oriented multi-type GPU cluster resource management scheduling method and system | |
| CN110264120A (en) | A kind of intelligent storage route planning system and method based on more AGV | |
| CN105260237B (en) | The task scheduling system and its dispatching method of heterogeneous polynuclear platform | |
| CN111176852A (en) | Resource allocation method, device, chip and computer readable storage medium | |
| CN112416585B (en) | Deep learning-oriented GPU resource management and intelligent scheduling method | |
| CN102053870A (en) | Systems and methods for affinity driven distributed scheduling of parallel computations | |
| CN109710400A (en) | The method and device of thread resources grouping | |
| CN106569891A (en) | Method and device for carrying out task scheduling in storage system | |
| CN105378668B (en) | The interruption of operating system management in multicomputer system guides | |
| CN109144710A (en) | Resource regulating method, device and computer readable storage medium | |
| CN108090731A (en) | A kind of information processing method and equipment | |
| CN110427256A (en) | Job scheduling optimization method, equipment, storage medium and device priority-based | |
| CN106293918A (en) | A kind of dispatch the method for process, system and computer | |
| CN109992403A (en) | Optimization method, device, terminal device and the storage medium of multi-tenant scheduling of resource | |
| WO2019120158A1 (en) | Item picking method, and related apparatus | |
| CN101582043A (en) | Dynamic task allocation method of heterogeneous computing system | |
| CN106897136A (en) | A kind of method for scheduling task and device | |
| CN109857535B (en) | Spark JDBC-oriented task priority control implementation method and device | |
| CN112801448A (en) | Material demand distribution method, device and system and storage medium | |
| CN109840149B (en) | Task scheduling method, device, equipment and storage medium | |
| Babiceanu et al. | Real-time holonic scheduling of material handling operations in a dynamic manufacturing environment | |
| CN107885589A (en) | A kind of job scheduling method and device | |
| Rahman et al. | Multiple-order permutation flow shop scheduling under process interruptions | |
| CN111754086A (en) | Order scheduling method | |
| CN113190359B (en) | Simulation request processing method and device, electronic equipment and readable 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 | ||
| CB02 | Change of applicant information | ||
| CB02 | Change of applicant information |
Address after: 100085 Floor 101 102-1, No. 35 Building, No. 2 Hospital, Xierqi West Road, Haidian District, Beijing Applicant after: Seashell Housing (Beijing) Technology Co.,Ltd. Address before: 100085 Floor 101 102-1, No. 35 Building, No. 2 Hospital, Xierqi West Road, Haidian District, Beijing Applicant before: LIANJIA(BEIJING) TECHNOLOGY Co.,Ltd. |
|
| GR01 | Patent grant | ||
| GR01 | Patent grant |