CN117591287A - Interface memory resource allocation method, device, equipment and storage medium - Google Patents
Interface memory resource allocation method, device, equipment and storage medium Download PDFInfo
- Publication number
- CN117591287A CN117591287A CN202311582581.XA CN202311582581A CN117591287A CN 117591287 A CN117591287 A CN 117591287A CN 202311582581 A CN202311582581 A CN 202311582581A CN 117591287 A CN117591287 A CN 117591287A
- Authority
- CN
- China
- Prior art keywords
- interface
- determining
- weight
- period
- memory
- 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.)
- Pending
Links
- 238000000034 method Methods 0.000 title claims abstract description 51
- 238000013468 resource allocation Methods 0.000 title claims abstract description 19
- 238000003860 storage Methods 0.000 title claims abstract description 14
- 239000013074 reference sample Substances 0.000 claims abstract description 53
- 239000000523 sample Substances 0.000 claims description 34
- 230000004044 response Effects 0.000 claims description 19
- 238000004590 computer program Methods 0.000 claims description 12
- 238000012545 processing Methods 0.000 claims description 11
- 230000001960 triggered effect Effects 0.000 claims description 11
- 238000004891 communication Methods 0.000 abstract description 4
- 238000010586 diagram Methods 0.000 description 11
- 230000008569 process Effects 0.000 description 10
- 238000004364 calculation method Methods 0.000 description 6
- 238000005516 engineering process Methods 0.000 description 5
- 230000006870 function Effects 0.000 description 5
- 230000010485 coping Effects 0.000 description 3
- 238000009826 distribution Methods 0.000 description 3
- 238000013507 mapping Methods 0.000 description 3
- 238000012986 modification Methods 0.000 description 3
- 230000004048 modification Effects 0.000 description 3
- 230000001186 cumulative effect Effects 0.000 description 2
- 238000013461 design Methods 0.000 description 2
- 230000000694 effects Effects 0.000 description 2
- 230000003287 optical effect Effects 0.000 description 2
- 238000003672 processing method Methods 0.000 description 2
- 230000003068 static effect Effects 0.000 description 2
- 241000287196 Asthenes Species 0.000 description 1
- 238000013473 artificial intelligence Methods 0.000 description 1
- 230000002354 daily effect Effects 0.000 description 1
- 238000013499 data model Methods 0.000 description 1
- 230000003203 everyday effect Effects 0.000 description 1
- 230000003993 interaction Effects 0.000 description 1
- 238000012423 maintenance Methods 0.000 description 1
- 238000004519 manufacturing process Methods 0.000 description 1
- 230000006386 memory function Effects 0.000 description 1
- 230000009467 reduction Effects 0.000 description 1
- 239000002699 waste material Substances 0.000 description 1
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/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/5011—Allocation of resources, e.g. of the central processing unit [CPU] to service a request the resources being hardware resources other than CPUs, Servers and Terminals
- G06F9/5016—Allocation of resources, e.g. of the central processing unit [CPU] to service a request the resources being hardware resources other than CPUs, Servers and Terminals the resource being the memory
-
- 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/5011—Allocation of resources, e.g. of the central processing unit [CPU] to service a request the resources being hardware resources other than CPUs, Servers and Terminals
- G06F9/5022—Mechanisms to release resources
-
- 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)
- Management, Administration, Business Operations System, And Electronic Commerce (AREA)
Abstract
The embodiment of the application provides an interface memory resource allocation method, device, equipment and storage medium, and relates to the technical field of communication, wherein the method comprises the following steps: for any interface, determining a reference sample matched with the working state of the interface in a preamble period from the historical samples of the interface; determining the technical weight of the interface according to the working state of the reference sample in the subsequent period; the preamble period is a period before the adjustment time in one working period; the subsequent time period is a time period positioned after the adjustment time in one working period; determining each service scene of the interface based on the plan execution data; determining the service weight of the interface according to the set working state of the interface in each service scene; and adjusting memory resources for each interface according to the technical weight of each interface and the service weight of each interface. By allocating the interface memory resources, the memory resource allocation is finer, and memory overflow is avoided.
Description
Technical Field
The present invention relates to the field of server memory technologies, and in particular, to a method, an apparatus, a device, and a storage medium for allocating interface memory resources.
Background
In the financial transaction process, the situation that the number of data is increased, the message capacity is increased, the memory overflows due to the expansion of data such as peak flow and the like is caused, and in order to ensure the stability of a financial system, the situation that the memory overflows due to the expansion of the financial transaction data is required to be solved.
In the prior art, when the memory ratio of the application system is too high (i.e. data expansion), two coping modes are generally adopted: the server automatically expands or limits the capacity. However, the automatic capacity expansion of the server cannot reasonably utilize system resources, and after the automatic capacity expansion of the system occurs at the peak of the flow, the system is idle in a large amount of space at the valley of the flow, so that the cost is increased; for the current limit, if the current limit is performed indiscriminately, some key contents, such as an order transaction, a payment transaction, etc., are lost. In the prior art, dynamic adjustment is generally performed on application memory resources.
Disclosure of Invention
The embodiment of the application provides an interface memory resource allocation method, device, equipment and storage medium, which are used for dynamically balancing interface memory resources and avoiding the problem of memory overflow.
In a first aspect, an embodiment of the present application provides a method for allocating an interface memory resource, including:
For any interface, determining a reference sample matched with the working state of the interface in a preamble period from the historical samples of the interface; determining the technical weight of the interface according to the working state of the reference sample in the subsequent period; determining the technical weight of the interface according to the working state of the reference sample in the subsequent period; the preamble period is a period before the adjustment time in one working period; the subsequent time period is a time period positioned after the adjustment time in one working period;
determining each service scene of the interface based on plan execution data; determining the service weight of the interface according to the set working state of the interface in each service scene;
and adjusting memory resources for each interface according to the technical weight of each interface and the service weight of each interface.
In the embodiment of the application, the working state matched with the time period where the current interface is positioned is determined from the historical sample to be used as the reference sample, so that more accurate reference basis can be provided when memory resources are allocated for the current interface; determining technical weights according to the working states of the reference samples in the subsequent time periods, and performing memory resource allocation on the current interface is more reasonable; the calling condition of the interface and the importance degree of the service scene are more definite through planning execution data, so that the service weight can be determined; through the different angles of technical weight and business weight, the memory resources of the interface are distributed, so that the distribution is more reasonable and more accurate. And according to the allocation of the interface memory resources, the memory resource allocation is finer. Under the condition of not increasing the memory and the machine, the phenomenon of memory overflow of the system is avoided.
Optionally, the determining the service weight of the interface according to the set working state of the interface in each service scenario includes:
for any service scene, according to the corresponding relation between the service scene and the interface, determining the set and adjusted times of the interface under the service scene;
and determining the service weight corresponding to the interface according to the set weight of the interface in each service scene and the set tuned times of the interface in each service scene.
In the embodiment of the application, the number of times of interface tuning is determined through the corresponding relation between the service scene and the interface, and the difference of service scenes and the difference of the number of times of interface tuning are reflected, namely the number of times of interface tuning is related to the service scene; the service weight is determined by the set weight and the interface modulated times in the service scene, so that different service scenes have different importance degrees and different service weights, thereby being more in line with the real scene and obtaining more accurate service weight.
Optionally, the working state of the interface includes the request times of the interface and the response time of the interface; determining a reference sample matched with the working state of the interface in a preamble period from the historical samples of the interface, wherein the reference sample comprises the following components:
Determining a fitting value of the working state of any historical sample in the period corresponding to the preamble period and the working state of the interface in the preamble period; determining a history sample corresponding to the minimum fitting value as a reference sample;
determining the technical weight of the interface according to the working state of the reference sample in the subsequent period, wherein the method comprises the following steps:
and determining the technical weight of the interface according to the request times and the response time length of the reference sample in the next period of the adjustment time.
In the embodiment of the application, the fitting values of the current interface and all the historical samples are calculated by comparing the current interface with a plurality of historical samples, so that the most matched historical samples are determined, and are used as reference samples, and when other data of the interface are calculated subsequently, the accuracy of the other data of the interface is ensured due to the accuracy of the reference samples; the technical weight of the interface is determined by referring to the request times and the response time of the sample at the next moment, instead of determining the technical weight at other moments, so that the technical weight is more real.
Optionally, the adjusting the memory resource for each interface according to the technical weight of each interface and the service weight of each interface includes:
For any interface, determining a first duty ratio of the technical weight of the interface to the technical weight of each interface and a second duty ratio of the service weight of the interface to the service weight of each interface;
and determining the memory resources after the interface adjustment according to the duty ratio of the technical weight, the duty ratio of the service weight, the first duty ratio, the second duty ratio and the system available memory resources.
In the embodiment of the application, the memory resource after the interface is adjusted is determined by calculating the first duty ratio of the technical weight, the second duty ratio of the service weight, the duty ratio of the technical weight and the duty ratio of the service weight of the interface, so that the memory resource is adjusted more strictly, and the adjusted memory resource can be obtained without manual operation, so that the interface resource is distributed more intelligently, the cost of memory resource distribution is reduced, and the accuracy and the efficiency of memory resource distribution are improved.
Optionally, the determining, based on the plan execution data, that the interface is in each service scenario includes:
traversing each record in the plan execution data; the plan execution data are obtained through processing data of each execution system;
and determining each corresponding interface under the service scene related to each record according to the corresponding relation between the service scene and the interfaces, thereby obtaining each corresponding service scene of each interface in the historical execution data.
In the embodiment of the application, each record in the data is executed through the traversal plan, so that each acquired service scene is comprehensive, and the situation that the service scene is not covered is avoided; by associating the service scene with the interface, the memory resource can be allocated through the interface, and the service scene is associated when the memory resource is allocated, so that the memory resource is more in line with the actual situation in the allocation process.
Optionally, before determining the reference sample matched with the working state of the interface in the preamble period from the historical samples of the interface, the method further includes:
and determining that the memory utilization rate of any interface is greater than the threshold online and the idle memory resources of the system are less than the lowest threshold.
In the embodiment of the application, before the memory resource is allocated, whether the memory utilization rate of the interface is greater than a threshold value or not and whether the idle memory resource of the system is smaller than a minimum threshold value or not is firstly judged, and then whether the memory resource is allocated to the interface or not is determined, so that the unreasonable situation of memory resource allocation is avoided.
Optionally, the method further comprises:
when the memory utilization rate of any interface is lower than the threshold value, releasing part of memory resources of the interface;
And if the memory utilization rate of any interface is greater than the threshold value and the idle memory resources of the system are not less than the lowest threshold value, increasing part of the memory resources in the idle resources to the interface.
In the embodiment of the application, if the utilization rate of the memory resources of the interface is low, part of the memory resources of the interface are released, so that the condition of resource waste is avoided; if the memory utilization rate of the interface is higher and the unoccupied memory resources of the system are not less than the lowest threshold value, the memory resources of the interface are increased, and the condition of memory overflow is avoided.
In a second aspect, an embodiment of the present application provides an interface memory resource allocation device, including:
the determining module is used for determining a reference sample matched with the working state of the interface in the preamble period from the historical samples of the interface aiming at any interface; determining the technical weight of the interface according to the working state of the reference sample in the subsequent period; the preamble period is a period before the adjustment time in one working period; the subsequent time period is a time period positioned after the adjustment time in one working period;
the triggering module is used for determining each service scene of the interface based on the plan execution data; determining the service weight of the interface according to the set working state of the interface in each service scene;
And the adjusting module is used for adjusting the memory resources for each interface according to the technical weight of each interface and the service weight of each interface.
Optionally, the triggering module is specifically configured to:
for any service scene, according to the corresponding relation between the service scene and the interface, determining the set and adjusted times of the interface under the service scene;
and determining the service weight corresponding to the interface according to the set weight of the interface in each service scene and the set tuned times of the interface in each service scene.
Optionally, the determining module is specifically configured to:
determining a fitting value of the working state of any historical sample in the period corresponding to the preamble period and the working state of the interface in the preamble period; determining a history sample corresponding to the minimum fitting value as a reference sample;
determining the technical weight of the interface according to the working state of the reference sample in the subsequent period, wherein the method comprises the following steps:
and determining the technical weight of the interface according to the request times and the response time length of the reference sample in the next period of the adjustment time.
Optionally, the adjusting module is specifically configured to:
for any interface, determining a first duty ratio of the technical weight of the interface to the technical weight of each interface and a second duty ratio of the service weight of the interface to the service weight of each interface;
And determining the memory resources after the interface adjustment according to the duty ratio of the technical weight, the duty ratio of the service weight, the first duty ratio, the second duty ratio and the system available memory resources.
Optionally, the determining module is specifically configured to:
traversing each record in the plan execution data; the plan execution data are obtained through processing data of each execution system;
and determining each corresponding interface under the service scene related to each record according to the corresponding relation between the service scene and the interfaces, thereby obtaining each corresponding service scene of each interface in the historical execution data.
Optionally, the determining module is further configured to:
and determining that the memory utilization rate of any interface is greater than the threshold online and the idle memory resources of the system are less than the lowest threshold.
Optionally, the determining module is further configured to:
when the memory utilization rate of any interface is lower than the threshold value, releasing part of memory resources of the interface;
and if the memory utilization rate of any interface is greater than the threshold value and the idle memory resources of the system are not less than the lowest threshold value, increasing part of the memory resources in the idle resources to the interface.
In a third aspect, embodiments of the present application provide a computer device, including a memory, a processor, and a computer program stored on the memory and executable on the processor, where the processor performs the processing method of any of the first aspect.
In a fourth aspect, embodiments of the present application provide a computer readable storage medium storing a computer program executable by a computer device, the program when run on the computer device causing the computer device to perform the processing method of any of the first aspects described above.
Drawings
In order to more clearly illustrate the technical solutions of the embodiments of the present invention, the drawings that are needed in the description of the embodiments will be briefly described below, it will be apparent that the drawings in the following description are only some embodiments of the present invention, and that other drawings can be obtained according to these drawings without inventive effort for a person skilled in the art.
FIG. 1 is a system architecture diagram provided in an embodiment of the present application;
fig. 2 is a flowchart of a method for allocating interface memory resources according to an embodiment of the present application;
fig. 3 is a second flowchart of a method for allocating interface memory resources according to an embodiment of the present application;
fig. 4 is a schematic diagram of an interface memory resource allocation device according to an embodiment of the present application;
fig. 5 is a schematic diagram of a computer device according to an embodiment of the present application.
Detailed Description
In order to make the objects, technical solutions and advantages of the present invention more apparent, the present invention will be described in further detail below with reference to the accompanying drawings, and it is apparent that the described embodiments are only some embodiments of the present invention, 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 be within the scope of the invention.
During a financial transaction, there are a number of conditions that result in memory overflow: for example, the used data record, the period number is expanded from the maximum period 12 to the period 36, and if the original concurrency is maintained, the memory overflow is caused; the capacity of the downstream response message is rapidly increased, for example, the size of the interface message is increased from 1KB to 10KB before, and if the original call concurrency is maintained, the memory overflow is also caused; when the peak flow comes, a large amount of memory is applied, the system is not released, and memory overflow is caused. In the prior art, the common coping modes are as follows:
1) And automatically expanding the capacity of the server, and dynamically increasing the memory capacity of the server or increasing the number of server instances when the memory ratio of the system reaches a certain threshold value so as to ensure that the memory overflow of the system does not occur.
2) And limiting the whole flow of the application server, ensuring that the memory ratio of the system is in a reasonable range, and avoiding the service unavailability caused by memory overflow of the system.
However, the above two coping strategies bring about the following problems:
1) The server is adopted to automatically expand the capacity, system resources cannot be reasonably utilized, most of financial transaction scenes show regular fluctuation, and flow fluctuation among different scenes and different transactions is different. If the flow peak system is automatically expanded, the flow off-peak system resources are greatly idle, and IT cost is increased.
2) Limiting the overall traffic of the application server by limiting the flow is used to kill some of the critical transactions, such as the order transactions, payment transactions, etc.
In this regard, the method for allocating memory resources of an interface according to the embodiment of the present application may dynamically allocate memory resources of each interface according to the ratio of the interface memory, and specifically the operation method is described as follows:
firstly, determining a reference sample closest to a current interface, then determining the technical weight of the current interface according to the reference sample, determining the service weight of the current interface according to the number of times of adjustment of the current interface and the set weight, and finally determining the adjusted memory resource according to the technical weight and the service weight, the technical weight ratio, the service weight ratio and the available memory resource of the system.
In some embodiments, referring to fig. 1, a system architecture diagram provided for an embodiment of the present application includes a terminal device 101 and a server 102, where the terminal device 101 installs a service application in advance, and the service application is a client application, a web page application, an applet application, or the like. The terminal device 101 may be, but is not limited to, a smart phone, a tablet computer, a notebook computer, a desktop computer, a smart home appliance, a smart voice interaction device, a smart car-mounted device, and the like.
The server 102 may be a server cluster or a distributed system formed by a plurality of physical servers, and may also be a cloud server that provides cloud services, cloud databases, cloud computing, cloud functions, cloud storage, network services, cloud communication, middleware services, domain name services, security services, content delivery networks (Content Delivery Network, CDN), and basic cloud computing services such as big data and artificial intelligence platforms. The terminal device 101 and the background center 102 may be directly or indirectly connected through wired or wireless communication, which is not limited herein.
In some embodiments, based on the system architecture diagram of fig. 1, the embodiments of the present application provide a flow of an interface memory resource allocation method, as shown in fig. 2, where the flow of the method is performed by a computer device, and the computer device may be a server shown in fig. 1, and includes the following steps:
Step 201, determining a reference sample matched with the working state of the interface in the preamble period from the history sample of the interface for any interface; determining the technical weight of the interface according to the working state of the reference sample in the subsequent period; the preamble period is a period before the adjustment time in one working period; the subsequent time period is a time period located after the adjustment time in one working period.
Specifically, the interfaces are network interfaces, which refer to various interfaces of the network device, and the network interfaces are ethernet interfaces in general. Each interface is provided with a corresponding history sample, a history sample which is most matched with the working state of each interface in the preamble period is determined according to the history sample of each interface, and the most matched history sample is taken as a reference sample. And then determining the technical weight of each interface according to the working state of the reference sample in the subsequent time period.
The interface takes one day (24 h) as a working period, the front time period and the rear time period of the interface are divided by the adjusting time of the interface, and the front time period and the rear time period of the interface are both in one working period of the adjusting time of the interface. The period before the interface adjusting time is the preamble period of the interface, the period after the interface adjusting time is the following period of the interface, the preamble period is all the periods before the adjusting time in one period, the following period is the first period after the adjusting time in one period, if the adjusting time is the critical time, the following period defaults to the first period of the next period, for example, the adjusting time is 24 hours, and the following period is 25 hours, namely, zero of the next period.
In some embodiments, the working state of the interface includes the number of requests of the interface and the response time of the interface; determining a reference sample matched with the working state of the interface in the preamble period from the historical samples of the interface, wherein the reference sample comprises the following components: determining a fitting value of the working state of any historical sample in a period corresponding to the preamble period and the working state of the interface in the preamble period; and determining the historical sample corresponding to the minimum fitting value as a reference sample. Determining the technical weight of the interface according to the working state of the reference sample in the subsequent period, wherein the method comprises the following steps: and determining the technical weight of the interface according to the request times and the response time length of the reference sample in the next period of the adjustment time.
Specifically, the working state of the interface includes the number of requests of the interface, which can be understood as the flow of the interface, and the response time of the interface, which can be understood as the response time of the interface. The specific method for determining the reference sample comprises the following steps: firstly, for a plurality of history samples, determining a corresponding working state of each history sample in an interface preamble period, and then determining a fitting value of an interface according to the working state. And comparing fitting values of the plurality of history samples, taking the corresponding history sample with the smallest fitting value as a reference sample, and finally determining the technical weight of the interface according to the working state of the reference sample in a subsequent period.
Fitting values were obtained by formula (1):
wherein Y [ i ] [ j ] is the average request times of the ith interface in the jth hour interval, and Y1[ i ] [ j ] is the corresponding historical sample 1 data; p1[ i ] [ j ] is the average response time of the ith interface in the jth hour interval, and P1[ i ] [ j ] is the corresponding historical sample 1 data; m is the number of hours of the day that represents a comparable fit, m and j are at most 24 (24 hours a day, 1 st period is 0-1, 24 th period is 23-24), and r1[ i ] is the fit of interface i to historical sample one.
The fitting value r1[ i ] of each interface and the data of the historical sample 1 can be calculated through the formula (1), and the historical sample 1 in the formula (1) is replaced by other historical samples, so that the fitting value of each interface and each historical sample can be calculated. Smaller fitting values indicate closer data.
For example, interface 1 has three history samples, one for each:
sample one: average number of requests and average response duration of interface 1 per hour interval No. 7.29.
Y1[1]＝{1,1,1,2,2,2,3,10,7,10,5,5,10,15,10,5,4,3,2,2,1,1,1,1}；
P1[1]＝{20,10,10,20,20,20,30,40,50,50,50,50,50,40,40,40,40,30,20,20,10,10,10,10}。
Sample two: average number of requests and average response time of interface 1 per hour interval No. 7.23.
Y2[1]＝{1,1,1,2,2,2,3,5,10,10,5,5,10,15,10,5,4,3,2,2,1,1,1,1}；
P2[1]＝{20,10,10,20,20,20,30,40,50,50,50,50,50,40,40,40,40,30,20,20,10,10,10,10}。
Sample three: number 6.30 average number of requests and average response duration of interface 1 per hour interval.
Y3[1]＝{1,1,1,2,2,2,3,4,10,10,5,5,10,15,10,5,4,3,2,2,1,1,1,1}；
P3[1]＝{20,10,10,20,20,20,30,40,50,50,50,50,50,40,40,40,40,30,20,20,10,10,10,10}。
And collecting sample data from the current zero point of the current day to the current cut-off point of the interface 1, wherein the cut-off time is 8 points, and the adjustment time is 8 hours.
Y[1]＝{1,1,1,2,2,2,3,10}；
P[1]＝{20,10,10,20,20,20,30,40}。
According to the formula (1), the fitting value of the current data of the interface 1 and the first historical sample is calculated to be minimum, and the first historical sample is taken as a reference sample. Determining technical weights according to the request times and response time length of the subsequent time periods of the reference samples, wherein the technical weights are obtained through a formula (2):
W i ＝Y[i][m+1]*P[i][m+1]… … formula (2)
Wherein Y [ i ]][m+1]Average number of requests of interface i in subsequent period, pi [ i ] for reference sample][m+1]Interface average response time length W of interface i in subsequent time period of reference sample i Is the technical weight of interface i.
For example, after determining that the first sample is the reference sample, obtaining the average number of requests and the average response time of the first sample in the subsequent period 9 at the current time 8, calculating the technical weight of the interface 1 according to the formula (2):
W 1 ＝Y[1][9]*P[1][9]＝7*50＝350
likewise, the technical weights of interfaces 2, 3, 4 are calculated according to formula (2) as:
interface technology weight W [2] =440 for the second interface;
interface technology weight W [3] =580 for the third interface;
the interface technology weight of the fourth interface W [4] =630.
Step 202, determining each service scene of the interface based on the plan execution data; and determining the service weight of the interface according to the set working state of the interface in each service scene.
Specifically, the scheduled execution data is data to be executed at an upcoming moment, and the service scenario of each interface can be determined according to the scheduled execution data. The working state is set according to different service scenes, importance values set for different service scenes and the number of times of modulation set by an interface under the service scenes. The service weight of the interface can be determined according to the set working state.
In some embodiments, determining the service weight of the interface according to the set working state of the interface in each service scene includes:
and aiming at any service scene, determining the set and adjusted times of the interface in the service scene according to the corresponding relation between the service scene and the interface. And determining the service weight corresponding to the interface according to the set weight of the interface in each service scene and the set tuned times of the interface in each service scene.
Specifically, different service scenarios are involved in the data transaction process, each service scenario corresponds to a plurality of interfaces, and possibly a plurality of service scenarios correspond to one interface, so that the mapping relationship between the service scenario and the interfaces is a many-to-many mapping relationship. And, the number of times that different interfaces are called under different business scenarios is also different. The set weight is an importance value set for different business scenes.
The number of times of interface call can reflect the working strength required by the interface in the current service scene, and the weight is set as an index for measuring the importance degree of the service scene, for example, the service scene in the credit card repayment scene is more important than the service scene of pushing account bill to the user scene. When setting the weight, the information to be referred to includes: business morphology, importance, transaction scenario, and operational experience.
Therefore, according to the mapping relation between the service scene and the interface, as shown in table 1, the following model is designed (the model may be designed depending on the historical data or configured according to the scale of the service scene):
TABLE 1
The interfaces are interfaces, and the model in table 1 only takes part of service scenarios as examples, and cannot cover all service scenarios.
According to the importance degree of the business scenario, as shown in table 2, the following model is set (the design of the model may depend on the history data or may be configured according to the scale of the business scenario):
| business scenario | Weight is set |
| Pushing account single day to user | 1 |
| Credit card repayment reminding | 3 |
| Batch deduction | 3 |
| Second family repayment vertical reduction 5 marketing activities | 2 |
TABLE 2
In some embodiments, determining business scenarios for an interface based on plan execution data includes:
Traversing each record in the plan execution data; the plan execution data is obtained through processing data of each execution system; and determining each corresponding interface under the service scene related to each record according to the corresponding relation between the service scene and the interfaces, thereby obtaining each corresponding service scene of each interface in the historical execution data.
Specifically, the transaction data in each business scenario is obtained by different modules, the product range, the user group and the number of users are different, and the plan execution data are not the same. Therefore, a generic data model needs to be abstracted to support the business scenario execution plan.
For example, as shown in table 3, the following model is set (the design of the model may depend on historical data or may be configured according to the scale of the business scenario):
TABLE 3 Table 3
The business scenario execution plan model data needs to be processed according to different business data sources, and the following is exemplified:
for example, bill date data is processed and calculated every day by relying on a bill module;
for example, marketing campaign data, depending on a marketing module, synchronizes marketing plans in real time;
for example, batch deduction data depends on batch deduction modules and batch deduction time plans of different banks;
Whether or not the plan is validated, such as a credit card repayment scenario, indicates whether or not the plan is valid, and if the user repayment in advance, the credit card repayment day execution plan is invalid. This need is updated in real time to ensure data correctness.
According to the set weight and the set number of times of the interface in each service scene, determining the service weight, as shown in a formula (3):
Fun[i]＝[interfaces[1],…interfaces[i]…,interfaces[n]]×count[i]×
case_ … … formula (3)
Wherein interfaces [ i ] represent interfaces i, count [ i ] represents the number of times of the interfaces called by the scene, case_w represents the set weight corresponding to the scene, and Fun [ i ] is the business weight of the interfaces.
For example, 7.30 days of data are obtained from table 3 as table 4, there are a total of 8 pieces of planned execution data, wherein if "whether or not to take effect" is "no", no participation in calculation is performed.
TABLE 4 Table 4
Taking interface 2 as an example, combining table 1 and table 2, we obtain:
in the 1 st execution plan, the method is triggered for 2 times, and the weight of pushing account for a single day to a user is 1, so that Fun [2] =2 can be calculated;
in the execution plan 2, the method is triggered for 2 times, and the weight of pushing account for a single day to a user is 1, so that Fun [2] =2 can be calculated;
in the 3 rd execution plan, the method is triggered for 2 times, and the weight of pushing account for a single day to a user is 1, so that Fun [2] =2 can be calculated;
In the 4 th execution plan, 2 calls are triggered, and the weight of the credit card repayment reminding is 3, so that Fun [2] =6 can be calculated;
in the 5 th execution plan, 2 calls are triggered, and the weight of the credit card repayment reminding is 3, so that Fun [2] =6 can be calculated;
in the 6 th execution plan, the credit card repayment reminding weight is 3 after being triggered for 2 times, but if the credit card repayment reminding weight is effective, the credit card repayment reminding weight is not effective, and the credit card repayment reminding weight does not participate in calculation;
in execution plan 7, call Fun [2] =0 will be triggered 0 times;
in execution plan 8, call Fun [2] =0 will be triggered 0 times.
The cumulative weight of the interface 2 is then calculated as shown in equation (4):
BIZ_W[i]＝∑ i n ＝1 [interfaces[1],…interfaces[i]…,interfaces[n]]×
count [ i ]. Times.case_w … … equation (4)
Wherein BIZ_Wi is the accumulated business weight of the interface.
The cumulative weight of interface 2 is: biz_w2 ] =2+2+2+6+6=18. Accordingly, the interfaces 1, 3, 4 are also the same calculation processes.
Step 203, according to the technical weight of each interface and the service weight of each interface, the memory resource is adjusted for each interface.
Specifically, according to the technical weight and the service weight of each interface, the memory resource is adjusted for each interface, wherein the service weight of each interface is the accumulated service weight of each interface.
In some embodiments, according to the technical weight of each interface and the service weight of each interface, the memory resource is adjusted for each interface, as shown in fig. 3, including the following steps:
step 301, determining, for any interface, a first duty ratio of a technical weight of the interface to a technical weight of each interface, and a second duty ratio of a service weight of the interface to a service weight of each interface.
Specifically, after obtaining the technical weights of the interfaces, the technical weights of all the interfaces need to be calculated, and the technical weight of each interface occupies the first duty ratio of the technical weights of all the interfaces. After the service weights of the interfaces are obtained, the service weights of all the interfaces are calculated, and the service weight of each interface occupies a second duty ratio of the service weights of all the interfaces.
Step 302, determining the memory resource after interface adjustment according to the duty ratio of the technical weight, the duty ratio of the service weight, the first duty ratio, the second duty ratio and the available memory resource of the system.
Specifically, the duty ratio of the technical weight and the duty ratio of the service weight are preset values, which can be adjusted based on the actual scene, and rate+biz_rate=1. And determining the memory resources of the interface after adjustment according to the duty ratio of the technical weight, the duty ratio of the service weight, the first duty ratio, the second duty ratio and the available memory resources of the system. As shown in formula (5):
Wherein W [ i ]]Representing the technical weight of the i-th interface,BIZ_Wi is the technical weight sum of all interfaces]Traffic indicating the ith interfaceWeight(s)>For the sum of the traffic weights of all interfaces, mtotal represents the available memory resources of the system, n represents the number of all interfaces, rate represents the technical weight ratio, biz_rate represents the traffic weight ratio, rate=0.5, biz_rate=0.5, m [ i ]]Indicating the amount of memory resources that should be allocated by the i-th interface.
Calculating the memory resource quantity M [ i ] to be allocated by the current interface according to the formula (5)]Then use M [ i ]]Updating the amount of memory resources allocated by each interface so that the memory resources of each interface are M [ i ]]Updating the amount of the remaining available memory resources Massign of the system left ＝Massign-∑M i Wherein, massign is a memory resource that can be allocated by the system. The loop traverses until the memory resources that should be allocated for each interface are calculated.
For example, as the total available memory resource mtotal=2000 MB of the current system, the memory resource massign=2000 MB of the initial system can be allocated, and the free memory resource mfree=1000 MB. According to the memory allocation calculation formula, the technical weight of the interface and the interface service weight, the memory resource allocated by the interface can be calculated: the interface technology weights are [350,440,580,630] and the interface service weights are [35000,44000,58000,63000], respectively (the interface service weight calculation process is relatively complex, and the values are set for convenience of understanding here).
Memory resources allocated by interface 1:
M[1]＝(350/(350+440+580+630)*0.5+35000/(35000+44000
+58000+63000)*0.5)*2000MB＝350MB
and so on can be calculated:
memory resource M [2] =440 MB allocated by interface 2;
memory resource M [3] =580 MB allocated by interface 3;
interface 4 allocates memory resource M [4] =630 MB.
In some embodiments, before determining the reference sample matching the working state of the interface in the preamble period from the historical sample of the interface, the method further comprises: and determining that the memory utilization rate of any interface is greater than the threshold online and the idle memory resources of the system are less than the lowest threshold.
Specifically, before the memory resources of the interface are adjusted, it is first determined whether the memory usage of the interface is greater than an upper threshold and whether the free memory resources of the system are less than a minimum threshold. Because, if the memory utilization rate of the interface does not reach the upper threshold, the phenomenon of memory overflow of the interface does not exist; if the free memory resources of the system are less than the minimum threshold, the system is already in an overload state, and no matter how the resources are adjusted for the interface, the phenomenon of memory overflow always exists. Therefore, before using the memory resource allocation method provided in the embodiments of the present application, it is first determined whether the interface needs to be allocated and whether the system can be allocated.
In some embodiments, when the memory usage of any interface is below a threshold lower limit, releasing a portion of the memory resources of the interface; and if the memory utilization rate of any interface is greater than the upper threshold value and the free memory resources of the system are not less than the lowest threshold value, adding part of the memory resources in the free resources to the interface.
Specifically, after the memory resources of the interface are allocated, judging the memory utilization rate condition of the interface, and if the memory utilization rate of the interface is lower than the lower threshold value limit, indicating that the memory space of the interface is larger, and releasing the memory resources of the interface; if the memory utilization rate of the interface is greater than the upper threshold, the memory space of the interface is insufficient, and if the free memory resource of the system is not lower than the lowest threshold, the free resource can be added to the interface.
For example, firstly, the memory usage of each interface is counted, and the interface usage rate, that is, the memory duty ratio of the interface is calculated, for example: if there are N interfaces, the memory currently used by the ith interface is u [ i ]]The total amount of memory is used asThen the memory duty ratio used by the ith interface is:
for example, the current system has four interfaces, and the unit of the memory is MB;
The memory usage of each interface { u 1: 300, u 2: 200, u 3: 400, u 4: 100};
the total amount of current system memory usage is: u [1] +u [2] +u [3] +u [4] =1000;
the memory duty cycle p [1] =0.3 used by interface 1;
the memory duty cycle p [2] =0.2 used by interface 2;
the memory duty cycle p [3] =0.4 used by interface 3;
the memory duty cycle p [4] =0.1 used by interface 4.
The memory usage rate represents the current interface memory usage divided by the memory resource amount allocated by the system, and the memory usage rate threshold is a threshold set based on the daily system operation and maintenance experience, and is generally between 0 and 1.
If the memory usage rate of the interface is lower than the threshold lower limit:
setting a lower limit threshold value of the memory utilization rate as Tmin, and if the memory utilization rate pi of the interface is smaller than Tmin, releasing redundant memory resources to idle memory resources, wherein the redundant memory resources are calculated in the following way:
ei= (1-Tmin) pi Mtotal … … formula (7)
Next, the latest total available memory resources mtotal=mtotal-e [ i ] are calculated, and the latest free memory resources mfree=mfree+e [ i ] are calculated.
Examples: for example, setting a lower memory usage threshold tmin=0.3, and the 4 th interface memory usage u [4] =100 MB; the 4 th interface system allocates memory resources as M [4] =630 MB; according to the memory usage rate of the interface, the memory usage rate T [4] =100/630≡0.16 of the 4 th interface can be calculated, and if the memory usage rate is smaller than the lower limit threshold of the memory usage rate, the redundant memory resources are calculated as follows:
e[4]＝(1-0.3)*0.1*2000＝140MB。
The latest memory resource allocation is as follows:
the 1 st interface allocates the memory resource amount M [1] =350 MB
The 2 nd interface allocates the memory resource amount M [2] =440 MB
The 3 rd interface allocates the memory resource amount M [3] =580 MB
The 4 th interface allocates the memory resource amount M [4] =630 MB-140 mb=490 MB
If the other three interfaces do not trigger the threshold value, the allocated memory resources are not correspondingly adjusted. The latest total available memory resources mtotal=2000 MB-140 mb=1860 MB, and the latest free memory resources mfree=1000mb+140mb=1140 MB.
The memory utilization rate of the interface is greater than the upper threshold and the free memory resources of the system are not less than the lowest threshold:
setting the upper limit threshold of the memory utilization rate as Tmax, the lowest threshold of the idle memory resource as Tbree, if the memory utilization rate T [ i ] of the interface is larger than Tmax, increasing the memory resource allocation of the interface, wherein the calculation mode of the increased memory resource is shown as a formula (7):
f[i]＝(Tmax-Tmin)*P[i]*Mtotal……(8)
next, the latest total available memory resources mtotal=mtotal+f [ i ] are calculated, and the latest free memory resources mfree=mfree-f [ i ] are calculated.
If the free memory resource Mfree is less than or equal to Tfire, the memory resource reallocation process is triggered.
Examples: for example, setting an upper memory usage threshold tmax=0.8, and the 3 rd interface memory usage u [1] =300 MB; the 1 st interface system allocates memory resources M [1] =350 MB; according to the memory usage rate of the interfaces, the memory usage rate T [1] ≡0.86 of the 1 st interface can be calculated, which is larger than the upper limit threshold of the memory usage rate, and the added memory resources are calculated as follows according to the formula:
f[1]＝(0.8-0.3)*0.3*2000MB＝300MB
The latest memory resource allocation is as follows:
the 1 st interface allocates the memory resource amount M [1] =350mb+300mb=650mb
The 2 nd interface allocates the memory resource amount M [2] =440 MB
The 3 rd interface allocates the memory resource amount M [3] =580 MB
The 4 th interface allocates the memory resource amount M [4] =630 MB-140 mb=490 MB
The latest total available memory resource mtotal=2160mb, the latest free memory resource Mfree
＝840MB。
If the free memory resource Mfree is less than or equal to the free memory resource minimum threshold Tfree, for example, the free memory resource minimum threshold is tfree=500 MB, and mtotal=2500 MB, mfree=500 MB at this time, a memory resource reallocation process is triggered.
Based on the same technical concept, the embodiment of the present application provides an interface memory resource allocation device, as shown in fig. 4, the device 400 includes:
a determining module 401, configured to determine, for any interface, a reference sample that matches with a working state of the interface in a preamble period from historical samples of the interface; determining the technical weight of the interface according to the working state of the reference sample in the subsequent period; the preamble period is a period before the adjustment time in one working period; the subsequent time period is a time period positioned after the adjustment time in one working period;
A triggering module 402, configured to determine each service scenario of the interface based on the plan execution data; determining the service weight of the interface according to the set working state of the interface in each service scene;
and the adjusting module 403 is configured to adjust the memory resource for each interface according to the technical weight of each interface and the service weight of each interface.
Optionally, the triggering module 402 is specifically configured to:
for any service scene, according to the corresponding relation between the service scene and the interface, determining the set and adjusted times of the interface under the service scene;
and determining the service weight corresponding to the interface according to the set weight of the interface in each service scene and the set tuned times of the interface in each service scene.
Optionally, the determining module 401 is specifically configured to:
determining a fitting value of the working state of any historical sample in the period corresponding to the preamble period and the working state of the interface in the preamble period; determining a history sample corresponding to the minimum fitting value as a reference sample;
determining the technical weight of the interface according to the working state of the reference sample in the subsequent period, wherein the method comprises the following steps:
and determining the technical weight of the interface according to the request times and the response time length of the reference sample in the next period of the adjustment time.
Optionally, the adjusting module 403 is specifically configured to:
for any interface, determining a first duty ratio of the technical weight of the interface to the technical weight of each interface and a second duty ratio of the service weight of the interface to the service weight of each interface;
and determining the memory resources after the interface adjustment according to the duty ratio of the technical weight, the duty ratio of the service weight, the first duty ratio, the second duty ratio and the system available memory resources.
Optionally, the determining module 401 is specifically configured to:
traversing each record in the plan execution data; the plan execution data are obtained through processing data of each execution system;
and determining each corresponding interface under the service scene related to each record according to the corresponding relation between the service scene and the interfaces, thereby obtaining each corresponding service scene of each interface in the historical execution data.
Optionally, the determining module 401 is further configured to:
and determining that the memory utilization rate of any interface is greater than the threshold online and the idle memory resources of the system are less than the lowest threshold.
Optionally, the determining module 401 is further configured to:
when the memory utilization rate of any interface is lower than the threshold value, releasing part of memory resources of the interface;
And if the memory utilization rate of any interface is greater than the threshold value and the idle memory resources of the system are not less than the lowest threshold value, increasing part of the memory resources in the idle resources to the interface.
Based on the same technical concept, the embodiments of the present application provide a computer device, which may be a terminal or a server, as shown in fig. 5, including at least one processor 501 and a memory 502 connected to the at least one processor, where a specific connection medium between the processor 501 and the memory 502 is not limited in the embodiments of the present application, and a bus connection between the processor 501 and the memory 502 in fig. 5 is an example. The buses may be divided into address buses, data buses, control buses, etc.
In the embodiment of the present application, the memory 502 stores instructions executable by the at least one processor 501, and the at least one processor 501 may execute the steps included in the above-described interface memory resource allocation method by executing the instructions stored in the memory 502.
The processor 501 is a control center of a computer device, and may utilize various interfaces and lines to connect various parts of the computer device, and execute or execute instructions stored in the memory 502 and invoke data stored in the memory 502, thereby allocating memory resources of the interface. Alternatively, the processor 501 may include one or more processing units, and the processor 501 may integrate an application processor and a modem processor, wherein the application processor primarily processes operating systems, user interfaces, application programs, etc., and the modem processor primarily processes wireless communications. It will be appreciated that the modem processor described above may not be integrated into the processor 501. In some embodiments, processor 501 and memory 502 may be implemented on the same chip, or they may be implemented separately on separate chips in some embodiments.
The processor 501 may be a general purpose processor such as a Central Processing Unit (CPU), digital signal processor, application specific integrated circuit (Application Specific Integrated Circuit, ASIC), field programmable gate array or other programmable logic device, discrete gate or transistor logic, discrete hardware components, and may implement or perform the methods, steps, and logic blocks disclosed in embodiments of the present application. The general purpose processor may be a microprocessor or any conventional processor or the like. The steps of a method disclosed in connection with the embodiments of the present application may be embodied directly in a hardware processor for execution, or in a combination of hardware and software modules in the processor for execution.
The memory 502, as a non-volatile computer readable storage medium, may be used to store non-volatile software programs, non-volatile computer executable programs, and modules. The Memory 502 may include at least one type of storage medium, and may include, for example, flash Memory, hard disk, multimedia card, card Memory, random access Memory (Random Access Memory, RAM), static random access Memory (Static Random Access Memory, SRAM), programmable Read-Only Memory (Programmable Read Only Memory, PROM), read-Only Memory (ROM), charged erasable programmable Read-Only Memory (Electrically Erasable Programmable Read-Only Memory), magnetic Memory, magnetic disk, optical disk, and the like. Memory 502 is any other medium that can be used to carry or store desired program code in the form of instructions or data structures and that can be accessed by a computer, but is not limited to such. The memory 502 in the present embodiment may also be circuitry or any other device capable of implementing a memory function for storing program instructions and/or data.
Based on the same inventive concept, the embodiments of the present application provide a computer readable storage medium storing a computer program executable by a computer device, which when run on the computer device, causes the computer device to perform the steps of the above-mentioned interface memory resource allocation method.
It will be appreciated by those skilled in the art that embodiments of the present application may be provided as a method, system, or computer program product. Accordingly, the present application may take the form of an entirely hardware embodiment, an entirely software embodiment, or an embodiment combining software and hardware aspects. Furthermore, the present application may take the form of a computer program product embodied on one or more computer-usable storage media (including, but not limited to, disk storage, CD-ROM, optical storage, and the like) having computer-usable program code embodied therein.
The present application is described with reference to flowchart illustrations and/or block diagrams of methods, apparatus (systems) and computer program products according to the application. It will be understood that each flow and/or block of the flowchart illustrations and/or block diagrams, and combinations of flows and/or blocks in the flowchart illustrations and/or block diagrams, can be implemented by computer program instructions. These computer program instructions may be provided to a processor of a general purpose computer, special purpose computer, embedded processor, or other programmable data processing apparatus to produce a machine, such that the instructions, which execute via the processor of the computer or other programmable data processing apparatus, create means for implementing the functions specified in the flowchart flow or flows and/or block diagram block or blocks.
These computer program instructions may also be stored in a computer-readable memory that can direct a computer or other programmable data processing apparatus to function in a particular manner, such that the instructions stored in the computer-readable memory produce an article of manufacture including instruction means which implement the function specified in the flowchart flow or flows and/or block diagram block or blocks.
These computer program instructions may also be loaded onto a computer or other programmable data processing apparatus to cause a series of operational steps to be performed on the computer or other programmable apparatus to produce a computer implemented process such that the instructions which execute on the computer or other programmable apparatus provide steps for implementing the functions specified in the flowchart flow or flows and/or block diagram block or blocks.
It will be apparent to those skilled in the art that various modifications and variations can be made in the present application without departing from the spirit or scope of the application. Thus, if such modifications and variations of the present application fall within the scope of the claims and the equivalents thereof, the present application is intended to cover such modifications and variations.
Claims (10)
1. The method for allocating the interface memory resources is characterized by comprising the following steps:
for any interface, determining a reference sample matched with the working state of the interface in a preamble period from the historical samples of the interface; determining the technical weight of the interface according to the working state of the reference sample in the subsequent period; the preamble period is a period before the adjustment time in one working period; the subsequent time period is a time period positioned after the adjustment time in one working period;
determining each service scene of the interface based on plan execution data; determining the service weight of the interface according to the set working state of the interface in each service scene;
and adjusting memory resources for each interface according to the technical weight of each interface and the service weight of each interface.
2. The method as claimed in claim 1, comprising: the determining the service weight of the interface according to the set working state of the interface in each service scene comprises the following steps:
for any service scene, according to the corresponding relation between the service scene and the interface, determining the set and adjusted times of the interface under the service scene;
and determining the service weight corresponding to the interface according to the set weight of the interface in each service scene and the set tuned times of the interface in each service scene.
3. The method as claimed in claim 1, comprising: the working state of the interface comprises the request times of the interface and the response time of the interface; determining a reference sample matched with the working state of the interface in a preamble period from the historical samples of the interface, wherein the reference sample comprises the following components:
determining a fitting value of the working state of any historical sample in the period corresponding to the preamble period and the working state of the interface in the preamble period; determining a history sample corresponding to the minimum fitting value as a reference sample;
determining the technical weight of the interface according to the working state of the reference sample in the subsequent period, wherein the method comprises the following steps:
and determining the technical weight of the interface according to the request times and the response time length of the reference sample in the next period of the adjustment time.
4. The method of claim 1, wherein the adjusting memory resources for each interface according to the technical weight of each interface and the traffic weight of each interface comprises:
for any interface, determining a first duty ratio of the technical weight of the interface to the technical weight of each interface and a second duty ratio of the service weight of the interface to the service weight of each interface;
And determining the memory resources after the interface adjustment according to the duty ratio of the technical weight, the duty ratio of the service weight, the first duty ratio, the second duty ratio and the system available memory resources.
5. The method according to any one of claims 1 to 4, wherein determining each traffic scenario of the interface based on planned execution data comprises:
traversing each record in the plan execution data; the plan execution data are obtained through processing data of each execution system;
and determining each corresponding interface under the service scene related to each record according to the corresponding relation between the service scene and the interfaces, thereby obtaining each corresponding service scene of each interface in the historical execution data.
6. The method according to any one of claims 1 to 4, further comprising, before determining a reference sample from the historical samples of the interface that matches the operational state of the interface during the preamble period:
and determining that the memory utilization rate of any interface is greater than the threshold online and the idle memory resources of the system are less than the lowest threshold.
7. The method as recited in claim 6, further comprising:
when the memory utilization rate of any interface is lower than the threshold value, releasing part of memory resources of the interface;
And if the memory utilization rate of any interface is greater than the threshold value and the idle memory resources of the system are not less than the lowest threshold value, increasing part of the memory resources in the idle resources to the interface.
8. An interface memory resource allocation device, comprising:
the determining module is used for determining a reference sample matched with the working state of the interface in the preamble period from the historical samples of the interface aiming at any interface; determining the technical weight of the interface according to the working state of the reference sample in the subsequent period; the preamble period is a period before the adjustment time in one working period; the subsequent time period is a time period positioned after the adjustment time in one working period;
the triggering module is used for determining each business scene triggered by the interface in the time period of the reference sample based on historical execution data in the time period of the reference sample; determining the service weight of the interface according to the set working state of the interface in each service scene;
and the adjusting module is used for adjusting the memory resources for each interface according to the technical weight of each interface and the service weight of each interface.
9. An electronic device comprising a memory, a processor and a computer program stored on the memory and executable on the processor, the processor implementing the steps of the method of any one of claims 1 to 7 when the program is executed.
10. A computer readable storage medium, characterized in that it stores a computer program executable by a computer device, which program, when run on the computer device, causes the computer device to perform the steps of the method according to any one of claims 1-7.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202311582581.XA CN117591287A (en) | 2023-11-23 | 2023-11-23 | Interface memory resource allocation method, device, equipment and storage medium |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202311582581.XA CN117591287A (en) | 2023-11-23 | 2023-11-23 | Interface memory resource allocation method, device, equipment and storage medium |
Publications (1)
| Publication Number | Publication Date |
|---|---|
| CN117591287A true CN117591287A (en) | 2024-02-23 |
Family
ID=89917868
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN202311582581.XA Pending CN117591287A (en) | 2023-11-23 | 2023-11-23 | Interface memory resource allocation method, device, equipment and storage medium |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN117591287A (en) |
-
2023
- 2023-11-23 CN CN202311582581.XA patent/CN117591287A/en active Pending
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN109783237B (en) | Resource allocation method and device | |
| CN108574645B (en) | Queue scheduling method and device | |
| CN109032800A (en) | A kind of load equilibration scheduling method, load balancer, server and system | |
| CN113342498A (en) | Concurrent request processing method, device, server and storage medium | |
| CN114866547B (en) | Virtual resource allocation method, device, equipment and storage medium | |
| CN111585798B (en) | Network resource parameter configuration method, device and computer readable storage medium | |
| CN112579692A (en) | Data synchronization method, device, system, equipment and storage medium | |
| CN114282011B (en) | Knowledge graph construction method and device, and graph calculation method and device | |
| CN113360269A (en) | Task allocation method, device, server and storage medium | |
| CN114185675A (en) | Resource management method, device, electronic equipment and storage medium | |
| CN110489418B (en) | Data aggregation method and system | |
| WO2019024475A1 (en) | Breakpoint list distribution method and apparatus, and server and medium | |
| CN103248622A (en) | Method and system for guaranteeing service quality of automatic retractable online video | |
| CN114143327A (en) | Cluster resource quota allocation method and device and electronic equipment | |
| CN108563504A (en) | A kind of resource management-control method and device | |
| CN109150593B (en) | Method and device for managing resources in cloud data system | |
| CN117591287A (en) | Interface memory resource allocation method, device, equipment and storage medium | |
| CN111984677A (en) | Resource data checking method and device, computer equipment and storage medium | |
| CN115208893B (en) | Resource scheduling method and device | |
| CN111429125B (en) | Account management method and device, storage medium and electronic equipment | |
| CN115640167A (en) | Data backup method and device, electronic equipment and storage medium | |
| CN113409147B (en) | Account data processing method, device, electronic equipment and storage medium | |
| CN114157482A (en) | Service access control method, device, control equipment and storage medium | |
| CN111131393B (en) | User activity data statistical method, electronic device and storage medium | |
| CN114040013B (en) | Book flow distribution method, calculation device and computer storage medium |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| PB01 | Publication | ||
| PB01 | Publication |