CN108829514A - A kind of memory allocation method and platform - Google Patents
A kind of memory allocation method and platform Download PDFInfo
- Publication number
- CN108829514A CN108829514A CN201810522640.7A CN201810522640A CN108829514A CN 108829514 A CN108829514 A CN 108829514A CN 201810522640 A CN201810522640 A CN 201810522640A CN 108829514 A CN108829514 A CN 108829514A
- Authority
- CN
- China
- Prior art keywords
- amount
- memory
- memory allocation
- history
- allocation
- 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
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
Landscapes
- Engineering & Computer Science (AREA)
- Software Systems (AREA)
- Theoretical Computer Science (AREA)
- Physics & Mathematics (AREA)
- General Engineering & Computer Science (AREA)
- General Physics & Mathematics (AREA)
- Information Retrieval, Db Structures And Fs Structures Therefor (AREA)
- Memory System (AREA)
Abstract
The invention discloses a kind of memory allocation method and platforms, this method generates the free memory amount of system according to the first Memory Allocation amount of the first pre-generated process, if judge that the free memory amount of the system is less than or equal to the Memory Allocation amount of the second process, the second Memory Allocation amount that first process is generated according to history maximum memory usage amount corresponding with the first process and System History least residue amount of ram is the first process storage allocation according to the second Memory Allocation amount.One aspect of the present invention is able to ascend the operation fluency of process, on the other hand can also avoid the waste of memory.
Description
Technical field
The present invention relates to field of computer technology, in particular to a kind of memory allocation method and platform.
Background technique
When there is new process access database, need for the new process storage allocation.Existing memory allocation method can not
Memory size needed for prediction process is often process storage allocation according to memory value is preset.If default memory value is too small, meeting
Cause process smooth can not run；If default memory value is excessive, and it will cause the waste of memory.
Summary of the invention
The present invention is directed at least solve one of the technical problems existing in the prior art, a kind of memory allocation method is provided
And platform, it is on the one hand able to ascend the operation fluency of process, on the other hand can also avoid the waste of memory.
To achieve the above object, the present invention provides a kind of memory allocation methods, including：
The free memory amount of system is generated according to the first Memory Allocation amount of the first pre-generated process；
Judge whether the free memory amount of the system is less than or equal to the Memory Allocation amount of the second process；
If judging, the free memory amount of the system is less than or equal to the Memory Allocation amount of the second process, according to first
The corresponding history maximum memory usage amount of process and System History least residue amount of ram generate in the second of first process
Deposit sendout；
It is the first process storage allocation according to the second Memory Allocation amount.
Optionally, the first Memory Allocation amount of the first process pre-generated in the basis generates the free memory of system
Further include before amount：
Receive the connection request of the first process；
It obtains pre-stored history maximum memory usage amount corresponding with first process and System History minimum is surplus
Remaining amount of ram；
Institute is generated according to history maximum memory usage amount corresponding with the first process and System History least residue amount of ram
State the first Memory Allocation amount of the first process；
It is the first process storage allocation according to the first Memory Allocation amount of first process.
Optionally, it is described according to the second Memory Allocation amount be the first process storage allocation before further include：
Receive the connection request of the first process；
Obtain the second Memory Allocation amount of pre-stored first process.
Optionally, further include：
If judging, the free memory amount of the system is less than or equal to the Memory Allocation amount of the second process, pre- according to system
If memory value is the second process storage allocation.
Optionally, in basis history maximum memory usage amount corresponding with the first process and System History least residue
The first Memory Allocation amount that storage generates first process specifically includes：
Pass through formula M3=Min (M1,M2* 0.618) the first Memory Allocation amount of first process is generated, wherein M1 table
Show history maximum memory usage amount corresponding with the first process, M2 is indicated in System History least residue corresponding with the first process
Storage, M3 indicate the first Memory Allocation amount of the first process.
Optionally, in basis history maximum memory usage amount corresponding with the first process and System History least residue
The second Memory Allocation amount that storage generates first process specifically includes：
Pass through formula M4=Min (M1,M2*0.6182) generate the second Memory Allocation amount of first process, wherein M1
Indicate history maximum memory usage amount corresponding with the first process, M2 indicates System History least residue corresponding with the first process
Amount of ram, M4 indicate the second Memory Allocation amount of the first process.
To achieve the above object, the present invention also provides a kind of Memory Allocation platforms, including：Generation module, judgment module
And distribution module；
The generation module generates the residue of system for the first Memory Allocation amount according to the first pre-generated process
Amount of ram, if judgment module judges that the free memory amount of the system is less than or equal to the Memory Allocation amount of the second process, root
First process is generated according to history maximum memory usage amount corresponding with the first process and System History least residue amount of ram
The second Memory Allocation amount；
The judgment module, for judging whether the free memory amount of the system is less than or equal to the memory of the second process
Sendout；
The distribution module, for being the first process storage allocation according to the second Memory Allocation amount.
Optionally, further include：Receiving module and acquisition module；
The receiving module, for receiving the connection request of the first process；
The acquisition module, for obtaining pre-stored history maximum memory usage amount corresponding with first process
With System History least residue amount of ram；
The generation module is also used to basis history maximum memory usage amount corresponding with the first process and System History most
Small free memory amount generates the first Memory Allocation amount of first process；
The distribution module is also used to according to the first Memory Allocation amount of first process be the first process storage allocation.
Optionally, the second Memory Allocation amount for obtaining module and being also used to obtain pre-stored first process.
Optionally, if the distribution module is also used to judgment module and judges that the free memory amount of the system is less than or waits
It is the second process storage allocation according to systemic presupposition memory value in the Memory Allocation amount of the second process.
The invention has the advantages that：
Memory allocation method provided by the invention generates system according to the first Memory Allocation amount of the first pre-generated process
The free memory amount of system, if judge that the free memory amount of the system is less than or equal to the Memory Allocation amount of the second process,
According to history maximum memory usage amount corresponding with the first process and System History least residue amount of ram generate described first into
Second Memory Allocation amount of journey is the first process storage allocation according to the second Memory Allocation amount.One aspect of the present invention
It is able to ascend the operation fluency of process, on the other hand can also avoid the waste of memory.
Detailed description of the invention
Fig. 1 is a kind of flow diagram for memory allocation method that the embodiment of the present invention one provides；
Fig. 2 is a kind of flow diagram of memory allocation method provided by Embodiment 2 of the present invention；
Fig. 3 is a kind of structural schematic diagram for Memory Allocation platform that the embodiment of the present invention three provides.
Specific embodiment
To make those skilled in the art more fully understand technical solution of the present invention, with reference to the accompanying drawing in the present invention
Technical solution carry out clear, complete description, it is clear that described embodiment is a part of the embodiments of the present invention, without
It is whole embodiments.Based on the embodiments of the present invention, those of ordinary skill in the art are not making creative work
Under the premise of every other embodiment obtained, shall fall within the protection scope of the present invention.
Embodiment one
Fig. 1 is a kind of flow diagram for memory allocation method that the embodiment of the present invention one provides, as shown in Figure 1, this is interior
Depositing distribution method includes：
Step 101, the free memory amount that system is generated according to the first Memory Allocation amount of the first pre-generated process.
Step 102 judges whether the free memory amount of the system is less than or equal to the Memory Allocation amount of the second process, if
It is to execute step 103；If it is not, process terminates.
Step 103, basis history maximum memory usage amount corresponding with the first process and System History least residue memory
Amount generates the second Memory Allocation amount of first process.
Step 104 according to the second Memory Allocation amount is the first process storage allocation, and process terminates.
Memory allocation method provided in this embodiment is generated according to the first Memory Allocation amount of the first pre-generated process
The free memory amount of system, if judging, the free memory amount of the system is less than or equal to the Memory Allocation amount of the second process
When, described first is generated according to history maximum memory usage amount corresponding with the first process and System History least residue amount of ram
Second Memory Allocation amount of process is the first process storage allocation according to the second Memory Allocation amount.One side of this method
Face is able to ascend the operation fluency of process, on the other hand can also avoid the waste of memory.
Embodiment two
Fig. 2 is a kind of flow diagram of memory allocation method provided by Embodiment 2 of the present invention, as shown in Fig. 2, this is interior
Depositing distribution method includes：
Step 201, the connection request for receiving the first process.
Preferably, each step of the present embodiment is executed by Memory Allocation platform.
System described in the present embodiment can be understood as database.The present embodiment is with oracle database (inscriptions on bones or tortoise shells number
According to library) for be illustrated.Oracle database is that the memory of process distribution includes two types：Each process, which can be shared, to be used
SGA (System Global Area, system cleanout) and PGA (the Program Global being only used alone for some process
Areas, program global area), the memory allocation method of the present embodiment is allocated only for PGA.Further, the present embodiment
Process involved in memory allocation method is the process of cycling service, such as：Daily morning full dose updates user message table number
According to process, the full dose beginning of each month update user's marketing data process.
The connection request of first process indicates that the first process requested is connected to system.
Step 202, the pre-stored history maximum memory usage amount corresponding with first process of acquisition and system are gone through
History least residue amount of ram.
History maximum memory usage amount M1 corresponding with the first process refers to the history maximum memory when operation of the first process
Usage amount, System History least residue amount of ram M2 corresponding with the first process refer to generated when the first process access system
System History least residue amount of ram.
Preferably, the maximum memory usage amount when operation of pre-stored nearest ten the first processes and nearest ten times are obtained
System least residue amount of ram when first process is run.System least residue amount of ram is system minimum free memory amount.
Step 203, basis history maximum memory usage amount corresponding with the first process and System History least residue memory
Amount generates the first Memory Allocation amount of first process.
Specifically, pass through formula M3=Min (M1,M2* 0.618) the first Memory Allocation amount of first process is generated,
In, M1 indicates history maximum memory usage amount corresponding with the first process, and M2 indicates System History corresponding with the first process most
Small free memory amount, M3 indicate the first Memory Allocation amount of the first process.
In the present embodiment, M1 and M2 are dynamic variable, and the real value of M1 and M2 are recorded in data dictionary v $ sesstat, v
In $ process, system read a data dictionary every one second to record the real value of M1 and M2.
Step 204, according to the first Memory Allocation amount of first process be the first process storage allocation.
The memory size of this access system of the first process is the size of the first Memory Allocation amount.
Step 205, the free memory amount that system is generated according to the first Memory Allocation amount of the first pre-generated process.
Such as：The free memory amount of system before remembering the first process access system is n1, the then system generated in this step 205
Free memory amount n2=n1-M3.
Step 206, the connection request for receiving the second process.
Second process is that the process of access system is requested when the first process is run.
The execution sequence of step 205 and step 206 can change as needed, for example, step 206 can be in step 205
Execution before or step 205 and step 206 can be performed simultaneously.
Step 207 judges whether the free memory amount of the system is less than or equal to the Memory Allocation amount of the second process, if
It is to execute step 208；If it is not, process terminates.
The Memory Allocation amount of second process can be the first Memory Allocation amount of the second process, wherein the of the second process
The generating mode of one Memory Allocation amount is identical as the generating mode of the first Memory Allocation amount of the first process, and for details, reference can be made to above-mentioned
Description in step 203.
If judging, the free memory amount of the system is less than or equal to the Memory Allocation amount of the second process, and expression is this time
First process distribution memory it is excessive, cause subsequent second process can not normal access system, execute step 208.If judgement
The free memory amount of the system is greater than the Memory Allocation amount of the second process out, indicates that the memory this time for the distribution of the first process is suitable
Preferably, subsequent second process can normal access system.
Step 208, basis history maximum memory usage amount corresponding with the first process and System History least residue memory
Amount generates the second Memory Allocation amount of first process.
Specifically, pass through formula M4=Min (M1,M2*0.6182) the second Memory Allocation amount of first process is generated,
Wherein, M1 indicates history maximum memory usage amount corresponding with the first process, and M2 indicates System History corresponding with the first process
Least residue amount of ram, M4 indicate the second Memory Allocation amount of the first process.
First Memory Allocation amount of the second Memory Allocation amount of the first process less than the first process.
Second Memory Allocation amount of step 209, storage first process.
The second Memory Allocation amount of first process is stored for use when the first process access system next time.
Step 210, according to systemic presupposition memory value be the second process storage allocation.
Systemic presupposition memory value is the pre-set memory default value of system.It is worth noting that system is according to the system
Default memory value is the process storage allocation of the aperiodicity operation of access.
Optionally, when systemic presupposition memory value is unable to satisfy the operation demand of the second process, the second process wouldn't be accessed
System is until system has enough free memory amounts.
The execution sequence of step 208 and step 210 can change as needed, for example, step 210 can be in step 208
Execution before or step 208 and step 210 can be performed simultaneously.
Step 211, the connection request for receiving the first process.
Step 212, the second Memory Allocation amount for obtaining pre-stored first process.
Step 213, according to the second Memory Allocation amount be the first process storage allocation.
It is the distribution of the first process according to the second Memory Allocation amount of the first process when the first process access system next time
Memory.
Specifically, since last first process passes through the first Memory Allocation amount access system of the first process, so that being
The free memory amount of system is less than or equal to the Memory Allocation amount of the second process, namely makes the new process of subsequent request access system
Can not normal access system, when this receives the connection request of the first process, according to the first Memory Allocation than the first process
The the second Memory Allocation amount for measuring lesser first process is the first process storage allocation, so that the free memory amount of system is filled
Foot, to guarantee that the new process of subsequent request access system being capable of normal access system.
It is worth noting that the method for the present embodiment is not limited to according to the first Memory Allocation amount of the first process or first
Second Memory Allocation amount of process is the first process storage allocation.Such as：When the second Memory Allocation amount of the first process it is excessive so that
The new process of subsequent request access system can not normal access system when, can also be according to history most imperial palace corresponding with the first process
It deposits usage amount and System History least residue amount of ram generates the third Memory Allocation amount of first process and specifically passes through
Formula M5=Min (M1,M2*0.6183) generate the third Memory Allocation amount of first process.
Memory allocation method provided in this embodiment is generated according to the first Memory Allocation amount of the first pre-generated process
The free memory amount of system, if judging, the free memory amount of the system is less than or equal to the Memory Allocation amount of the second process
When, described first is generated according to history maximum memory usage amount corresponding with the first process and System History least residue amount of ram
Second Memory Allocation amount of process is the first process storage allocation according to the second Memory Allocation amount.This method passes through
The amount of ram of the historical data prediction process of cycling service process, carries out flexible modulation, a side when predicting that amount of ram is excessive
Face is able to ascend the operation fluency of process, on the other hand can also avoid the waste of memory.
Embodiment three
Fig. 3 is a kind of structural schematic diagram for Memory Allocation platform that the embodiment of the present invention three provides, as shown in figure 3, this is flat
Platform includes：Generation module 11, judgment module 12 and distribution module 13.
The generation module 11 is used to generate the surplus of system according to the first Memory Allocation amount of the first pre-generated process
Remaining amount of ram, if judgment module 12 judges that the free memory amount of the system is less than or equal to the Memory Allocation of the second process
Amount generates described first according to history maximum memory usage amount corresponding with the first process and System History least residue amount of ram
Second Memory Allocation amount of process.
The judgment module 12 is for judging whether the free memory amount of the system is less than or equal to the interior of the second process
Deposit sendout.
The distribution module 13 is used to according to the second Memory Allocation amount be the first process storage allocation.
Further, which further includes：Receiving module 14 and acquisition module 15.
The receiving module 14 is used to receive the connection request of the first process.
The acquisition module 15 is used for obtaining pre-stored history maximum memory corresponding with first process
Amount and System History least residue amount of ram.
The generation module 11 is also used to according to history maximum memory usage amount corresponding with the first process and System History
Least residue amount of ram generates the first Memory Allocation amount of first process.
The distribution module 13 is also used to be in the distribution of the first process according to the first Memory Allocation amount of first process
It deposits.
Further, second Memory Allocation for obtaining module 15 and being also used to obtain pre-stored first process
Amount.
Further, if the distribution module 13 is also used to judgment module 12 and judges that the free memory amount of the system is small
In or equal to the second process Memory Allocation amount, according to systemic presupposition memory value be the second process storage allocation.
The memory point that Memory Allocation platform provided in this embodiment provides for realizing above-described embodiment one or embodiment two
Method of completing the square.
Memory Allocation platform provided in this embodiment, generation module divide according to the first memory of the first pre-generated process
Dosage generate system free memory amount, if judgment module judge the system free memory amount be less than or equal to second into
When the Memory Allocation amount of journey, generation module is minimum according to history maximum memory usage amount corresponding with the first process and System History
Free memory amount generates the second Memory Allocation amount of first process, and distribution module is institute according to the second Memory Allocation amount
State the first process storage allocation.On the one hand the platform is able to ascend the operation fluency of process, on the other hand can also avoid interior
The waste deposited.
It is understood that the principle that embodiment of above is intended to be merely illustrative of the present and the exemplary implementation that uses
Mode, however the present invention is not limited thereto.For those skilled in the art, essence of the invention is not being departed from
In the case where mind and essence, various changes and modifications can be made therein, these variations and modifications are also considered as protection scope of the present invention.
Claims (10)
1. a kind of memory allocation method, which is characterized in that including：
The free memory amount of system is generated according to the first Memory Allocation amount of the first pre-generated process；
Judge whether the free memory amount of the system is less than or equal to the Memory Allocation amount of the second process；
If judge the system free memory amount be less than or equal to the second process Memory Allocation amount, according to the first process
Corresponding history maximum memory usage amount and System History least residue amount of ram generate the second memory point of first process
Dosage；
It is the first process storage allocation according to the second Memory Allocation amount.
2. memory allocation method according to claim 1, which is characterized in that in the first process that the basis pre-generates
The first Memory Allocation amount generate system free memory amount before further include：
Receive the connection request of the first process；
It obtains in pre-stored history maximum memory usage amount corresponding with first process and System History least residue
Storage；
Described the is generated according to history maximum memory usage amount corresponding with the first process and System History least residue amount of ram
First Memory Allocation amount of one process；
It is the first process storage allocation according to the first Memory Allocation amount of first process.
3. memory allocation method according to claim 2, which is characterized in that described according to the second Memory Allocation amount
To further include before the first process storage allocation：
Receive the connection request of the first process；
Obtain the second Memory Allocation amount of pre-stored first process.
4. memory allocation method according to claim 1, which is characterized in that further include：
If judging, the free memory amount of the system is less than or equal to the Memory Allocation amount of the second process, according in systemic presupposition
Depositing value is the second process storage allocation.
5. memory allocation method according to claim 2, which is characterized in that basis history corresponding with the first process
Maximum memory usage amount and System History least residue amount of ram generate the first Memory Allocation measurer body packet of first process
It includes：
Pass through formula M3=Min (M1,M2* 0.618) generate the first Memory Allocation amount of first process, wherein M1 indicate with
The corresponding history maximum memory usage amount of first process, M2 indicate System History least residue memory corresponding with the first process
Amount, M3 indicate the first Memory Allocation amount of the first process.
6. memory allocation method according to claim 1, which is characterized in that basis history corresponding with the first process
Maximum memory usage amount and System History least residue amount of ram generate the second Memory Allocation measurer body packet of first process
It includes：
Pass through formula M4=Min (M1,M2*0.6182) generating the second Memory Allocation amount of first process, wherein M1 is indicated
History maximum memory usage amount corresponding with the first process, M2 indicate System History least residue memory corresponding with the first process
Amount, M4 indicate the second Memory Allocation amount of the first process.
7. a kind of Memory Allocation platform, which is characterized in that including：Generation module, judgment module and distribution module；
The generation module generates the free memory of system for the first Memory Allocation amount according to the first pre-generated process
Amount, if judgment module judge the system free memory amount be less than or equal to the second process Memory Allocation amount, according to
The corresponding history maximum memory usage amount of first process and System History least residue amount of ram generate the of first process
Two Memory Allocation amounts；
The judgment module, for judging whether the free memory amount of the system is less than or equal to the Memory Allocation of the second process
Amount；
The distribution module, for being the first process storage allocation according to the second Memory Allocation amount.
8. Memory Allocation platform according to claim 7, which is characterized in that further include：Receiving module and acquisition module；
The receiving module, for receiving the connection request of the first process；
The acquisition module, for obtaining pre-stored history maximum memory usage amount corresponding with first process and being
System history least residue amount of ram；
The generation module is also used to surplus according to history maximum memory usage amount corresponding with the first process and System History minimum
Remaining amount of ram generates the first Memory Allocation amount of first process；
The distribution module is also used to according to the first Memory Allocation amount of first process be the first process storage allocation.
9. Memory Allocation platform according to claim 8, which is characterized in that the acquisition module is also used to obtain deposits in advance
Second Memory Allocation amount of first process of storage.
10. Memory Allocation platform according to claim 7, which is characterized in that if the distribution module is also used to judge mould
Block judges that the free memory amount of the system is less than or equal to the Memory Allocation amount of the second process, according to systemic presupposition memory value
For the second process storage allocation.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201810522640.7A CN108829514B (en) | 2018-05-28 | 2018-05-28 | Memory allocation method and platform |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201810522640.7A CN108829514B (en) | 2018-05-28 | 2018-05-28 | Memory allocation method and platform |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN108829514A true CN108829514A (en) | 2018-11-16 |
| CN108829514B CN108829514B (en) | 2020-11-10 |
Family
ID=64146199
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201810522640.7A Active CN108829514B (en) | 2018-05-28 | 2018-05-28 | Memory allocation method and platform |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN108829514B (en) |
Citations (8)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US6961835B2 (en) * | 2002-10-17 | 2005-11-01 | International Business Machines Corporation | System and method for autonomically reallocating memory among buffer pools |
| CN103544063A (en) * | 2013-09-30 | 2014-01-29 | 三星电子（中国）研发中心 | Method and device for removing processes applied to Android platform |
| CN104111892A (en) * | 2013-04-22 | 2014-10-22 | 鸿富锦精密工业（深圳）有限公司 | Internal memory dynamic distribution method and system |
| CN104182350A (en) * | 2013-05-28 | 2014-12-03 | 中国银联股份有限公司 | Memory management method and device aiming at application containing multiple processes |
| CN106034332A (en) * | 2015-03-16 | 2016-10-19 | 联想(北京)有限公司 | Information processing method and terminal |
| CN107291556A (en) * | 2017-08-01 | 2017-10-24 | 上海联影医疗科技有限公司 | Medical supply and its memory allocation method, device and storage medium |
| CN107341055A (en) * | 2017-07-03 | 2017-11-10 | 杭州知物数据科技有限公司 | The real-time dynamic management approach and system of distributed memory file system |
| CN107807965A (en) * | 2017-09-30 | 2018-03-16 | 广东美的制冷设备有限公司 | Progress control method, resource shared device and computer-readable recording medium |
-
2018
- 2018-05-28 CN CN201810522640.7A patent/CN108829514B/en active Active
Patent Citations (8)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US6961835B2 (en) * | 2002-10-17 | 2005-11-01 | International Business Machines Corporation | System and method for autonomically reallocating memory among buffer pools |
| CN104111892A (en) * | 2013-04-22 | 2014-10-22 | 鸿富锦精密工业（深圳）有限公司 | Internal memory dynamic distribution method and system |
| CN104182350A (en) * | 2013-05-28 | 2014-12-03 | 中国银联股份有限公司 | Memory management method and device aiming at application containing multiple processes |
| CN103544063A (en) * | 2013-09-30 | 2014-01-29 | 三星电子（中国）研发中心 | Method and device for removing processes applied to Android platform |
| CN106034332A (en) * | 2015-03-16 | 2016-10-19 | 联想(北京)有限公司 | Information processing method and terminal |
| CN107341055A (en) * | 2017-07-03 | 2017-11-10 | 杭州知物数据科技有限公司 | The real-time dynamic management approach and system of distributed memory file system |
| CN107291556A (en) * | 2017-08-01 | 2017-10-24 | 上海联影医疗科技有限公司 | Medical supply and its memory allocation method, device and storage medium |
| CN107807965A (en) * | 2017-09-30 | 2018-03-16 | 广东美的制冷设备有限公司 | Progress control method, resource shared device and computer-readable recording medium |
Also Published As
| Publication number | Publication date |
|---|---|
| CN108829514B (en) | 2020-11-10 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| Romero et al. | Goal programming, compromise programming and reference point method formulations: linkages and utility interpretations | |
| JP2019537923A (en) | Battery health status judgment and alarm generation | |
| CN109493184B (en) | Electric power clearing method, device, equipment and storage medium based on green certificate transaction | |
| CN105099951B (en) | A kind of resource regulating method and management equipment | |
| CN109995677A (en) | Resource allocation methods, device and storage medium | |
| CN109189323A (en) | Expansion method and equipment | |
| CN104407925A (en) | Dynamic resource distribution method | |
| CN106547481A (en) | A kind of data method for pre-distributing and equipment | |
| CN106887858A (en) | A kind of energy-storage system tracking plan for accessing generation of electricity by new energy is exerted oneself method and device | |
| CN111967986A (en) | Electric power market clearing method, system, device and medium containing cascade hydropower | |
| CN109713762A (en) | A kind of charge control method, device and terminal device | |
| Drukier et al. | Fokker-planck models and globular cluster evolution-the problem of m71 | |
| CN107169588A (en) | A kind of electric automobile charging station short-time rating Forecasting Methodology and system | |
| CN107515788A (en) | A kind of method and device of Memory Allocation | |
| CN106790332A (en) | A kind of resource regulating method, system and host node | |
| CN105990842A (en) | Electric peak regulation method and apparatus thereof | |
| CN108829514A (en) | A kind of memory allocation method and platform | |
| CN103761192B (en) | A kind of method and apparatus of Memory Allocation | |
| CN109472458A (en) | Prize inventory allocation method, apparatus, computer equipment and storage medium | |
| CN109039694A (en) | A kind of the global network resource allocation methods and device of service-oriented | |
| CN113162077B (en) | Aggregation management method and device for distributed energy storage, electronic equipment and storage medium | |
| CN109327035A (en) | A kind of electric car charge power adjusting method and system | |
| Le Bars et al. | An agent-based simulation for water sharing between different users | |
| CN105677662A (en) | Dynamic data control method and device | |
| CN106154170A (en) | The evaluation method of battery remaining power and system |
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 |