CN112799775A - Node attribute transmission method and related device - Google Patents
Node attribute transmission method and related device Download PDFInfo
- Publication number
- CN112799775A CN112799775A CN202011598303.XA CN202011598303A CN112799775A CN 112799775 A CN112799775 A CN 112799775A CN 202011598303 A CN202011598303 A CN 202011598303A CN 112799775 A CN112799775 A CN 112799775A
- Authority
- CN
- China
- Prior art keywords
- attribute
- target
- node
- container
- declaration information
- 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
- 238000000034 method Methods 0.000 title claims abstract description 38
- 230000005540 biological transmission Effects 0.000 title abstract description 10
- 230000004044 response Effects 0.000 claims abstract description 9
- 238000012546 transfer Methods 0.000 claims description 17
- 238000012795 verification Methods 0.000 claims description 10
- 238000007726 management method Methods 0.000 claims description 9
- 238000002716 delivery method Methods 0.000 claims description 8
- 238000012545 processing Methods 0.000 claims description 8
- 230000006870 function Effects 0.000 claims description 6
- 238000013461 design Methods 0.000 abstract description 4
- 238000010586 diagram Methods 0.000 description 7
- 230000008569 process Effects 0.000 description 6
- 238000012986 modification Methods 0.000 description 2
- 230000004048 modification Effects 0.000 description 2
- 230000009286 beneficial effect Effects 0.000 description 1
- 238000005516 engineering process Methods 0.000 description 1
- 230000003287 optical effect Effects 0.000 description 1
Images
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/44—Arrangements for executing specific programs
- G06F9/455—Emulation; Interpretation; Software simulation, e.g. virtualisation or emulation of application or operating system execution engines
- G06F9/45533—Hypervisors; Virtual machine monitors
- G06F9/45558—Hypervisor-specific management and integration aspects
-
- 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/44—Arrangements for executing specific programs
- G06F9/455—Emulation; Interpretation; Software simulation, e.g. virtualisation or emulation of application or operating system execution engines
- G06F9/45533—Hypervisors; Virtual machine monitors
- G06F9/45558—Hypervisor-specific management and integration aspects
- G06F2009/45562—Creating, deleting, cloning virtual machine instances
-
- 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/44—Arrangements for executing specific programs
- G06F9/455—Emulation; Interpretation; Software simulation, e.g. virtualisation or emulation of application or operating system execution engines
- G06F9/45533—Hypervisors; Virtual machine monitors
- G06F9/45558—Hypervisor-specific management and integration aspects
- G06F2009/4557—Distribution of virtual machine instances; Migration and load balancing
-
- 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/44—Arrangements for executing specific programs
- G06F9/455—Emulation; Interpretation; Software simulation, e.g. virtualisation or emulation of application or operating system execution engines
- G06F9/45533—Hypervisors; Virtual machine monitors
- G06F9/45558—Hypervisor-specific management and integration aspects
- G06F2009/45591—Monitoring or debugging support
Landscapes
- Engineering & Computer Science (AREA)
- Software Systems (AREA)
- Theoretical Computer Science (AREA)
- Physics & Mathematics (AREA)
- General Engineering & Computer Science (AREA)
- General Physics & Mathematics (AREA)
- Information Retrieval, Db Structures And Fs Structures Therefor (AREA)
- Information Transfer Between Computers (AREA)
Abstract
The application discloses a node attribute transmission method and a related device, comprising the following steps: defining attribute labels of all empty nodes in a cluster of a resource scheduling system; writing the attribute tag into declaration information of at least one container group in the resource scheduling system, wherein at least one target container can be created in the container group; and in response to the attribute tags written in all the declaration information being valid, transferring the attribute of the target empty node into at least one target container identical to the attribute tag thereof. Through the design scheme, the attribute of the corresponding node can be transmitted to the container service according to the requirement after the container group is dynamically scheduled, so that the intrusiveness of the container service is reduced, and the flexibility and the effectiveness of the transmission process are improved.
Description
Technical Field
The present application relates to the field of containerized application technologies, and in particular, to a node attribute transfer method and a related apparatus.
Background
The resource scheduling system (kubernets) is an open source platform for managing containerized applications on multiple hosts in a cloud platform. Kubernetes can create a container group (Pod) in a Node (Node), which provides a computing resource management capability and can dynamically schedule the Pod according to the Node resource condition. In practical application, the kubernets cluster has the condition that the node attributes are different. Container services often need to run on nodes of different attributes, such as cross-availability nodes, meet high availability needs, and the like. The container service in the Pod needs to acquire the attribute of the node where the container service is located, and perform logic processing according to the attribute, for example, preferentially perform service call in the same available area.
In the prior art, the following two solutions are generally adopted: 1) adding logic at a service starting inlet of Pod (Pod) container service, and acquiring attribute information from a unified node attribute management service; 2) when the container service is deployed, the node attribute is assigned in a plurality of deployment task associations. However, the method 1 has high service intrusiveness, a service entry needs to introduce specific logic and depends on a uniform node attribute to manage the service, and the method 2 needs to perform multiple declaration deployment according to the node attribute, thereby resulting in a complex process and low flexibility. Therefore, it is necessary to provide a new node attribute delivery method to solve the above problems.
Disclosure of Invention
The technical problem mainly solved by the application is to provide a node attribute transfer method and a related device, which can transfer the attribute of a corresponding node to a container service according to needs, and improve the flexibility.
In order to solve the technical problem, the application adopts a technical scheme that: a node attribute delivery method is provided, which comprises the following steps: defining attribute labels of all empty nodes in a cluster of a resource scheduling system; writing the attribute tag into declaration information of at least one container group in the resource scheduling system, wherein at least one target container can be created in the container group; in response to all of the attribute tags written in the declaration information being valid, passing the attribute of the target empty node into at least one of the target containers whose attribute tag is the same.
Wherein the step of responding that the attribute tag written in all the declaration information is valid comprises: in response to determining with a verification tool that all of the attribute tags written by the declaration information are valid.
Wherein the verification tool is disposed in an application interface service.
Wherein, before the step of transferring the attribute of the target empty node into at least one target container with the same attribute label, the method comprises the following steps: storing all the declaration information in a metadata management service.
Wherein the step of transferring the attribute of the target empty node into at least one target container with the same attribute label comprises: creating at least one of the target containers under the group of containers and referring the declaration information to the target container; passing the attributes of the target empty node into the target container.
Wherein, all the empty nodes are provided with node proxy service, and before the step of transferring the attribute of the target empty node to at least one target container with the same attribute label, the method further comprises the following steps: scheduling the group of containers to the target empty node using a container scheduling service; and analyzing and acquiring the declaration information of the container group by using the node proxy service.
Wherein the step of transferring the attribute of the target empty node into at least one target container with the same attribute label as the target empty node comprises: passing the attributes of the target empty node into the target container using the node proxy service.
Wherein after the step of passing the attribute of the target empty node into at least one of the target containers having the same attribute label as the target empty node, the method further comprises: and starting at least one target container, wherein the target container runs on the target empty node and performs logic processing according to the attribute of the target empty node.
In order to solve the above technical problem, another technical solution adopted by the present application is: there is provided a node attribute transfer apparatus, including a memory and a processor, which are coupled to each other, wherein the memory stores program instructions, and the processor is configured to execute the program instructions to implement the node attribute transfer method according to any of the above embodiments.
In order to solve the above technical problem, the present application adopts another technical solution: there is provided an apparatus having a storage function, which stores program data that can be read by a computer, the program data being executable by a processor to implement the node attribute delivery method according to any one of the above embodiments.
Different from the prior art, the beneficial effects of the application are that: defining attribute labels of all empty nodes in a cluster of a resource scheduling system; writing the attribute tag into declaration information of at least one container group in the resource scheduling system, wherein at least one target container can be created in the container group; and in response to the attribute tags written in all the declaration information being valid, transferring the attribute of the target empty node into at least one target container identical to the attribute tag thereof. Through the design scheme, the attribute of the corresponding node can be transmitted to the container service according to the requirement after the container group is dynamically scheduled, so that the intrusiveness of the container service is reduced, and the flexibility and the effectiveness of the transmission process are improved.
Drawings
In order to more clearly illustrate the technical solutions in the embodiments of the present application, the drawings needed to be used in the description of the embodiments are briefly introduced below, and it is obvious that the drawings in the following description are only some embodiments of the present application, and it is obvious for those skilled in the art to obtain other drawings based on these drawings without creative efforts. Wherein:
FIG. 1 is a flowchart illustrating an embodiment of a node attribute delivery method according to the present application;
FIG. 2 is a schematic flow chart illustrating an embodiment of step S3 in FIG. 1;
FIG. 3 is a schematic flow chart diagram illustrating one embodiment of a step prior to step S3 in FIG. 1;
FIG. 4 is a diagram illustrating a specific implementation process of the node attribute delivery method according to the present application;
FIG. 5 is a schematic structural diagram of an embodiment of a node attribute delivery apparatus according to the present application;
fig. 6 is a schematic diagram of a framework of an embodiment of the device with a storage function according to the present application.
Detailed Description
The technical solutions in the embodiments of the present application will be clearly and completely described below with reference to the drawings in the embodiments of the present application, and it is obvious that the described embodiments are only a part of the embodiments of the present application, and not all the embodiments. All other embodiments, which can be derived by a person skilled in the art from the embodiments given herein without making any creative effort, shall fall within the protection scope of the present application.
Referring to fig. 1, fig. 1 is a flowchart illustrating an embodiment of a node attribute transmission method according to the present application. The method comprises the following steps:
s1: attribute tags for all empty nodes in a cluster of the resource scheduling system are defined.
Specifically, in this embodiment, the attribute tag of the empty node may be defined according to the requirement of logic processing, where the form of the attribute tag may be multiple, and may be set according to the requirement, which is not limited herein. Of course, in other embodiments, only the attribute labels of one or some of the empty nodes in the cluster of the resource scheduling system may be defined, as long as the empty nodes are guaranteed to have free resources for the subsequent container service to run, which is not limited herein.
In particular, all empty nodes in a cluster may be defined to be the same attribute label. Of course, in other embodiments, a part of empty nodes in the cluster may also be defined as one attribute tag, and the rest of empty nodes may also be defined as another attribute tag, and the attribute tags of the empty nodes in the cluster may be defined as needed, which is not limited herein. In addition, the type of the empty node may be one or more according to different defined attribute tags, which is not limited herein.
S2: and writing the attribute tag into declaration information of at least one container group in the resource scheduling system, wherein at least one target container can be created in the container group.
Specifically, in this embodiment, the attribute tag of the empty node in step S1 is written into the declaration information of the container group in the resource scheduling system, where the attribute tag may be written into the declaration information of one of the container groups, or the attribute tags may be written into the declaration information of a plurality of container groups, which is not limited in this application.
Specifically, the above-mentioned declaration information may be in the form of an environment variable or a configuration file, and the present application is not limited thereto.
S3: and in response to the attribute tags written in all the declaration information being valid, transferring the attribute of the target empty node into at least one target container identical to the attribute tag thereof.
Through the design scheme, the attribute of the corresponding node can be transmitted to the container service according to the requirement after the container group is dynamically scheduled, so that the flexibility and the effectiveness of the transmission process are improved.
Specifically, the step of responding in step S3 that the attribute tag written in all the declaration information is valid specifically includes: in response to the fact that the attribute tags written in all the declaration information are judged to be valid by using the verification tool, the validity of the attribute tags in the declaration information of the container group can be guaranteed in such a way, and therefore the accuracy of the subsequent transfer process is improved.
Specifically, in this embodiment, the verification tool is disposed in the application interface service, where the verification tool may be a Pod Template Valid verification tool, and of course, in other embodiments, other tools having a verification function may also be adopted, which is not limited in this application.
In one embodiment, with continuing reference to fig. 1, the foregoing step S3, before the step of transferring the attribute of the target empty node into at least one target container having the same attribute tag as the target empty node, includes: all declaration information is stored in a metadata management service to properly maintain all declaration information.
Specifically, before the attribute of the target empty node is transferred into at least one target container with the same attribute label, the method further includes: and judging whether the attribute tags written in all the declaration information are valid or not by using a checking tool.
If the attribute tag written in all the declaration information is valid, all the declaration information is stored in the metadata management service to properly maintain all the declaration information.
If the attribute tags written in one or more statement information are invalid, the statement information with errors is modified, and then a check tool is used for judging after modification until the attribute tags written in all the statement information are valid, and the attribute tags are stored in the metadata management service so as to properly maintain all the statement information.
Specifically, in this embodiment, it may be determined whether the formats of the attribute tags written in all the declaration information are correct, and in other embodiments, it may also be determined whether the spellings of the attribute tags written in all the declaration information are correct, or whether the formats or the spellings are both correct.
Through the implementation mode, the validity of the attribute tags in the declaration information of the container group can be ensured, so that the accuracy of the subsequent transfer process is improved.
Specifically, please refer to fig. 2, wherein fig. 2 is a flowchart illustrating an embodiment of step S3 in fig. 1. The step S3 specifically includes:
s30: at least one target container is created under the container group and the declaration information is referenced in the target container.
S31: the attributes of the target empty node are passed into the target container.
Specifically, in the present embodiment, since claim information in the container group is referred to in the target container, the attribute tag in the claim information in the target container is the same as the attribute tag written in the claim information in the container group. Of course, the attribute of the target empty node may be transferred to one target container, or the attribute of the target empty node may be transferred to a plurality of target containers, which is not limited herein as the case may be. By the method, the attribute labels in the declaration information in the target container are ensured to be the same as the attribute labels written in the declaration information in the container group, so that the attributes of the corresponding target empty nodes are transmitted to the target container, and the target container is ensured to run preferentially on the target empty nodes in the same available area.
Specifically, in the present embodiment, please refer to fig. 3, and fig. 3 is a flowchart illustrating an embodiment of a step before step S3 in fig. 1. Before step S3, the method further includes:
s40: the group of containers is scheduled to the target empty node using a container scheduling service.
In particular, the container scheduling service is used to schedule one or more container groups to a target empty node, which is not limited herein. Specifically, in this embodiment, the container scheduling service dynamically schedules the container group to a target empty node with idle resources, so as to ensure that the target empty node can run at least one target container created under the container group.
S41: and analyzing and acquiring the declaration information of the container group by using the node proxy service.
Specifically, in this embodiment, please refer to fig. 2 and fig. 3 together, after the declaration information of the container group is parsed and obtained by using the node broker service, step S30 is entered, at least one target container is created under the container group, the declaration information is referred to the target container, and the attribute of the target empty node is transferred to the target container. Since the attribute tag written in the declaration information in the container group is the same as the attribute tag of the target empty node, the attribute tag in the declaration information in the target container is also the same as the attribute tag written in the declaration information in the container group. By the method, the attribute of the corresponding target empty node can be transmitted to the target container, and the target container is guaranteed to run on the target empty node in the same available area preferentially.
Specifically, in this embodiment, all the empty nodes are provided with a node proxy service to parse and obtain declaration information of the container group and create at least one target container under the container group.
In another embodiment, with continuing reference to fig. 1, the step of transferring the attribute of the target empty node to at least one of the target containers with the same attribute tag in step S3 specifically includes: and transmitting the attribute of the target empty node into the target container by using the node proxy service so as to transmit the attribute of the corresponding target empty node into the target container.
In yet another embodiment, after step S3 in fig. 1, that is, after the step of transferring the attribute of the target empty node into the at least one target container having the same attribute tag as the target empty node, the method further includes: and starting at least one target container, wherein the target container runs on the corresponding target empty node, and performs logic processing according to the attribute of the target empty node so as to execute different application actions.
Specifically, please refer to fig. 4, fig. 4 is a schematic diagram of an implementation process of the node attribute transmission method of the present application. In particular, the resource scheduling system includes an application interface service 10, a container scheduling service 12, a node proxy service 14, a metadata management service 16, and a container service 18. The method specifically comprises the following steps:
s100: in the application interface service 10, attribute labels of all null nodes in the cluster of the resource scheduling system are defined, for example, the attribute labels of all null nodes in the cluster of the resource scheduling system are defined as a.
S101: in the application interface service 10, the attribute tag is written into declaration information of at least one container group in the resource scheduling system, wherein at least one target container can be created in the container group. Specifically, the declaration information is exemplified as follows:
s102: all the declaration information is judged and modified by using a verification tool in the application interface service 10 until the attribute tag written therein is valid.
S103: all declaration information is stored in the metadata management service 16.
S104: the application interface service 10 obtains declaration information of the container group, and the container scheduling service 12 schedules the container group to a target empty node with idle resources and continuously schedules other container groups to other target empty nodes with idle resources.
S105: when the container group is scheduled to the target empty node, the node proxy service 14 parses and acquires the declaration information of the container group, and the application interface service 10 acquires the declaration information of the parsed container group.
S106: the node proxy service 14 creates at least one target container under the container group and references the declaration information into the target container and passes the attributes of the target empty node into the same target container as its attribute label.
S107: at least one target container is started in the container service 18, which runs on a corresponding target empty node and performs logical processing according to the attributes of the target empty node.
By the method, the attribute of the corresponding node can be transmitted to the container service according to the requirement after the container group is dynamically scheduled, so that the intrusiveness of the container service is reduced, and the flexibility and the effectiveness of the transmission process are improved.
Referring to fig. 5, fig. 5 is a schematic structural diagram of an embodiment of a node attribute transfer apparatus according to the present application, the apparatus includes a memory 200 and a processor 202 coupled to each other, the memory 200 stores program instructions, and the processor 202 is configured to execute the program instructions to implement the node attribute transfer method mentioned in any of the embodiments.
Specifically, the processor 202 may also be referred to as a CPU (Central Processing Unit). The processor 202 may be an integrated circuit chip having signal processing capabilities. The Processor 202 may also be a general purpose Processor, a Digital Signal Processor (DSP), an Application Specific Integrated Circuit (ASIC), a Field Programmable Gate Array (FPGA) or other Programmable logic device, discrete Gate or transistor logic, discrete hardware components. A general purpose processor may be a microprocessor or the processor may be any conventional processor or the like. In addition, processor 202 may be implemented collectively by a plurality of integrated circuit chips.
Referring to fig. 6, fig. 6 is a schematic diagram of a framework of an embodiment of a device with a storage function according to the present application. The apparatus 30 stores program data 300, which can be read by a computer, and the program data 300 can be executed by a processor for implementing the node attribute transfer method mentioned in any of the above embodiments. The program data 300 may be stored in the apparatus 30 with a storage function in the form of a software product, and includes several instructions to enable a computer device (which may be a personal computer, a server, or a network device) or a processor (processor) to execute all or part of the steps of the method according to the embodiments of the present application. The aforementioned storage device includes: various media capable of storing program codes, such as a usb disk, a mobile hard disk, a Read-Only Memory (ROM), a Random Access Memory (RAM), a magnetic disk or an optical disk, or terminal devices, such as a computer, a server, a mobile phone, and a tablet.
In summary, unlike the prior art, the present application defines attribute labels of all empty nodes in a cluster of a resource scheduling system; writing the attribute tag into declaration information of at least one container group in the resource scheduling system, wherein at least one target container can be created in the container group; and in response to the attribute tags written in all the declaration information being valid, transferring the attribute of the target empty node into at least one target container identical to the attribute tag thereof. Through the design scheme, the attribute of the corresponding node can be transmitted to the container service according to the requirement after the container group is dynamically scheduled, so that the intrusiveness of the container service is reduced, and the flexibility and the effectiveness of the transmission process are improved.
The above description is only for the purpose of illustrating embodiments of the present application and is not intended to limit the scope of the present application, and all modifications of equivalent structures and equivalent processes, which are made by the contents of the specification and the drawings of the present application or are directly or indirectly applied to other related technical fields, are also included in the scope of the present application.
Claims (10)
1. A node attribute delivery method is characterized by comprising the following steps:
defining attribute labels of all empty nodes in a cluster of a resource scheduling system;
writing the attribute tag into declaration information of at least one container group in the resource scheduling system, wherein at least one target container can be created in the container group;
in response to all of the attribute tags written in the declaration information being valid, passing the attribute of the target empty node into at least one of the target containers whose attribute tag is the same.
2. The transfer method according to claim 1, wherein the step of responding that the attribute tag written in all the declaration information is valid includes:
in response to determining with a verification tool that all of the attribute tags written by the declaration information are valid.
3. The transfer method of claim 2,
the verification tool is disposed in an application interface service.
4. The transfer method according to claim 2, wherein the step of transferring the attribute of the target empty node into the at least one target container having the same attribute label as the target empty node is preceded by:
storing all the declaration information in a metadata management service.
5. The delivery method according to claim 1, wherein the step of delivering the attribute of the target empty node into at least one of the target containers having the same attribute label as the target empty node comprises:
creating at least one of the target containers under the group of containers and referring the declaration information to the target container;
passing the attributes of the target empty node into the target container.
6. The transfer method according to claim 1, wherein all said null nodes are provided with a node proxy service, and before the step of transferring the attribute of the target null node into at least one said target container having the same attribute label as the target null node, further comprising:
scheduling the group of containers to the target empty node using a container scheduling service;
and analyzing and acquiring the declaration information of the container group by using the node proxy service.
7. The transfer method according to claim 6, wherein the step of transferring the attribute of the target empty node into at least one of the target containers having the same attribute label as the target empty node comprises:
passing the attributes of the target empty node into the target container using the node proxy service.
8. The method of claim 1, wherein after the step of transferring the attribute of the target empty node into the at least one target container having the same attribute tag as the target empty node, the method further comprises:
and starting at least one target container, wherein the target container runs on the target empty node and performs logic processing according to the attribute of the target empty node.
9. A node property transfer apparatus comprising a memory and a processor coupled to each other, the memory storing program instructions, and the processor being configured to execute the program instructions to implement the node property transfer method according to any one of claims 1 to 8.
10. An apparatus having a storage function, wherein program data is stored which can be read by a computer, the program data being executable by a processor to implement the node attribute delivery method according to any one of claims 1 to 8.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202011598303.XA CN112799775B (en) | 2020-12-29 | 2020-12-29 | Node attribute transfer method and related device |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202011598303.XA CN112799775B (en) | 2020-12-29 | 2020-12-29 | Node attribute transfer method and related device |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN112799775A true CN112799775A (en) | 2021-05-14 |
| CN112799775B CN112799775B (en) | 2024-05-14 |
Family
ID=75805700
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN202011598303.XA Active CN112799775B (en) | 2020-12-29 | 2020-12-29 | Node attribute transfer method and related device |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN112799775B (en) |
Citations (11)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US6343291B1 (en) * | 1999-02-26 | 2002-01-29 | Hewlett-Packard Company | Method and apparatus for using an information model to create a location tree in a hierarchy of information |
| US20160104005A1 (en) * | 2014-10-10 | 2016-04-14 | Salesforce.Com, Inc. | Facilitating tenant-based customization of access and security controls in an on-demand services environment |
| CN105740250A (en) * | 2014-12-09 | 2016-07-06 | 北大方正集团有限公司 | Method and device for establishing property index of XML node |
| CN110198231A (en) * | 2018-05-08 | 2019-09-03 | 腾讯科技（深圳）有限公司 | Capacitor network management method and system and middleware for multi-tenant |
| CN110221901A (en) * | 2019-06-06 | 2019-09-10 | 深圳前海微众银行股份有限公司 | Container asset creation method, apparatus, equipment and computer readable storage medium |
| CN111352717A (en) * | 2020-03-24 | 2020-06-30 | 广西梯度科技有限公司 | Method for realizing kubernets self-defined scheduler |
| US20200218798A1 (en) * | 2019-01-03 | 2020-07-09 | NeuVector, Inc. | Automatic deployment of application security policy using application manifest and dynamic process analysis in a containerization environment |
| CN111464659A (en) * | 2020-04-27 | 2020-07-28 | 广州虎牙科技有限公司 | Node scheduling method, node pre-selection processing method, device, equipment and medium |
| CN111526168A (en) * | 2019-02-01 | 2020-08-11 | 华为技术有限公司 | Scheduling management method and device for Network Function Virtualization (NFV) architecture |
| CN111966305A (en) * | 2020-10-22 | 2020-11-20 | 腾讯科技（深圳）有限公司 | Persistent volume allocation method and device, computer equipment and storage medium |
| CN112003961A (en) * | 2020-08-14 | 2020-11-27 | 苏州浪潮智能科技有限公司 | Resource exposure method, system, equipment and medium in kubernets |
-
2020
- 2020-12-29 CN CN202011598303.XA patent/CN112799775B/en active Active
Patent Citations (11)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US6343291B1 (en) * | 1999-02-26 | 2002-01-29 | Hewlett-Packard Company | Method and apparatus for using an information model to create a location tree in a hierarchy of information |
| US20160104005A1 (en) * | 2014-10-10 | 2016-04-14 | Salesforce.Com, Inc. | Facilitating tenant-based customization of access and security controls in an on-demand services environment |
| CN105740250A (en) * | 2014-12-09 | 2016-07-06 | 北大方正集团有限公司 | Method and device for establishing property index of XML node |
| CN110198231A (en) * | 2018-05-08 | 2019-09-03 | 腾讯科技（深圳）有限公司 | Capacitor network management method and system and middleware for multi-tenant |
| US20200218798A1 (en) * | 2019-01-03 | 2020-07-09 | NeuVector, Inc. | Automatic deployment of application security policy using application manifest and dynamic process analysis in a containerization environment |
| CN111526168A (en) * | 2019-02-01 | 2020-08-11 | 华为技术有限公司 | Scheduling management method and device for Network Function Virtualization (NFV) architecture |
| CN110221901A (en) * | 2019-06-06 | 2019-09-10 | 深圳前海微众银行股份有限公司 | Container asset creation method, apparatus, equipment and computer readable storage medium |
| CN111352717A (en) * | 2020-03-24 | 2020-06-30 | 广西梯度科技有限公司 | Method for realizing kubernets self-defined scheduler |
| CN111464659A (en) * | 2020-04-27 | 2020-07-28 | 广州虎牙科技有限公司 | Node scheduling method, node pre-selection processing method, device, equipment and medium |
| CN112003961A (en) * | 2020-08-14 | 2020-11-27 | 苏州浪潮智能科技有限公司 | Resource exposure method, system, equipment and medium in kubernets |
| CN111966305A (en) * | 2020-10-22 | 2020-11-20 | 腾讯科技（深圳）有限公司 | Persistent volume allocation method and device, computer equipment and storage medium |
Non-Patent Citations (3)
| Title |
|---|
| STACK OVERFLOW用户: "如何在Kubernetes中将Node-Labels继承到Pod-Labels?", pages 1, Retrieved from the Internet <URL:https://cloud.tencent.com/developer/ask/sof/1400529> * |
| YUQI FU等: "Progress-based Container Scheduling for Short-lived Applications in a Kubernetes Cluster", 《2019 IEEE INTERNATIONAL CONFERENCE ON BIG DATA (BIG DATA)》, 24 February 2020 (2020-02-24) * |
| 李思达: "基于Kubernetes的调度方案研究与设计", 《中国优秀硕士学位论文全文数据库 信息科技辑》, 15 May 2019 (2019-05-15) * |
Also Published As
| Publication number | Publication date |
|---|---|
| CN112799775B (en) | 2024-05-14 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN108156022B (en) | Service calling method and device and electronic equipment | |
| WO2017166447A1 (en) | Method and device for loading kernel module | |
| KR20050076750A (en) | Adaptive dispatch of received messages to code using inter-positioned message modification | |
| US10303529B2 (en) | Protocol for communication of data structures | |
| CN108829467B (en) | Third-party platform docking implementation method, device, equipment and storage medium | |
| CN111125107A (en) | Data processing method, device, electronic equipment and medium | |
| CN113703862A (en) | Configuration-based interface calling method, device, equipment and storage medium | |
| CN106326129A (en) | Program abnormity information generating method and device | |
| CN112463729A (en) | Data file storage method and device, electronic equipment and medium | |
| CN112650804B (en) | Big data access method, device, system and storage medium | |
| CN109683992B (en) | Method and apparatus for managing objects | |
| WO2023208012A1 (en) | Program processing method and apparatus, program running method and apparatus, terminal, smart card and storage medium | |
| CN113176907A (en) | Interface data calling method and device, computer system and readable storage medium | |
| CN112799775B (en) | Node attribute transfer method and related device | |
| CN114884915B (en) | Message processing method, device and equipment based on gray release | |
| CN110795646A (en) | Request processing method and device, electronic equipment and computer-readable storage medium | |
| CN112988604B (en) | Object testing method, testing system, electronic device and readable storage medium | |
| CN112953996B (en) | Service method and system thereof | |
| CN113626222A (en) | Message processing method and device, computer equipment and storage medium | |
| CN111400058A (en) | Method and device for calling message, computer equipment and storage medium | |
| CN111324778A (en) | Data and service processing method and device and electronic equipment | |
| CN114138507B (en) | Python program service method, device and computer readable storage medium | |
| CN109901826B (en) | Data processing method and device for Java program and electronic equipment | |
| CN117792902A (en) | Data management method, device, equipment and medium | |
| CN116757689A (en) | Request processing method and device, electronic equipment and computer 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 | ||
| GR01 | Patent grant | ||
| GR01 | Patent grant |