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

Container resource scheduling method

A resource scheduling and container technology, applied in the field of cloud computing, can solve problems such as resource size, resource allocation waste, resource waste, etc., and achieve the effect of saving bandwidth and the time required for downloading images, improving efficiency, and improving operating efficiency

Inactive Publication Date: 2017-11-03
SHANDONG LANGCHAO YUNTOU INFORMATION TECH CO LTD
View PDF4 Cites 5 Cited by
  • Summary
  • Abstract
  • Description
  • Claims
  • Application Information

AI Technical Summary

Problems solved by technology

At present, the following methods are mainly used for the allocation of container resources: one allocation method is to allocate according to the order in which instructions are received, this method does not consider the size of resources required by different containers, which is easy to cause waste of resources; The first allocation method is to allocate according to the different execution functions of the containers. In this way, although the configuration of resources is realized to a certain extent, the containers are not fixed and the functions they perform are also different. Therefore, resource allocation is also different. There will be a problem of wastage

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
  • Container resource scheduling method
  • Container resource scheduling method

Examples

Experimental program
Comparison scheme
Effect test

Embodiment 1

[0041] Such as figure 1 Shown as a specific embodiment, a container resource scheduling method is provided, and the method includes the following steps:

[0042] S1: Score the nodes, the specific implementation process is:

[0043] S11: Set the upper limit of mirroring max. In practical applications, you can set max to 2G, which is 2048M;

[0044] S12: Obtain the image value X1 required by the application;

[0045] S13: Obtain a node's own mirror value X2;

[0046] S14: Judge whether X1 is greater than X2, if so, the node scores score=0; if not, go to S15;

[0047] S15: Judge whether X2 is greater than max, if so, the node score = 100; if not, go to S16;

[0048] S16: Calculate the node score according to the formula score=100*(X2-X1) / (max-X1);

[0049] S17: Repeat steps S13-S16 to get the score of each node.

[0050] S2: Select the node with the highest score.

[0051] S3: Determine whether the number of nodes with the highest score is greater than 1, if yes, go to S4, if not, select the no...

Embodiment 2

[0054] Such as figure 2 Shown as a specific embodiment, a container resource scheduling method is provided, and the method includes the following steps:

[0055] S1: Score the nodes, the specific implementation process is:

[0056] S11: Set the upper limit of mirroring max. In practical applications, you can set max to 2G, which is 2048M;

[0057] S12: Obtain the image value X1 required by the application;

[0058] S13: Obtain a node's own mirror value X2;

[0059] S14: Judge whether X1 is greater than X2, if so, the node scores score=0; if not, go to S15;

[0060] S15: Judge whether X2 is greater than max, if so, the node score = 100; if not, go to S16;

[0061] S16: Calculate the node score according to the formula score=100*(X2-X1) / (max-X1);

[0062] S17: Repeat steps S13-S16 to get the score of each node.

[0063] S2: Select the node with the highest score.

[0064] S3: Determine whether the number of nodes with the highest score is greater than 1, if yes, go to S4, if not, select the ...

Embodiment 3

[0069] On the basis of embodiment 1, the following steps are added before step S1:

[0070] S0: Determine the size of the node's own resources, and remove nodes whose own resources are less than the set value.

[0071] By setting step S0, nodes that do not meet the requirements can be removed in advance before scoring, reducing the number of nodes that need to be scored, and improving efficiency. In the actual application, an example is given, the size of the set value is set to 100M.

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 container resource scheduling method, which comprises the following steps that: S1: giving a mark for a node; and S2: selecting a node with a highest score. Through the above setting, on a resource-allowable premise, the bandwidth of a network transmission mirror image and time required for downloading the mirror image can be saved, system operation efficiency is improved, and system service quality is guaranteed.

Description

Technical field [0001] The invention relates to the technical field of cloud computing, in particular to a container resource scheduling method. Background technique [0002] With the rapid development of container technology in cloud computing and the increasing popularity of container technology, more and more enterprises are participating in container technology. The use of containers in cloud computing infrastructure and services has increased year by year. Container technology has triggered the development of information technology. A new round of revolution. At present, the following methods are mainly used for the allocation of container resources: one allocation method is to allocate according to the order in which instructions are received. This method does not consider the size of the resources required by different containers themselves, which is likely to cause resource waste; the other This allocation method is based on the different execution functions of the conta...

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
Patent Type & Authority Applications(China)
IPC IPC(8): G06F9/50H04L29/08
CPCG06F9/5044H04L67/10
Inventor 刘安
Owner SHANDONG LANGCHAO YUNTOU INFORMATION TECH CO LTD
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