Job scheduling method and apparatus

A job scheduling and job entity technology, applied in the field of computer networks, can solve problems such as unbalanced utilization, unguaranteed minimum resource quotas for jobs, and inability to meet concurrent multi-scheduling requirements, and achieve the effect of improving utilization.

Inactive Publication Date: 2016-06-29
CHINA MOBILE COMM GRP CO LTD +1
View PDF7 Cites 21 Cited by
  • Summary
  • Abstract
  • Description
  • Claims
  • Application Information

AI Technical Summary

Problems solved by technology

[0009] However, the existing job scheduling methods for big data or distributed computing systems cannot meet the scheduling requirements in the case of concurrent multiple jobs and multiple SLAs, such as:
[0010] 1. When a low-priority job is running, a new

Method used

the structure of the environmentally friendly knitted fabric provided by the present invention; figure 2 Flow chart of the yarn wrapping machine for environmentally friendly knitted fabrics and storage devices; image 3 Is the parameter map of the yarn covering machine
View more

Image

Smart Image Click on the blue labels to locate them in the text.
Viewing Examples
Smart Image
  • Job scheduling method and apparatus
  • Job scheduling method and apparatus
  • Job scheduling method and apparatus

Examples

Experimental program
Comparison scheme
Effect test

Embodiment 1

[0071] According to an aspect of the embodiments of the present invention, a method for job scheduling is provided, such as figure 1 shown, including:

[0072] Step S11 , acquiring the priority information of the job entity carried by the job entity and the minimum amount of resources required by the job entity.

[0073] Among them, Job_i is used to represent the job entity with the serial number i, and the job entity includes several important information related to SLA in addition to the basic information of the job: Job_i{sla_i, time_max_i}. Among them, sla_i represents the priority of Job_i, which is defined as any integer from 1 to 1000; time_max_i represents the maximum allowable execution time of Job_i; and the data of {sla_i, time_max_i} is defined when the user submits Job_i. The minimum resource quantity required by the job entity is obtained through related algorithms after the job entity is submitted.

[0074] Step S13 , according to the priority information of t...

Embodiment 2

[0112] According to another aspect of the embodiments of the present invention, a job scheduling device is provided, such as figure 2 As shown, the device 200 includes:

[0113] An acquisition module 201, configured to acquire the priority information of the operation entity carried by the operation entity and the minimum resource quantity required by the operation entity;

[0114] A planning module 203, configured to divide a plurality of job entities with the same priority into the same job queue according to the priority information of the job entities, so as to obtain at least one job queue;

[0115] A resource allocation module 205, configured to obtain available resources in the resource queue and allocate them to the job entity if the number of resources allocated to the job entity in each job queue is less than the minimum resource quantity required by the job entity .

[0116] Optionally, as in image 3 As shown, the resource allocation module 205 includes:

[01...

the structure of the environmentally friendly knitted fabric provided by the present invention; figure 2 Flow chart of the yarn wrapping machine for environmentally friendly knitted fabrics and storage devices; image 3 Is the parameter map of the yarn covering machine
Login to view more

PUM

No PUM Login to view more

Abstract

The invention provides a job scheduling method and apparatus. The job scheduling method comprises the steps of obtaining priority information of job entities carried by the job entities and the minimum resource quantity required by the job entities; dividing the multiple job entities with the same priority into the same job queue according to the priority information of the job entities to obtain at least a job queue; and if the resource quantity allocated to the job entities in each job queue is less than the minimum resource quantity required by the job entities, obtaining available resource from a resource queue, and allocating the available resource to the job entities. By adoption of the scheme of the job scheduling method and apparatus, service level agreement guarantee for different job entities when multiple job entities are under concurrent execution can be realized, including resource allocations for job entities of different priorities or the job entities of the same priority; the balance of resource sharing and well-aligned guarantee is realized; and therefore, the service level agreement for each job entity is realized, and the utilization ratio of the overall cluster resource is improved as well.

Description

technical field [0001] The invention relates to the technical field of computer networks, in particular to a job scheduling method and device. Background technique [0002] Existing big data or distributed computing systems use a simple queue mechanism for job scheduling, which lacks guarantees for different service level agreements (SLAs) for different jobs. [0003] The current job scheduling of big data or distributed computing generally adopts the following queue mechanisms: [0004] 1. Single queue mode [0005] (1) First-in-first-out queue: That is, various jobs are queued indiscriminately according to the time sequence of applying for resources, and the job scheduler allocates resources according to the queuing sequence of jobs. [0006] (2) The queuing strategy of the earliest completion time: According to the estimated execution time of each job, compare the situation of idle resources, and select the job with the shortest execution time to be executed first. [...

Claims

the structure of the environmentally friendly knitted fabric provided by the present invention; figure 2 Flow chart of the yarn wrapping machine for environmentally friendly knitted fabrics and storage devices; image 3 Is the parameter map of the yarn covering machine
Login to view more

Application Information

Patent Timeline
no application Login to view more
IPC IPC(8): G06F9/50
Inventor 张婷婷罗亚丹罗治国潘毅段翔喻朝新张静娴吴霜
Owner CHINA MOBILE COMM GRP CO LTD
Who we serve
  • R&D Engineer
  • R&D Manager
  • IP Professional
Why Eureka
  • Industry Leading Data Capabilities
  • Powerful AI technology
  • Patent DNA Extraction
Social media
Try Eureka
PatSnap group products

Browse by: Latest US Patents, China's latest patents, Technical Efficacy Thesaurus, Application Domain, Technology Topic.

© 2024 PatSnap. All rights reserved.Legal|Privacy policy|Modern Slavery Act Transparency Statement|Sitemap