CN116204248A - Configuration system of cluster server - Google Patents
Configuration system of cluster server Download PDFInfo
- Publication number
- CN116204248A CN116204248A CN202310496648.1A CN202310496648A CN116204248A CN 116204248 A CN116204248 A CN 116204248A CN 202310496648 A CN202310496648 A CN 202310496648A CN 116204248 A CN116204248 A CN 116204248A
- Authority
- CN
- China
- Prior art keywords
- data processing
- server
- historical
- target
- processing amount
- 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 claims abstract description 22
- 238000004590 computer program Methods 0.000 claims abstract description 13
- 238000009434 installation Methods 0.000 claims description 22
- 238000013468 resource allocation Methods 0.000 claims description 9
- 230000006870 function Effects 0.000 claims description 6
- 239000002699 waste material Substances 0.000 abstract description 5
- 230000009286 beneficial effect Effects 0.000 description 3
- 230000002349 favourable effect Effects 0.000 description 1
- 238000012986 modification Methods 0.000 description 1
- 230000004048 modification Effects 0.000 description 1
- 238000013515 script Methods 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/445—Program loading or initiating
- G06F9/44505—Configuring for program initiating, e.g. using registry, configuration files
-
- 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/46—Multiprogramming arrangements
- G06F9/50—Allocation of resources, e.g. of the central processing unit [CPU]
- G06F9/5005—Allocation of resources, e.g. of the central processing unit [CPU] to service a request
- G06F9/5027—Allocation of resources, e.g. of the central processing unit [CPU] to service a request the resource being a machine, e.g. CPUs, Servers, Terminals
-
- 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/46—Multiprogramming arrangements
- G06F9/50—Allocation of resources, e.g. of the central processing unit [CPU]
- G06F9/5061—Partitioning or combining of resources
- G06F9/5066—Algorithms for mapping a plurality of inter-dependent sub-tasks onto a plurality of physical CPUs
-
- Y—GENERAL TAGGING OF NEW TECHNOLOGICAL DEVELOPMENTS; GENERAL TAGGING OF CROSS-SECTIONAL TECHNOLOGIES SPANNING OVER SEVERAL SECTIONS OF THE IPC; TECHNICAL SUBJECTS COVERED BY FORMER USPC CROSS-REFERENCE ART COLLECTIONS [XRACs] AND DIGESTS
- Y02—TECHNOLOGIES OR APPLICATIONS FOR MITIGATION OR ADAPTATION AGAINST CLIMATE CHANGE
- Y02D—CLIMATE CHANGE MITIGATION TECHNOLOGIES IN INFORMATION AND COMMUNICATION TECHNOLOGIES [ICT], I.E. INFORMATION AND COMMUNICATION TECHNOLOGIES AIMING AT THE REDUCTION OF THEIR OWN ENERGY USE
- Y02D10/00—Energy efficient computing, e.g. low power processors, power management or thermal management
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 Transfer Between Computers (AREA)
Abstract
The invention relates to the technical field of server deployment and provides a configuration system of a cluster server, which comprises the following components: the target server identification list, the processor and the memory storing the computer program, when the computer program is executed by the processor, the following steps are implemented: acquiring a first historical starting time length list corresponding to a target server identification list; acquiring a second historical starting time length list corresponding to the target server identification list; acquiring a first intermediate starting time length; acquiring a second intermediate starting time length; and acquiring configuration time length started after the target server finishes deployment according to the first intermediate starting time length and the second intermediate starting time length. According to the method and the system, the resource configuration of the server can be automatically adjusted, the configuration time length started after the target server finishes the deployment is determined according to the resource configuration of the server and the historical deployment time consumption, the most reasonable configuration time length can be obtained, the resource waste is avoided, and the system operation efficiency is improved.
Description
Technical Field
The invention relates to the technical field of server deployment, in particular to a configuration system of a cluster server.
Background
Along with the rapid development of the internet, one service often corresponds to a plurality of servers, accurate and rapid deployment of a large-scale cluster server is very necessary, the existing deployment method of the cluster server mostly deploys or manually analyzes by manually deploying some scripts to generate configuration files, the configuration files are in one-to-one correspondence with the servers to be configured, the configuration files are analyzed to generate deployment tasks, and further, the servers are deployed according to the set deployment time.
However, the above method also has the following technical problems:
in the process of deploying the server, the server can be deployed only according to the manually set time length, the resource configuration of the server cannot be automatically adjusted, the most reasonable deployment time consumption cannot be automatically obtained according to the historical deployment time consumption and the resource configuration of the server, the resource waste is easily caused, and the running efficiency of the system is reduced.
Disclosure of Invention
Aiming at the technical problems, the invention adopts the following technical scheme:
a configuration system of a cluster server, comprising: target server identification list a= { a 1 ，A 2 ，……A i ，……，A m A processor and a memory storing a computer program, wherein A i For the i-th target server identification, i=1, 2 … … m, m is the target server number, when the computer program is executed by the processor, the following steps are implemented:
s100, acquiring a first historical starting time list B= { B corresponding to A 1 ，B 2 ，……，B i ，……，B m }，B i ={B i1 ，B i2 ，……，B ij ，……，B in }，B ij Is A i And j=1, 2 … … n and n are the number of the first historical starting time periods, wherein the first historical starting time period is the time period of starting the target server after deployment is completed in the first historical time slice.
S200, acquiring a second historical starting time length list C= { C corresponding to the A 1 ，C 2 ，……，C i ，……，C m }，C i ={C i1 ，C i2 ，……，C ir ，……，C is }，C ir Is A i And the corresponding r-th second historical starting time length, wherein r=1, 2 … … s and s are the number of the second historical starting time lengths, and the second historical starting time length is the time length of starting the target server after deployment is completed in the second historical time slice.
S300, acquiring a first intermediate starting duration D corresponding to the B according to the B, wherein the D meets the following conditions:
D=∑ m i=1 ((∑ n j=1 (B ij )-max(B ij )-min(B ij ) (n-2))/m, where max () is a function of obtaining a maximum value and min () is a function of obtaining a minimum value.
S400, acquiring a second intermediate starting duration E corresponding to C according to the C, wherein E meets the following conditions:
E=∑ m i=1 ((∑ s r=1 (C ir )-max(C ir )-min(C ir ))/(s-2))/m。
s500, when the I D-E I is not less than T 0 When E is determined to be the configuration duration T, T started after the target server completes deployment 0 Is a preset time difference.
S600 when the absolute value of D-E is smaller than T 0 And when the method is used, determining the D as the configuration duration T started after the target server completes deployment.
The invention has at least the following beneficial effects:
the invention provides a configuration system of a cluster server, which comprises: the target server identification list, the processor and the memory storing the computer program, when the computer program is executed by the processor, the following steps are implemented: acquiring a first historical starting time length list corresponding to a target server identification list; acquiring a second historical starting time length list corresponding to the target server identification list; acquiring a first intermediate starting time length; acquiring a second intermediate starting time length; and acquiring configuration time length started after the target server finishes deployment according to the first intermediate starting time length and the second intermediate starting time length. The method and the system can automatically adjust the resource configuration of the server, acquire the first historical starting time list and the second historical starting time list according to the resource configuration and the historical deployment time consumption of the server, further acquire the first intermediate starting time and the second intermediate starting time, compare the first intermediate starting time and the second intermediate starting time to determine the configuration time of the target server after completing deployment, acquire the most reasonable configuration time, avoid wasting resources and be beneficial to improving the operation efficiency of the system.
Drawings
In order to more clearly illustrate the technical solutions of the embodiments of the present invention, the drawings required for the description of the embodiments will be briefly described below, and it is apparent that the drawings in the following description are only some embodiments of the present invention, and other drawings may be obtained according to these drawings without inventive effort for a person skilled in the art.
Fig. 1 is a flowchart of a configuration system of a cluster server executing a computer program according to an embodiment of the present invention.
Detailed Description
The following description of the embodiments of the present invention will be made clearly and completely with reference to the accompanying drawings, in which it is apparent that the embodiments described are only some embodiments of the present invention, but not all embodiments. All other embodiments, which can be made by those skilled in the art based on the embodiments of the invention without making any inventive effort, are intended to fall within the scope of the invention.
The embodiment of the invention provides a configuration of a cluster serverA system, comprising: target server identification list a= { a 1 ，A 2 ，……，A i ，……，A m A processor and a memory storing a computer program, wherein A i For the i-th target server identifier, i=1, 2 … … m, m is the number of target servers, the target server identifier is the unique identity of the target server, and when the computer program is executed by the processor, the following steps are implemented, as shown in fig. 1:
s100, acquiring a first historical starting time list B= { B corresponding to A 1 ，B 2 ，……，B i ，……，B m }，B i ={B i1 ，B i2 ，……，B ij ，……，B in }，B ij Is A i And j=1, 2 … … n and n are the number of the first historical starting time periods, wherein the first historical starting time period is the time period of starting the target server after deployment is completed in the first historical time slice.
Specifically, the ending time point of the first historical time slice is the current time point t 0 。
Further, the starting time point of the first historical time slice is t 1 Wherein t is 1 =t 0 Δt, Δt being a preset first historical time slice length.
Further, Δt has a value ranging from [30, 60], and those skilled in the art know that the first historical time slice length is set according to actual requirements.
Further, the first historical time slice length units are: and (3) days.
Specifically, the step S100 includes the steps of:
s101, acquiring a first key starting time length list F= { F corresponding to A 1 ，F 2 ，……，F i ，……，F m }，F i ={F i1 ，F i2 ，……，F ij ，……，F in }，F ij For a first historical time slice A i A corresponding j-th first key starting time length, wherein the first key starting time length is a target serverWhen the post-deployment start-up foundation is completed, those skilled in the art know that any method for obtaining the post-deployment start-up foundation of the server in the prior art belongs to the protection scope of the present invention.
Specifically, the unit of the first key start-up duration is: millisecond.
S103, acquiring a second key starting time length list G= { G corresponding to the A 1 ，G 2 ，……，G i ，……，G m }，G i ={G i1 ，G i2 ，……，G ij ，……，G in }，G ij For a first historical time slice A i The corresponding j-th second key starting duration, where the second key starting duration is the lowest time consumption of starting after the target server completes deployment, and those skilled in the art know that any method for obtaining the lowest time consumption of starting after the server completes deployment in the prior art belongs to the protection scope of the present invention, and is not described herein.
Specifically, the unit of the second key start-up duration is: millisecond.
S105, acquiring a first preset weight list H= { H corresponding to G 1 ，H 2 ，……，H i ，……，H m }，H i ={H i1 ，H i2 ，……，H ij ，……，H in }，H ij Is G ij The corresponding first preset weight is a weight capable of enabling the starting time consumption of the target server after deployment to reach the lowest time consumption, and the first preset weight is set by a person skilled in the art according to actual requirements as known by the person skilled in the art.
Specifically, the unit of the first preset weight is: and (5) luxury core.
S107 according to F ij 、G ij And H ij Acquisition of B ij Wherein B is ij Meets the following conditions:
B ij =F ij +(G ij -F ij )/(min(R ij ，H ij )/H ij )，R ij is A i Corresponding j-th second preset weight, second presetThe weight is a weight for adjusting the first historical starting duration according to the server resource configuration of the target server, and the person skilled in the art knows that the second preset weight is set by the person skilled in the art according to the actual requirement.
Specifically, the unit of the second preset weight is: and (5) luxury core.
According to the method, the first accurate historical starting time list can be obtained according to the first key starting time, the second key starting time and the first preset weight in the first historical time slice, further, the first intermediate starting time is obtained, the configuration time of starting after the target server is deployed is determined by comparing the first intermediate starting time and the second intermediate starting time, the most reasonable configuration time can be obtained, resource waste is avoided, and the operation efficiency of the system is improved.
Specifically, the step S107 is preceded by the steps of:
s1, acquiring a preset resource allocation list U= { U corresponding to A 1 ，U 2 ，……，U i ，……，U m }，U i ={U i1 ，U i2 ，U i3 }，U i1 Is A i Corresponding to the preset CPU data processing amount, U i2 Is A i Corresponding preset GPU data processing amount, U i3 Is A i The corresponding preset memory data processing amount, wherein, the preset CPU data processing amount, the preset GPU data processing amount and the preset memory data processing amount are known to those skilled in the art, and are set by those skilled in the art according to actual requirements.
S2, acquiring a first intermediate resource configuration list V= { V corresponding to A 1 ，V 2 ，……，V i ，……，V m }，V i ={V i1 ，V i2 ，V i3 }，V i1 Is A i Corresponding first intermediate CPU data processing amount, V i2 Is A i Corresponding first intermediate GPU data processing amount, V i3 Is A i Corresponding first intermediate memory data processing amount, wherein the first intermediate CPU data processing amount is actual CPU data processing required by the operation of the target serverThe first intermediate GPU data processing amount is an actual GPU data processing amount required by the operation of the target server, and the first intermediate memory data processing amount is an actual memory data processing amount required by the operation of the target server, and those skilled in the art know that any method for obtaining the CPU data processing amount, the GPU data processing amount and the memory data processing amount required by the operation of the server in the prior art belongs to the protection scope of the present invention, and is not described herein.
S3, according to U and V, acquiring a first resource duty ratio list Z= { Z corresponding to A 1 ，Z 2 ，……，Z i ，……，Z m }，Z i Is A i A corresponding first resource duty cycle, wherein Z i Meets the following conditions:
Z i =(α 1 (V i1 /U i1 )+α 2 (V i2 /U i2 )+α 3 (V i3 /U i3 ))/(α 1 +α 2 +α 3 ) Wherein alpha is 1 For a first preset resource duty weight for adjusting the resource duty ratio, alpha 2 For a second preset resource duty weight for adjusting the resource duty, α 3 For the third preset resource duty weight for adjusting the resource duty ratio, those skilled in the art know that the first preset resource duty weight, the second preset resource duty weight and the third preset resource duty weight are set by those skilled in the art according to actual demands.
S4, obtaining a second resource duty ratio ZY according to Z, wherein ZY meets the following conditions:
ZY=Σ m i=1 (Z i )/m。
s5, when Z i When not less than ZY, determining U i1 Is A i Corresponding target CPU data processing amount, U i2 Is A i Corresponding target GPU data processing amount, U i3 Is A i Corresponding target memory data processing capacity.
S6, when Z i When < ZY, according to U i Determination of A i The corresponding target CPU data processing amount, target GPU data processing amount and target memory data processing amount.
Specifically, the step S6 includes the steps of:
s61 according to U i Obtaining A i Corresponding second intermediate resource configuration list SJ i ={SJ i1 ，SJ i2 ，SJ i3 }，SJ i1 Is A i Corresponding second intermediate CPU data processing amount, SJ i2 Is A i Corresponding second intermediate GPU data processing amount, SJ i3 Is A i Corresponding second intermediate memory data processing capacity, wherein SJ i1 、SJ i2 、SJ i3 Meets the following conditions:
SJ i1 =α 1 ×(1-β)×U i1 /(α 1 +α 2 +α 3 ) Wherein β is a preset weight for adjusting the data throughput, and those skilled in the art know that the preset weight for adjusting the data throughput is set by those skilled in the art according to actual requirements;
SJ i2 =α 2 ×(1-β)×U i2 /(α 1 +α 2 +α 3 )；
SJ i3 =α 3 ×(1-β)×U i3 /(α 1 +α 2 +α 3 )。
s63, obtaining A i And the corresponding first operation identifier is an identifier which is generated to represent whether the target server can successfully operate or not when the server resource of the target server is configured as the second intermediate resource configuration.
S65, when the first operation identifier is the identifier of 0 and beta 2 At > 0.01, let β=β+β 2 And performs step S61, wherein β 2 The preset adjustment threshold value for the preset weight is known to those skilled in the art, and is set according to actual requirements.
Specifically, the designation "0" is characterized by: the operation is successful.
S67, when the first operation identifier is 0 and beta 2 When the temperature is less than or equal to 0.01, determining SJ i1 Is A i Corresponding target CPU data processing amount, SJ i2 Is A i Corresponding target GPU data processing amount, SJ i3 Is A i Corresponding target memory data processing capacity.
S69, when the first operation identifier is "1", let β=β - β 2 ，β 2 =β 2 /2, and performs S61.
Specifically, the identification "1" is characterized by: the operation failed.
The method comprises the steps of obtaining a first resource duty ratio list through presetting a preset resource allocation list and a first intermediate resource allocation list, automatically adjusting the resource allocation of a server according to the first resource duty ratio list, wherein the resource allocation can affect the allocation time consumption of the server, so that a first historical starting time length list and a second historical starting time length list are obtained according to the resource allocation of the server and the historical allocation time consumption, further, obtaining a first intermediate starting time length and a second intermediate starting time length, comparing the first intermediate starting time length with the second intermediate starting time length, determining the allocation time length started after the target server is allocated, obtaining the most reasonable allocation time length, avoiding resource waste and being beneficial to improving the running efficiency of a system.
S200, acquiring a second historical starting time length list C= { C corresponding to the A 1 ，C 2 ，……，C i ，……，C m }，C i ={C i1 ，C i2 ，……，C ir ，……，C is }，C ir Is A i And r=1, 2 … … s, s are the number of second historical starting time periods, wherein the second historical starting time period is the time period of starting the target server after completing deployment in the second historical time slice, and the method for acquiring the second historical starting time period is known to those skilled in the art and is not repeated herein, referring to the method for acquiring the first historical starting time period.
Specifically, the ending time point of the second history time slice is t 0 。
Further, the second historical time slice has a start time of t 2 ，t 2 The point in time when the deployment is first completed for the target server.
S300, acquiring a first intermediate starting duration D corresponding to the B according to the B, wherein the D meets the following conditions:
D=∑ m i=1 ((∑ n j=1 (B ij )-max(B ij )-min(B ij ) (n-2))/m, where max () is a function of obtaining a maximum value and min () is a function of obtaining a minimum value.
S400, acquiring a second intermediate starting duration E corresponding to C according to the C, wherein E meets the following conditions:
E=∑ m i=1 ((∑ s r=1 (C ir )-max(C ir )-min(C ir ))/(s-2))/m。
s500, when the I D-E I is not less than T 0 When E is determined to be the configuration duration T, T started after the target server completes deployment 0 The preset time difference is set, wherein the person skilled in the art knows that the person skilled in the art sets the preset time difference according to the actual requirement.
S600 when the absolute value of D-E is smaller than T 0 And when the method is used, determining the D as the configuration duration T started after the target server completes deployment.
Above-mentioned, automatic adjustment server's resource allocation, according to server's resource allocation and history deployment consuming time obtain first history start-up duration list and second history start-up duration list, further, obtain first middle start-up duration and second middle start-up duration, compare and confirm the configuration duration that the target server was launched after accomplishing the deployment to first middle start-up duration and second middle start-up duration, can obtain the most reasonable configuration duration, avoid causing the wasting of resources and be favorable to improving the operating efficiency of system.
The invention also provides another embodiment.
Specifically, the step S600 is followed by the steps of:
s700, obtaining A i Corresponding deployment installation package identification L i 。
Specifically, the deployment installation package identifier is a unique identity of the deployment installation package.
Specifically, the step S700 includes the steps of obtaining a deployment installation package:
s701, acquiring a target character string, where the target character string may be understood as: codes, among which those skilled in the art know, set target strings according to actual demands.
S702, obtaining a first CPU architecture type and a second CPU architecture type corresponding to a target server, which are known to those skilled in the art, any method capable of obtaining the CPU architecture type in the prior art belongs to the protection scope of the present invention, and is not described herein.
Specifically, the CPU architecture corresponding to the first CPU architecture type is an ARM architecture.
Specifically, the CPU architecture corresponding to the second CPU architecture type is an X86 architecture.
S703, acquiring a first architecture type installation package according to the target character string, wherein the first architecture type installation package can be understood as an ARM version installation package, and any method for compiling codes to generate the installation package in the prior art is known to those skilled in the art, and is not described herein.
S704, acquiring a second architecture type installation package according to the target character string, wherein the second architecture type installation package can be understood as an X86 version installation package, and a person skilled in the art knows that a method for acquiring the second architecture type installation package refers to a method for acquiring the first architecture type installation package, which is not described herein.
S705, when A i When the CPU architecture of the (1) is the CPU architecture corresponding to the first CPU architecture type, determining that the first architecture type installation package is L i Corresponding deployment installation packages.
S706, when A i When the CPU architecture of the (1) is the CPU architecture corresponding to the second CPU architecture type, determining that the second architecture type installation package is L i Corresponding deployment installation packages.
According to the method, the deployment installation package corresponding to the target server is determined according to the CPU architecture corresponding to the target server, and the target server is deployed according to the deployment installation package, so that server deployment can be accurately and rapidly completed, and the operation efficiency of the system is improved.
S800 according to L i Corresponding deployment installation package pair A i Corresponding target server proceeding unitDeployment, acquisition A i Corresponding intermediate server P i 。
S900, obtaining P i Start-up duration Q of (2) i 。
S1000, obtain P i Corresponding feedback character string W i The feedback string can be understood as: and generating error reporting information after the server is started.
S1100, when Q i > T or W i When not NULL, determine a i The corresponding target server is A i A corresponding intermediate server.
When the time length of starting the server is not less than the configuration time length of starting the target server after completing deployment or when the error reporting occurs after starting the target server, the error occurs in deployment is indicated, and at the moment, the state of the target server is restored to the state before undeployment, so that the problem that the server cannot normally operate can be avoided.
The invention provides a configuration system of a cluster server, which comprises: the target server identification list, the processor and the memory storing the computer program, when the computer program is executed by the processor, the following steps are implemented: acquiring a first historical starting time length list corresponding to a target server identification list; acquiring a second historical starting time length list corresponding to the target server identification list; acquiring a first intermediate starting time length; acquiring a second intermediate starting time length; and acquiring configuration time length started after the target server finishes deployment according to the first intermediate starting time length and the second intermediate starting time length. According to the method and the device for automatically adjusting the resource configuration of the server, the first historical starting time list and the second historical starting time list are obtained according to the resource configuration of the server and the historical deployment time, further, the first middle starting time and the second middle starting time are obtained, the configuration time of the target server started after the deployment is determined by comparing the first middle starting time and the second middle starting time, the most reasonable configuration time can be obtained, resource waste is avoided, and the operation efficiency of the system is improved.
While certain specific embodiments of the invention have been described in detail by way of example, it will be appreciated by those skilled in the art that the above examples are for illustration only and are not intended to limit the scope of the invention. Those skilled in the art will also appreciate that many modifications may be made to the embodiments without departing from the scope and spirit of the invention. The scope of the invention is defined by the appended claims.
Claims (10)
1. A system for configuring a cluster server, the system comprising: target server identification list a= { a 1 ，A 2 ，……A i ，……，A m A processor and a memory storing a computer program, wherein A i For the i-th target server identification, i=1, 2 … … m, m is the target server number, when the computer program is executed by the processor, the following steps are implemented:
s100, acquiring a first historical starting time list B= { B corresponding to A 1 ，B 2 ，……，B i ，……，B m }，B i ={B i1 ，B i2 ，……，B ij ，……，B in }，B ij Is A i The j-th corresponding first historical starting duration, j=1, 2 … … n, n is the number of the first historical starting durations, wherein the first historical starting duration is the duration of starting the target server after deployment is completed in a first historical time slice;
s200, acquiring a second historical starting time length list C= { C corresponding to the A 1 ，C 2 ，……，C i ，……，C m }，C i ={C i1 ，C i2 ，……，C ir ，……，C is }，C ir Is A i The corresponding r-th second historical starting duration, r=1, 2 … … s, s are the number of the second historical starting durations, wherein the second historical starting duration is the duration of starting the target server after deployment is completed in a second historical time slice;
s300, acquiring a first intermediate starting duration D corresponding to the B according to the B, wherein the D meets the following conditions:
D=∑ m i=1 ((∑ n j=1 (B ij )-max(B ij )-min(B ij ) (n-2))/m, wherein max () is a function of obtaining a maximum value and min () is a function of obtaining a minimum value;
s400, acquiring a second intermediate starting duration E corresponding to C according to the C, wherein E meets the following conditions:
E=∑ m i=1 ((∑ s r=1 (C ir )-max(C ir )-min(C ir ))/(s-2))/m；
s500, when the I D-E I is not less than T 0 When E is determined to be the configuration duration T, T started after the target server completes deployment 0 Is a preset time difference;
s600 when the absolute value of D-E is smaller than T 0 And when the method is used, determining the D as the configuration duration T started after the target server completes deployment.
2. The configuration system of a cluster server according to claim 1, wherein in step S100, the steps of:
s101, acquiring a first key starting time length list F= { F corresponding to A 1 ，F 2 ，……，F i ，……，F m }，F i ={F i1 ，F i2 ，……，F ij ，……，F in }，F ij For a first historical time slice A i The corresponding j-th first key starting time length is the basic time length of starting after the target server finishes deployment;
s103, acquiring a second key starting time length list G= { G corresponding to the A 1 ，G 2 ，……，G i ，……，G m }，G i ={G i1 ，G i2 ，……，G ij ，……，G in }，G ij For a first historical time slice A i The corresponding j-th second key starting time length is the lowest time consumption of starting after the target server finishes deployment;
s105, acquiring a first preset weight list H= { H corresponding to G 1 ，H 2 ，……，H i ，……，H m }，H i ={H i1 ，H i2 ，……，H ij ，……，H in }，H ij Is G ij The method comprises the steps of setting a corresponding first preset weight, wherein the first preset weight is a weight capable of enabling the starting time consumption of a target server after deployment to be the lowest time consumption;
s107 according to F ij 、G ij And H ij Acquisition of B ij Wherein B is ij Meets the following conditions:
B ij =F ij +(G ij -F ij )/(min(R ij ，H ij )/H ij )，R ij is A i And the corresponding j second preset weight is used for adjusting the first historical starting time according to the server resource configuration of the target server.
3. The configuration system of cluster servers according to claim 2, characterized in that it comprises, before step S107, the steps of:
s1, acquiring a preset resource allocation list U= { U corresponding to A 1 ，U 2 ，……，U i ，……，U m }，U i ={U i1 ，U i2 ，U i3 }，U i1 Is A i Corresponding to the preset CPU data processing amount, U i2 Is A i Corresponding preset GPU data processing amount, U i3 Is A i Corresponding preset memory data processing capacity;
s2, acquiring a first intermediate resource configuration list V= { V corresponding to A 1 ，V 2 ，……，V i ，……，V m }，V i ={V i1 ，V i2 ，V i3 }，V i1 Is A i Corresponding first intermediate CPU data processing amount, V i2 Is A i Corresponding first intermediate GPU data processing amount, V i3 Is A i The corresponding first intermediate memory data processing amount is the actual CPU data processing amount required by the operation of the target server, and the first intermediate GPU data processing amount is the target serverThe actual GPU data processing amount required by operation is performed, and the first intermediate memory data processing amount is the actual memory data processing amount required by operation of the target server;
s3, according to U and V, acquiring a first resource duty ratio list Z= { Z corresponding to A 1 ，Z 2 ，……，Z i ，……，Z m }，Z i Is A i A corresponding first resource duty cycle, wherein Z i Meets the following conditions:
Z i =(α 1 (V i1 /U i1 )+α 2 (V i2 /U i2 )+α 3 (V i3 /U i3 ))/(α 1 +α 2 +α 3 ) Wherein alpha is 1 For a first preset resource duty weight for adjusting the resource duty ratio, alpha 2 For a second preset resource duty weight for adjusting the resource duty, α 3 A third preset resource duty ratio weight for adjusting the resource duty ratio;
s4, obtaining a second resource duty ratio ZY according to Z, wherein ZY meets the following conditions:
ZY=Σ m i=1 (Z i )/m；
s5, when Z i When not less than ZY, determining U i1 Is A i Corresponding target CPU data processing amount, U i2 Is A i Corresponding target GPU data processing amount, U i3 Is A i Corresponding target memory data throughput;
s6, when Z i When < ZY, according to U i Determination of A i The corresponding target CPU data processing amount, target GPU data processing amount and target memory data processing amount.
4. A cluster server configuration system according to claim 3, characterized in that in step S6 the following steps are included:
s61 according to U i Obtaining A i Corresponding second intermediate resource configuration list SJ i ={SJ i1 ，SJ i2 ，SJ i3 }，SJ i1 Is A i Corresponding second intermediate CPU data processing amount, SJ i2 Is A i Corresponding second intermediate GPU data processing amount, SJ i3 Is A i Corresponding second intermediate memory data processing capacity, wherein SJ i1 、SJ i2 、SJ i3 Meets the following conditions:
SJ i1 =α 1 ×(1-β)×U i1 /(α 1 +α 2 +α 3 ) Wherein, beta is a preset weight for adjusting the data throughput;
SJ i2 =α 2 ×(1-β)×U i2 /(α 1 +α 2 +α 3 )；
SJ i3 =α 3 ×(1-β)×U i3 /(α 1 +α 2 +α 3 )；
s63, obtaining A i The corresponding first operation identifier is an identifier which is generated to represent whether the target server can successfully operate or not when the server resource of the target server is configured as the second intermediate resource configuration;
s65, when the first operation identifier is the identifier of 0 and beta 2 At > 0.01, let β=β+β 2 And performs step S61, wherein β 2 A preset adjustment threshold value for a preset weight;
s67, when the first operation identifier is 0 and beta 2 When the temperature is less than or equal to 0.01, determining SJ i1 Is A i Corresponding target CPU data processing amount, SJ i2 Is A i Corresponding target GPU data processing amount, SJ i3 Is A i Corresponding target memory data throughput;
s69, when the first operation identifier is "1", let β=β - β 2 ，β 2 =β 2 /2, and performs S61.
5. The configuration system of cluster servers according to claim 1, further comprising the step of, after step S600:
s700, obtaining A i Corresponding deployment installation package identification L i ；
S800 according to L i Corresponding deployment installation package pair A i Corresponding targetDeploying a server to obtain A i Corresponding intermediate server P i ；
S900, obtaining P i Start-up duration Q of (2) i ；
S1000, obtain P i Corresponding feedback character string W i ；
S1100, when Q i > T or W i When not NULL, determine a i The corresponding target server is A i A corresponding intermediate server.
6. The configuration system of cluster servers according to claim 1, wherein the ending time point of the first historical time slice is a current time point t 0 。
7. The configuration system of cluster servers of claim 6, wherein the starting time point of the first historical time slice is t 1 Wherein t is 1 =t 0 Δt, Δt being a preset first historical time slice length.
8. The cluster server configuration system of claim 7, wherein Δt has a value in the range of [30, 60].
9. The configuration system of cluster servers of claim 6, wherein the second historical time slice has an ending time point of t 0 。
10. The configuration system of cluster servers of claim 1, wherein the second historical time slice has a start time of t 2 ，t 2 The point in time when the deployment is first completed for the target server.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202310496648.1A CN116204248B (en) | 2023-05-05 | 2023-05-05 | Configuration system of cluster server |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202310496648.1A CN116204248B (en) | 2023-05-05 | 2023-05-05 | Configuration system of cluster server |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN116204248A true CN116204248A (en) | 2023-06-02 |
| CN116204248B CN116204248B (en) | 2023-07-07 |
Family
ID=86515058
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN202310496648.1A Active CN116204248B (en) | 2023-05-05 | 2023-05-05 | Configuration system of cluster server |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN116204248B (en) |
Citations (5)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US20070038726A1 (en) * | 2005-08-15 | 2007-02-15 | Microsoft Corporation | Quick deploy of content |
| CN112491606A (en) * | 2020-11-20 | 2021-03-12 | 湖南麒麟信安科技股份有限公司 | Method for automatically deploying high-availability cluster of service system based on infrastructure |
| CN112612587A (en) * | 2020-12-25 | 2021-04-06 | 江苏省未来网络创新研究院 | Spark platform dynamic resource allocation method for flow analysis |
| CN114003339A (en) * | 2021-10-22 | 2022-02-01 | 济南浪潮数据技术有限公司 | Detection method and device for zombie virtual machine, computer equipment and storage medium |
| CN114785760A (en) * | 2022-05-07 | 2022-07-22 | 阿里巴巴（中国）有限公司 | Service preheating method, device, medium and product |
-
2023
- 2023-05-05 CN CN202310496648.1A patent/CN116204248B/en active Active
Patent Citations (5)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US20070038726A1 (en) * | 2005-08-15 | 2007-02-15 | Microsoft Corporation | Quick deploy of content |
| CN112491606A (en) * | 2020-11-20 | 2021-03-12 | 湖南麒麟信安科技股份有限公司 | Method for automatically deploying high-availability cluster of service system based on infrastructure |
| CN112612587A (en) * | 2020-12-25 | 2021-04-06 | 江苏省未来网络创新研究院 | Spark platform dynamic resource allocation method for flow analysis |
| CN114003339A (en) * | 2021-10-22 | 2022-02-01 | 济南浪潮数据技术有限公司 | Detection method and device for zombie virtual machine, computer equipment and storage medium |
| CN114785760A (en) * | 2022-05-07 | 2022-07-22 | 阿里巴巴（中国）有限公司 | Service preheating method, device, medium and product |
Also Published As
| Publication number | Publication date |
|---|---|
| CN116204248B (en) | 2023-07-07 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN110297701B (en) | Data processing job scheduling method, device, computer equipment and storage medium | |
| EP0950948B1 (en) | File distribution system and method thereof | |
| CN109739527B (en) | Method, device, server and storage medium for client gray scale release | |
| CN111225050A (en) | Cloud computing resource allocation method and device | |
| CN116204248B (en) | Configuration system of cluster server | |
| CN111104260A (en) | Service upgrade monitoring method, device, server and storage medium | |
| JP5391631B2 (en) | Parameter control device, parameter control program, and multistage collation device | |
| CN115098960A (en) | Method and device for predicting residual service life of equipment | |
| CN115278908A (en) | Wireless resource allocation optimization method and device | |
| CN112445635A (en) | Data-driven adaptive checkpoint optimization method | |
| US20210256402A1 (en) | Evaluation device and evaluation method | |
| CN113918341A (en) | Equipment scheduling method, device, equipment and storage medium | |
| CN113763043A (en) | Advertisement landing page display method and device, storage medium and computer equipment | |
| CN117349151A (en) | Test case priority ordering method and device based on clustering and storage medium | |
| CN113485933A (en) | Automatic testing method and distributed system | |
| CN111061875A (en) | Hyper-parameter determination method, device, computer equipment and storage medium | |
| CN113010418A (en) | Progressive gray scale publishing method and device | |
| CN112115449A (en) | Chip physical fingerprint reliability assessment method, device, equipment and medium | |
| CN115408160B (en) | Data processing system for process monitoring | |
| CN112348282B (en) | Load prediction method and device | |
| CN115757480A (en) | Data preheating method and device, storage medium and computer equipment | |
| CN108600026B (en) | Neighbor relation storage method and device | |
| CN112489810B (en) | Data processing method, system, server and medium based on intelligent medical treatment | |
| CN111539817B (en) | Linear difficulty calculation method for preventing timestamp hijacking among blockchains, computer-readable storage medium and blockchain network | |
| CN111324524B (en) | Advertisement stability testing method and device |
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 |