Looking for breakthrough ideas for innovation challenges? Try Patsnap Eureka!

Fairness job scheduling method based on reservation mechanism

A job scheduling and fairness technology, applied in the computer field, can solve problems such as extended response time, low resource utilization, and lack of fairness

Active Publication Date: 2021-03-16
TIANJIN JINHANG COMP TECH RES INST
View PDF6 Cites 3 Cited by
  • Summary
  • Abstract
  • Description
  • Claims
  • Application Information

AI Technical Summary

Problems solved by technology

[0008] The technical problem to be solved by the present invention is: how to solve the problems of low resource utilization, job waiting time and response time prolongation caused by the problem of job hunger and resource fragmentation, and the lack of consideration of fairness

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
  • Fairness job scheduling method based on reservation mechanism
  • Fairness job scheduling method based on reservation mechanism
  • Fairness job scheduling method based on reservation mechanism

Examples

Experimental program
Comparison scheme
Effect test

Embodiment Construction

[0030] In order to make the objects, content, and advantages of the present invention, the specific embodiments of the present invention will be further described in detail below with reference to the accompanying drawings and examples.

[0031]In order to overcome the shortcomings of the existing technique on the scheduling management platform, the present invention proposes a fair job scheduling method based on the reservation mechanism, which establishes a scheduling model based on the characteristics of independent task applications, using dynamic adjustable priority and preemptive mechanism. To ensure fairness, that is, any job is not delayed in the implementation of high-level homework. The adoption of the appointment mechanism ensures maximum resource utilization, so that the idle resources can be low priority, the job is used in advance, and the resources are reserved for jobs with high priority and large resources. The method can efficiently handle the job submitted by th...

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 relates to a fairness job scheduling method based on a reservation mechanism, and belongs to the technical field of computers. The invention provides a fairness job scheduling method based on a reservation mechanism in order to solve the low computing resource utilization rate, prolonged job waiting time and response time and lack of consideration of fairness due to job starvation and resource fragmentation of a traditional job scheduling method. According to the method, a scheduling model is established based on the characteristics of independent task applications, and the fairness is ensured by using a dynamic adjustable priority and a preemption mechanism, that is, any job cannot be executed after a job with the priority higher than that of the job. The reservation mechanism is used to ensure the maximum resource utilization rate, so that idle resources can be used in advance by jobs with low priorities and low resource requirements, and resources are reserved for jobswith high priorities and high resource requirements.

Description

Technical field [0001] The present invention belongs to the technical field of computer, and more particularly to a fair job scheduling method based on the reservation mechanism. Background technique [0002] The work scheduling problem mainly studies how to allocate the work in the queue to the computing node to achieve a certain effect. The homework includes parameter information such as calculation resource requirements, runtime constraints, and the job scheduling policy is where the optimal decision is when the job is running. Job Scheduling is one of the core functions of the cluster system. The selection of dispatching strategies is a good or bad system performance, and excellent job scheduling strategy can minimize system resources competition, user cost, and improve system utilization. This is a complete problem with NP, and domestic and foreign scholars have launched a wide and deeply study to meet the goals close to the optimization. [0003] First serve the first servi...

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/48G06F9/50
CPCG06F9/4881G06F9/5066G06F2209/484Y02D10/00
Inventor 李谦袁盾刘康贾磊
Owner TIANJIN JINHANG COMP TECH RES INST
Who we serve
  • R&D Engineer
  • R&D Manager
  • IP Professional
Why Patsnap Eureka
  • Industry Leading Data Capabilities
  • Powerful AI technology
  • Patent DNA Extraction
Social media
Patsnap Eureka Blog
Learn More
PatSnap group products

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

© 2024 PatSnap. All rights reserved.Legal|Privacy policy|Modern Slavery Act Transparency Statement|Sitemap|About US| Contact US: help@patsnap.com