CN102929695A - Batch job scheduling method based on subscription - Google Patents
Batch job scheduling method based on subscription Download PDFInfo
- Publication number
- CN102929695A CN102929695A CN201210348300XA CN201210348300A CN102929695A CN 102929695 A CN102929695 A CN 102929695A CN 201210348300X A CN201210348300X A CN 201210348300XA CN 201210348300 A CN201210348300 A CN 201210348300A CN 102929695 A CN102929695 A CN 102929695A
- Authority
- CN
- China
- Prior art keywords
- coupling
- task
- reservation
- job
- tasks
- 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
Landscapes
- Management, Administration, Business Operations System, And Electronic Commerce (AREA)
Abstract
The invention provides a batch job scheduling method based on a subscription. The batch job scheduling method comprises the following steps of: submitting jobs and appointing coupling properties to the jobs; scheduling the jobs by using a job scheduling system, if a certain task is a coupling task, automatically combining the type of tasks to form a group, and unifying the priority levels of the tasks as tasks with the highest priority levels in the coupling tasks; if all the coupling tasks successfully make temporary subscriptions, starting a job starting process, otherwise, deleting the previously made temporary subscriptions, and continuously processing the next job; and if all the coupling tasks correspond to the temporary appointments, starting all the coupling tasks in batches. By the method, a batch of jobs can be scheduled; normal calculation of the coupling tasks can be guaranteed; moreover, a phenomenon that an individual coupling task is started, and the whole coupling job cannot be calculated can be avoided; and the overall utilization rate of a cluster is improved.
Description
Technical field
The invention belongs to field of computer technology, be specifically related to a kind of batch jobs dispatching method based on reservation.
Background technology
High-Performance Computing Cluster is the general name be used to the software and hardware system that carries out high-performance calculation.Usually partly formed by high-performance server, high speed storing, express network, machine room infrastructure (such as power supply, refrigeration) etc. on the hardware; The software aspect generally includes job scheduling software, monitor and management of cluster software, parallel storing software etc. and partly forms.
Job scheduling system is the software systems of being responsible for finishing the application job scheduling.On function, usually partly formed by explorer, job scheduler, tasks carrying device etc.; Dispatching system is similar to an operating system, and the fairly perfect interface that manages for internal objects such as operation, resources generally can be provided, and comprises command line interface, api interface.More common dispatching system comprises that LSF, SGE, PBS(Torque are the branches of pbs).
It is current a kind of relatively more popular Simulation Application field that coupling Simulation is calculated.In the fields such as bullet train, aircraft, automobile, important application is arranged.At present, it all is as proprietary software systems that coupling Simulation is used usually, runs under the environment such as similar workstation, seldom considers the use under cluster environment.
From development trend, this class is used to move under cluster later and is inevitable.Problem just is how dispatching system supports the type to calculate.Coupling task is calculated has a notable feature to be exactly, and each coupling module must be dispatched successfully simultaneously, and coupling task could begin to calculate.This is different from traditional job scheduling.
Dispatching system in present main flow all is to provide various dispatching algorithms for single operation, and the job stream function also only is to define the sequential relationships such as data circulation, job run between the operation, does not substantially support the lot size scheduling for operation.
Summary of the invention
In order to overcome above-mentioned the deficiencies in the prior art, the invention provides a kind of batch jobs dispatching method based on reservation, solved the problem of coupling job patch scheduling, can guarantee the normal calculating of coupling task, can also avoid simultaneously indivedual coupling task to start but problem that coupling operation integral body can not be calculated, improve the overall utilization rate of cluster.
In order to realize the foregoing invention purpose, the present invention takes following technical scheme:
A kind of batch jobs dispatching method based on reservation said method comprising the steps of:
Step 1: submit job also is operation appointment coupling attribute;
Step 2: job scheduling system is dispatched operation, is coupling task if find certain task, then automatically with this generic task as one group, the priority of unified task is the highest task of this coupling task medium priority;
Step 3: if all coupling task successfully create interim reservation, then begin the job initiation process; Otherwise then the interim reservation that creates before the deletion continues to process next operation;
Step 4: if all corresponding interim reservations of all coupling task then start all coupling task in batches.
In the described step 1, when submitting first coupling task to, described job scheduling system auto-returned coupling numbering.When submitting follow-up work to, specify and use described coupling numbering.
In the described step 2, job scheduling system if find this coupling task, then when the success of coupling resource, creates temporarily reservation during according to the priority scheduling task, then continues to check other task of same coupling operation.
In the described step 4, if arbitrary task start failure is arranged, then having started by the rollback deletion of task, and the interim reservation of deletion continue to process next operation.
Compared with prior art, beneficial effect of the present invention is: the invention provides a kind of batch jobs dispatching method based on reservation, solved the problem of coupling job patch scheduling, can guarantee the normal calculating of coupling task, can also avoid simultaneously indivedual coupling task to start but problem that coupling operation integral body can not be calculated, improve the overall utilization rate of cluster; The method is simple and reliable, easily carries out.
Description of drawings
Fig. 1 is coupling task scheduling flow figure.
Embodiment
Below in conjunction with accompanying drawing the present invention is described in further detail.
The invention provides a kind of batch jobs dispatching method based on reservation, said method comprising the steps of:
Step 1: submit job also is operation appointment coupling attribute; When submitting first coupling task to, described job scheduling system auto-returned coupling numbering.When submitting follow-up work to, specify and use described coupling numbering.After submitting to and finish, coupling task can dispatch by this group coupling task of order notice dispatching system.
Step 2: job scheduling system is dispatched operation, is coupling task if find certain task, then automatically with this generic task as one group, the priority of unified task is the highest task of this coupling task medium priority; Job scheduling system if find this coupling task, then when the success of coupling resource, creates temporarily reservation during according to the priority scheduling task, then continues to check other task of same coupling operation.
Step 3: if all coupling task successfully create interim reservation, then begin the job initiation process; Otherwise then the interim reservation that creates before the deletion continues to process next operation;
Step 4: if all corresponding interim reservations of all coupling task then start all coupling task in batches.If arbitrary task start failure is arranged, then having started by the rollback deletion of task, and the interim reservation of deletion continue to process next operation.
Should be noted that at last: above embodiment is only in order to illustrate that technical scheme of the present invention is not intended to limit, although with reference to above-described embodiment the present invention is had been described in detail, those of ordinary skill in the field are to be understood that: still can make amendment or be equal to replacement the specific embodiment of the present invention, and do not break away from any modification of spirit and scope of the invention or be equal to replacement, it all should be encompassed in the middle of the claim scope of the present invention.
Claims (5)
- One kind based on the reservation the batch jobs dispatching method, it is characterized in that: said method comprising the steps of:Step 1: submit job also is operation appointment coupling attribute;Step 2: job scheduling system is dispatched operation, is coupling task if find certain task, then automatically with this generic task as one group, the priority of unified task is the highest task of this coupling task medium priority;Step 3: if all coupling task successfully create interim reservation, then begin the job initiation process; Otherwise then the interim reservation that creates before the deletion continues to process next operation;Step 4: if all corresponding interim reservations of all coupling task then start all coupling task in batches.
- 2. the batch jobs dispatching method based on reservation according to claim 1 is characterized in that: in the described step 1, and when submitting first coupling task to, described job scheduling system auto-returned coupling numbering.
- 3. the batch jobs dispatching method based on reservation according to claim 2 is characterized in that: when submitting follow-up work to, specify and use described coupling numbering.
- According to claim 1 based on the reservation the batch jobs dispatching method, it is characterized in that: in the described step 2, job scheduling system is during according to the priority scheduling task, if find this coupling task, then when the success of coupling resource, create interim reservation, then continue to check other task of same coupling operation.
- 5. the batch jobs dispatching method based on reservation according to claim 1 is characterized in that: in the described step 4, if arbitrary task start failure is arranged, then delete having started of task by rollback, and delete interim reservation, continue the next operation of processing.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201210348300.XA CN102929695B (en) | 2012-09-18 | 2012-09-18 | A kind of batch jobs dispatching method based on reservation |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201210348300.XA CN102929695B (en) | 2012-09-18 | 2012-09-18 | A kind of batch jobs dispatching method based on reservation |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN102929695A true CN102929695A (en) | 2013-02-13 |
| CN102929695B CN102929695B (en) | 2016-12-21 |
Family
ID=47644504
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201210348300.XA Active CN102929695B (en) | 2012-09-18 | 2012-09-18 | A kind of batch jobs dispatching method based on reservation |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN102929695B (en) |
Cited By (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN112506634A (en) * | 2020-12-08 | 2021-03-16 | 天津津航计算技术研究所 | Fairness operation scheduling method based on reservation mechanism |
Citations (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101038559A (en) * | 2006-09-11 | 2007-09-19 | 中国工商银行股份有限公司 | Batch task scheduling engine and dispatching method |
| US20070234363A1 (en) * | 2006-03-31 | 2007-10-04 | Ebay Inc. | Batch scheduling |
| CN101561768A (en) * | 2008-04-18 | 2009-10-21 | 北京闻言科技有限公司 | Universal multitask scheduling method |
-
2012
- 2012-09-18 CN CN201210348300.XA patent/CN102929695B/en active Active
Patent Citations (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US20070234363A1 (en) * | 2006-03-31 | 2007-10-04 | Ebay Inc. | Batch scheduling |
| CN101038559A (en) * | 2006-09-11 | 2007-09-19 | 中国工商银行股份有限公司 | Batch task scheduling engine and dispatching method |
| CN101561768A (en) * | 2008-04-18 | 2009-10-21 | 北京闻言科技有限公司 | Universal multitask scheduling method |
Cited By (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN112506634A (en) * | 2020-12-08 | 2021-03-16 | 天津津航计算技术研究所 | Fairness operation scheduling method based on reservation mechanism |
Also Published As
| Publication number | Publication date |
|---|---|
| CN102929695B (en) | 2016-12-21 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| Calheiros et al. | Energy-efficient scheduling of urgent bag-of-tasks applications in clouds through DVFS | |
| CN109117260A (en) | A kind of method for scheduling task, device, equipment and medium | |
| CN103279390B (en) | A kind of parallel processing system (PPS) towards little optimization of job | |
| WO2015070705A1 (en) | Computer device, method and apparatus for scheduling service process | |
| CN104506620A (en) | Extensible automatic computing service platform and construction method for same | |
| CN101963922B (en) | Task processing method and device | |
| US20210248469A1 (en) | Method and apparatus for scheduling deep learning reasoning engines, device, and medium | |
| CN106919445A (en) | A kind of method and apparatus of the container of Parallel Scheduling in the cluster | |
| CN106033373A (en) | A method and a system for scheduling virtual machine resources in a cloud computing platform | |
| WO2021155667A1 (en) | Model training method and apparatus, and clustering system | |
| CN101599026A (en) | A kind of cluster job scheduling system with resilient infrastructure | |
| CN102364447B (en) | Operation scheduling method for optimizing communication energy consumption among multiple tasks | |
| US20230020324A1 (en) | Task Processing Method and Device, and Electronic Device | |
| CN110427252A (en) | Method for scheduling task, device and the storage medium of task based access control dependence | |
| CN104598426A (en) | task scheduling method applied to a heterogeneous multi-core processor system | |
| CN102902592B (en) | A kind of subregion schedule management method of PC cluster resource | |
| CN107316124B (en) | Extensive affairs type job scheduling and processing general-purpose system under big data environment | |
| CN105187327A (en) | Distributed message queue middleware | |
| CN104375893A (en) | Partition scheduling method based on two-stage operating system structure | |
| CN102681894A (en) | Method and system for multitask concurrent scheduling | |
| CN113032152A (en) | Scheduling method, scheduling apparatus, electronic device, storage medium, and program product for deep learning framework | |
| CN107807854A (en) | The method and rendering task processing method of a kind of Automatic dispatching Node station | |
| CN105607956B (en) | Method for allocating tasks and system in a kind of computer | |
| CN103677959B (en) | A kind of virtual machine cluster migration method and system based on multicast | |
| CN114691050A (en) | Cloud native storage method, device, equipment and medium based on kubernets |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| C06 | Publication | ||
| PB01 | Publication | ||
| C10 | Entry into substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| C14 | Grant of patent or utility model | ||
| GR01 | Patent grant | ||
| TR01 | Transfer of patent right |
Effective date of registration: 20211022 Address after: 100089 zone A-1, floor 2, building 36, yard 8, Dongbeiwang West Road, Haidian District, Beijing Patentee after: Shuguang zhisuan Information Technology Co.,Ltd. Address before: 100193 No.36 Zhongguancun Software Park, No.8 Dongbeiwang West Road, Haidian District, Beijing Patentee before: Dawning Information Industry (Beijing) Co.,Ltd. |
|
| TR01 | Transfer of patent right |