CN102521140B - Method and device for acquiring descriptor group of activities - Google Patents
Method and device for acquiring descriptor group of activities Download PDFInfo
- Publication number
- CN102521140B CN102521140B CN201110392530.1A CN201110392530A CN102521140B CN 102521140 B CN102521140 B CN 102521140B CN 201110392530 A CN201110392530 A CN 201110392530A CN 102521140 B CN102521140 B CN 102521140B
- Authority
- CN
- China
- Prior art keywords
- descriptor
- internal memory
- memory
- user space
- preserving
- 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.)
- Active
Links
Abstract
The invention discloses a method and device for acquiring a descriptor group of activities. The method comprises steps of distributing a memory for storing a descriptor in a kernel state, copying the descriptor on a movable linked list to the distributed memory, recording the descriptor and storing the mapping information among the memories of the descriptors, transmitting the mapping information to a user state, finding the memory stored with the descriptor under the user state based on the mapping information and acquiring the descriptor stored in the memory. The performance of a linux epoll mode can be optimized by the method and device for acquiring the descriptor group of activities, disclosed by the invention.
Description
Technical field
The present invention relates to control field, be specifically related to a kind of method and the device that obtain movable descriptor set.
Background technology
Epoll is linux kernel is that process handle in enormous quantities has made the poll improved, be the enhancing version of multiplexed I/O interface select/poll under Linux, it significantly can reduce system CPU utilization rate program only has a small amount of active in a large amount of concurrent connection.
Compared with traditional select pattern, it can not the incompatible transmission result of multiplexing file descriptor sets and force developer wait for event at every turn before all again must prepare the filec descriptor set that will be listened; When acquisition event, the whole descriptor set be listened need not be traveled through, as long as travel through those to be added the descriptor set of Ready queue by asynchronous the waking up of kernel IO event.
Epoll model provides 3 system interfaces:
(1) int epoll_create (int size): the handle creating an epoll;
(2) int epoll_ctl (int epfd, int op, int fd, struct epoll_event * event): register the descriptor and event type that will monitor;
(3) int epoll_wait (int epfd, struct epoll_event * events, int maxevents, int timeout): the generation waiting for event, parameter events is used for obtaining from kernel the set of event, and this events of the kernel of maxevents announcement has much.
In actual applications, epoll pattern realizes there are 2 problems below:
1., in order to obtain by the asynchronous descriptor set waken up of IO event from kernel state, user, must in User space allocation space when calling epoll_wait, and the size in this space determines the maximum number of the descriptor that once can obtain from kernel.
In real network, not not uncertain by the asynchronous descriptor quantity waken up of IO event in the same time, this quantity may exceed at the receptible maximum number of User space, and cause the descriptor that once cannot obtain all activities, the descriptor exceeding maximum number can not get processing timely.
2. because Memory Allocation is at User space, in order to obtain movable descriptor set, kernel state needs descriptor to copy User space space to from kernel state space, and the time complexity of system copy is linear rank O (n), n is the descriptor quantity of process, reduces the performance of system.
Summary of the invention
The technical problem to be solved in the present invention how to optimize the performance of linux epoll pattern.
In order to solve the problem, the invention provides a kind of method obtaining movable descriptor set, comprising:
The internal memory being used in and preserving descriptor is divided under kernel state;
Descriptor on movable chained list is copied in distributed internal memory, records the map information between described descriptor and the internal memory preserving this descriptor;
Described map information is delivered to User space;
Under User space, find the internal memory preserving descriptor according to described map information, obtain the descriptor wherein preserved.
Further, described being delivered to by map information between described descriptor and the internal memory preserving this descriptor in the step of User space also comprises:
The start physical address of distributed internal memory, length are delivered to User space.
Further, the described step being used in the internal memory preserving descriptor of dividing under kernel state comprises:
Under kernel state, determine the current quantity being in the descriptor of movable chained list, be recorded in the first field;
According to the quantity of described first field record, distribute the internal memory of the descriptor enough preserving this quantity at kernel spacing;
Preserve start physical address and the length of the internal memory distributed.
Further, described kernel spacing distribute enough preservation this quantity descriptor internal memory step before also comprise:
Quantity according to described first field record judges whether to re-start Memory Allocation; If this quantity is greater than the length of distributed internal memory, then re-start Memory Allocation, mapped identification is set to notify that User space needs to re-start memory-mapped, the internal memory distributed before release, then carries out described step of distributing the internal memory of the descriptor enough preserving this quantity at kernel spacing; If be not more than, then carry out the described step copied to by descriptor on movable chained list in distributed internal memory.
Further, also comprise in described step descriptor on movable chained list copied in distributed internal memory:
Empty described first field.
Further, described under User space according to described map information find preserve descriptor internal memory step before also comprise:
Under User space, determine whether to need to re-start memory-mapped according to described mapped identification; If needed, then notify that kernel state closes memory-mapped, then carry out the step finding the internal memory preserving descriptor under User space according to described map information; If do not needed, then directly carry out the step finding the internal memory preserving descriptor under User space according to described map information.
Further, described method also comprises:
Notify after ending process under User space that kernel state closes memory-mapped.
Further, described method also comprises:
When after the notice obtaining User space closedown memory-mapped under kernel state, discharge the internal memory for preserving descriptor distributed.
Present invention also offers a kind of device obtaining movable descriptor set, comprising:
Memory management module, for dividing the internal memory being used in and preserving descriptor under kernel state;
Memory module, for being copied in distributed internal memory by the descriptor on movable chained list, records the map information between described descriptor and the internal memory preserving this descriptor;
Notification module, for being delivered to User space by described map information;
Acquisition module, for finding the internal memory preserving descriptor under User space according to described map information, obtains the descriptor wherein preserved.
Further, when the map information between described descriptor and the internal memory preserving this descriptor is delivered to User space by described notification module, start physical address, the length of the internal memory also described memory management module distributed are delivered to User space.
Further, described memory management module comprises:
Dispensing unit, under kernel state, determines the current quantity being in the descriptor of movable chained list, is recorded in the first field;
Allocation units, for the quantity according to described first field record, distribute the internal memory of the descriptor enough preserving this quantity at kernel spacing;
Record cell, for after described allocation units distribute, preserves start physical address and the length of the internal memory distributed.
Further, described memory management module also comprises:
Judging unit, for judging whether to re-start Memory Allocation according to the quantity of described first field record; If this quantity is greater than the length of distributed internal memory, then re-start Memory Allocation, mapped identification is set to notify that User space needs to re-start memory-mapped, the internal memory distributed before release, then indicate described allocation units again according to the quantity of described first field record, distribute the internal memory of the descriptor enough preserving this quantity at kernel spacing; If be not more than, then described memory module is indicated to be copied in distributed internal memory by the descriptor on movable chained list.
Further, described memory module, also for when being copied in distributed internal memory by the descriptor on movable chained list, empties described first field.
Further, described acquisition module also for before find the internal memory preserving descriptor according to described map information, first determines whether to need to re-start memory-mapped according to described mapped identification; If needed, then notify that kernel state closes memory-mapped, then finds according to described map information the internal memory preserving descriptor under User space; If do not needed, then the direct internal memory finding preservation descriptor under User space according to described map information.
Further, described acquisition module also for after ending process under User space, and notice kernel state closes memory-mapped.
Further, described memory management module also for when after the notice obtaining User space closedown memory-mapped under kernel state, discharges the internal memory for preserving descriptor distributed.
Technical scheme of the present invention is at the original system API(Application Programming Interface of maintenance, application programming interface) while interface is constant, solve in linux system when obtaining event, the hydraulic performance decline that the memory copying of process kernel state and User space causes and the descriptor process problem not in time that may occur.
Accompanying drawing explanation
Fig. 1 is the schematic flow sheet of the method for the descriptor set of the acquisition activity of embodiment one;
Fig. 2 is the schematic flow sheet of object lesson in embodiment one.
Detailed description of the invention
Below in conjunction with drawings and Examples, technical scheme of the present invention is described in detail.
It should be noted that, if do not conflicted, each feature in the embodiment of the present invention and embodiment can be combined with each other, all within protection scope of the present invention.
Embodiment one, a kind of method obtaining movable descriptor set, as shown in Figure 1, comprising:
The internal memory being used in and preserving descriptor is divided under kernel state;
Descriptor on movable chained list is copied in distributed internal memory, records the map information between described descriptor and the internal memory preserving this descriptor;
Described map information is delivered to User space;
Under User space, find the internal memory preserving descriptor according to described map information, obtain the descriptor wherein preserved.
In the present embodiment, described being delivered to by map information between described descriptor and the internal memory preserving this descriptor in the step of User space can also comprise:
The start physical address of distributed internal memory, length are delivered to User space.
Can ensure that the api interface of system is constant like this, acquisition is simultaneously carried out memory-mapped and is operated necessary information.
In the present embodiment, the described step being used in the internal memory preserving descriptor of dividing under kernel state specifically can comprise:
Under kernel state, determine the current quantity being in the descriptor of movable chained list, be recorded in the first field;
According to the quantity of described first field record, distribute the internal memory of the descriptor enough preserving this quantity at kernel spacing;
Preserve start physical address and the length of the internal memory distributed.
In the present embodiment, described first field can be predefined one and be specifically designed to the newer field depositing this quantity, also can be one that specifies in spare field.
In the present embodiment, described kernel spacing distribute enough preservation this quantity descriptor internal memory step before can also comprise:
Quantity according to described first field record judges whether to re-start Memory Allocation; If this quantity is greater than the length of distributed internal memory, mapped identification is then set to notify that User space needs to re-start memory-mapped, the internal memory distributed before release, then carry out described step of distributing the internal memory of the descriptor enough preserving this quantity at kernel spacing, namely will re-start Memory Allocation.
If this quantity is not more than the length (i.e. length >=this quantity) of distributed internal memory, then do not re-start Memory Allocation, directly can carry out the described step copied to by descriptor on movable chained list in distributed internal memory.
In the present embodiment, in order to not reduce performance, do not use the mode of traversal chained list; In addition, because have descriptor when operant activity chained list to add movable chained list, in order to ensure the correct of record, descriptor on movable chained list is copied in the step in distributed internal memory, also to empty described first field, with ensure upper under kernel state, once point to be used in the internal memory preserving descriptor time, new quantity will be recorded in this first field.Certainly, not necessarily have to empty in this step, if record current be in the quantity of the descriptor of movable chained list before first empty this first field.
In the present embodiment, the start physical address of internal memory and length can be reset after redistributing and can mapped identification be set, to notify that User space re-starts memory-mapped.Whether no matter redistribute, all described mapped identification can be passed to User space, User space needs to determine whether remapping according to described mapped identification.
In the present embodiment, described under User space according to described map information find preserve descriptor internal memory step before can also comprise:
Under User space, determine whether to need to re-start memory-mapped according to described mapped identification; If needed, then notify that kernel state closes memory-mapped, then carry out the step finding the internal memory preserving descriptor under User space according to described map information; If do not needed, then directly carry out the step finding the internal memory preserving descriptor under User space according to described map information.
In the present embodiment, described method can also comprise:
Notify after ending process under User space that kernel state closes memory-mapped.
In the present embodiment, described method can also comprise:
When after the notice obtaining User space closedown memory-mapped under kernel state, discharge the internal memory for preserving descriptor distributed.
In the present embodiment, described User space can be, but not limited to notify that kernel state closes memory-mapped by file operation close function.
Below for Linux-2.6.36, illustrate the implementation method of the present embodiment.
Struct epoll_event structure can be utilized, by setting up following structure:
struct epoll_mmap
{
struct epoll_event event；
void* pPhysAddressStart;
size_t iLength;
int iRemmap;
}；
Under kernel state, adopt the current quantity being in the descriptor of movable chained list of the first field record, unsigned int uiRdllistCount member can be increased in struct eventpoll structure; UiRdllistCount member is updated when ep_poll_callback function adds movable chained list.
Under the protection of spin lock, when ep_scan_ready_list function performs list_splice_init by movable chained list splicing initialization, need to empty uiRdllistCount.
The internal memory distributed under kernel state needs to carry out record, can increase void* pVirtualAddressStart, size_t iLength member in struct eventpoll structure;
The process of ep_send_events_proc function to be skipped the operation that execution _ _ put_user copies User space space to;
Ep_send_events_proc function will compare uiRdllistCount and iLength, and determining whether needs to redistribute memory headroom;
If redistributed, the memory headroom distributed before ensureing to discharge, arranges mapped identification iRemmap and notifies that User space re-starts memory-mapped, and upgrade pVirtualAddressStart, iLength; Descriptor on movable chained list is copied in the internal memory of distribution.
User space, according to the mapped identification iRemmap returned, determines whether to need to re-start memory-mapped; If remapped, the memory-mapped before ensureing to close.In addition, when ending process, the closedown of memory-mapped be ensured.
By file operation close function, User space notifies that kernel state closes memory-mapped, when performing this operation, ep_eventpoll_release function can be called, and can complete internal memory release in this function.
The flow process of this example as shown in Figure 2, comprising:
A, under User space, call epoll.create; At kernel state initialization start physical address pPhysAddressStart, length iLength and for recording the current field uiRdllistCount being in the quantity of the descriptor of movable chained list; Create and successfully return handle;
Epoll_ctl is called at User space; Carry out three kinds of process at kernel state, three kinds of process comprise interpolation, amendment and delete the filec descriptor and event thereof that needs intercept, and process and successfully return to User space;
B, call epoll.wait at User space, process sleep waits for that Activity Description symbol event is waken up; After being waken up by Activity Description symbol, judge whether the quantity of preserving in iLength < uiRdllistCount, the internal memory if it is distributed before release, redistribute internal memory and upgrade pPhysAddressStart accordingly, then carrying out C; If not, the quantity of namely preserving in iLength >=uiRdllistCount, then directly carry out C;
C, copy Activity Description symbol, upgrade iLength and iRemmap, empty uiRdllistCount; PPhysAddressStart, iLength and iRemmap are returned to User space;
Judge whether that iRemmap is reset at User space, if it is re-start memory-mapped, then process Activity Description symbol, otherwise directly process Activity Description symbol;
If do not continue process after having processed, close memory-mapped, call close and close handle, at the internal memory that kernel state release pPhysAddressStart points to; If continue process, return step B.
Embodiment two, a kind of device obtaining movable descriptor set, comprising:
Memory management module, for dividing the internal memory being used in and preserving descriptor under kernel state;
Memory module, for being copied in distributed internal memory by the descriptor on movable chained list, records the map information between described descriptor and the internal memory preserving this descriptor;
Notification module, for being delivered to User space by described map information;
Acquisition module, for finding the internal memory preserving descriptor under User space according to described map information, obtains the descriptor wherein preserved.
In the present embodiment, when the map information between described descriptor and the internal memory preserving this descriptor is delivered to User space by described notification module, start physical address, the length of the internal memory that described memory management module can also be distributed are delivered to User space.
In the present embodiment, described memory management module specifically can comprise:
Dispensing unit, under kernel state, determines the current quantity being in the descriptor of movable chained list, is recorded in the first field;
Allocation units, for the quantity according to described first field record, distribute the internal memory of the descriptor enough preserving this quantity at kernel spacing;
Record cell, for after described allocation units distribute, preserves start physical address and the length of the internal memory distributed.
In the present embodiment, described memory management module can also comprise:
Judging unit, for judging whether to re-start Memory Allocation according to the quantity of described first field record; If this quantity is greater than the length of distributed internal memory, then re-start Memory Allocation, mapped identification is set to notify that User space needs to re-start memory-mapped, the internal memory distributed before release, then indicate described allocation units again according to the quantity of described first field record, distribute the internal memory of the descriptor enough preserving this quantity at kernel spacing; If be not more than, then do not re-start Memory Allocation, indicate described memory module to be copied in distributed internal memory by the descriptor on movable chained list.
In the present embodiment, described memory module for when being copied in distributed internal memory by the descriptor on movable chained list, can also empty described first field.
In the present embodiment, described acquisition module can also be used for, before find the internal memory preserving descriptor according to described map information, first determining whether to need to re-start memory-mapped according to described mapped identification; If needed, then notify that kernel state closes memory-mapped, then finds according to described map information the internal memory preserving descriptor under User space; If do not needed, then the direct internal memory finding preservation descriptor under User space according to described map information.
In the present embodiment, after described acquisition module can also be used for ending process under User space, notice kernel state closes memory-mapped.
In the present embodiment, described memory management module can also be used for, when after the notice obtaining User space closedown memory-mapped under kernel state, discharging the internal memory for preserving descriptor distributed.
Other realizes details can participate in embodiment one.
Certainly; the present invention also can have other various embodiments; when not deviating from the present invention's spirit and essence thereof; those of ordinary skill in the art are when making various corresponding change and distortion according to the present invention, but these change accordingly and are out of shape the protection domain that all should belong to claim of the present invention.
Claims (12)
1. obtain a method for Activity Description symbol set, comprising:
The internal memory being used in and preserving descriptor is divided under kernel state;
Descriptor on movable chained list is copied in distributed internal memory, records the map information between described descriptor and the internal memory preserving this descriptor;
Described map information is delivered to User space;
Under User space, find the internal memory preserving descriptor according to described map information, obtain the descriptor wherein preserved;
Wherein, the described step being used in the internal memory preserving descriptor of dividing under kernel state comprises:
Under kernel state, determine the current quantity being in the descriptor of movable chained list, be recorded in the first field; According to the quantity of described first field record, distribute the internal memory of the descriptor enough preserving this quantity at kernel spacing; Preserve start physical address and the length of the internal memory distributed;
Wherein, described kernel spacing distribute enough preservation this quantity descriptor internal memory step before also comprise:
Quantity according to described first field record judges whether to re-start Memory Allocation; If this quantity is greater than the length of distributed internal memory, then re-start Memory Allocation, mapped identification is set to notify that User space needs to re-start memory-mapped, the internal memory distributed before release, then carries out described step of distributing the internal memory of the descriptor enough preserving this quantity at kernel spacing; If be not more than, then carry out the described step copied to by descriptor on movable chained list in distributed internal memory.
2. the method for claim 1, is characterized in that, described being delivered to by map information between described descriptor and the internal memory preserving this descriptor in the step of User space also comprises:
The start physical address of distributed internal memory, length are delivered to User space.
3. the method for claim 1, is characterized in that, also comprises in the described step copied to by descriptor on movable chained list in distributed internal memory:
Empty described first field.
4. the method for claim 1, is characterized in that, described under User space according to described map information find preserve descriptor internal memory step before also comprise:
Under User space, determine whether to need to re-start memory-mapped according to described mapped identification; If needed, then notify that kernel state closes memory-mapped, then carry out the described step finding the internal memory preserving descriptor under User space according to described map information; If do not needed, then directly carry out the described step finding the internal memory preserving descriptor under User space according to described map information.
5. the method for claim 1, is characterized in that, also comprises:
Notify after ending process under User space that kernel state closes memory-mapped.
6. method as claimed in claim 5, is characterized in that, also comprise:
When after the notice obtaining User space closedown memory-mapped under kernel state, discharge the internal memory for preserving descriptor distributed.
7. obtain a device for Activity Description symbol set, it is characterized in that, comprising:
Memory management module, for dividing the internal memory being used in and preserving descriptor under kernel state;
Memory module, for being copied in distributed internal memory by the descriptor on movable chained list, records the map information between described descriptor and the internal memory preserving this descriptor;
Notification module, for being delivered to User space by described map information;
Acquisition module, for finding the internal memory preserving descriptor under User space according to described map information, obtains the descriptor wherein preserved;
Wherein, described memory management module comprises:
Dispensing unit, under kernel state, determines the current quantity being in the descriptor of movable chained list, is recorded in the first field;
Allocation units, for the quantity according to described first field record, distribute the internal memory of the descriptor enough preserving this quantity at kernel spacing;
Record cell, for after described allocation units distribute, preserves start physical address and the length of the internal memory distributed;
Described memory management module also comprises: judging unit, for judging whether to re-start Memory Allocation according to the quantity of described first field record; If this quantity is greater than the length of distributed internal memory, then re-start Memory Allocation, mapped identification is set to notify that User space needs to re-start memory-mapped, the internal memory distributed before release, then indicate described allocation units again according to the quantity of described first field record, distribute the internal memory of the descriptor enough preserving this quantity at kernel spacing; If be not more than, then described memory module is indicated to be copied in distributed internal memory by the descriptor on movable chained list.
8. device as claimed in claim 7, is characterized in that:
When map information between described descriptor and the internal memory preserving this descriptor is delivered to User space by described notification module, start physical address, the length of the internal memory also described memory management module distributed are delivered to User space.
9. device as claimed in claim 7, is characterized in that:
Described memory module, also for when being copied in distributed internal memory by the descriptor on movable chained list, empties described first field.
10. device as claimed in claim 7, is characterized in that:
Described acquisition module also for before find the internal memory preserving descriptor according to described map information, first determines whether to need to re-start memory-mapped according to described mapped identification; If needed, then notify that kernel state closes memory-mapped, then carry out the described internal memory finding preservation descriptor under User space according to described map information; If do not needed, then directly carry out the described internal memory finding preservation descriptor under User space according to described map information.
11. devices as claimed in claim 7, is characterized in that:
Described acquisition module also for after ending process under User space, and notice kernel state closes memory-mapped.
12. devices as claimed in claim 11, is characterized in that:
Described memory management module also for when after the notice obtaining User space closedown memory-mapped under kernel state, discharges the internal memory for preserving descriptor distributed.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201110392530.1A CN102521140B (en) | 2011-12-01 | 2011-12-01 | Method and device for acquiring descriptor group of activities |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201110392530.1A CN102521140B (en) | 2011-12-01 | 2011-12-01 | Method and device for acquiring descriptor group of activities |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN102521140A CN102521140A (en) | 2012-06-27 |
| CN102521140B true CN102521140B (en) | 2015-04-29 |
Family
ID=46292070
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201110392530.1A Active CN102521140B (en) | 2011-12-01 | 2011-12-01 | Method and device for acquiring descriptor group of activities |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN102521140B (en) |
Cited By (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN105471838A (en) * | 2015-11-10 | 2016-04-06 | 瑞斯康达科技发展股份有限公司 | Data processing method and device applied to L2TP |
Families Citing this family (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| WO2016097805A1 (en) * | 2014-12-14 | 2016-06-23 | Via Alliance Semicoductor Co., Ltd. | Cache memory budgeted by ways on memory access type |
Citations (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101227341A (en) * | 2007-12-18 | 2008-07-23 | 浪潮电子信息产业股份有限公司 | Method for fast catching Ethernet card on Linux system |
| CN101872312A (en) * | 2009-04-21 | 2010-10-27 | 张纪胜 | Method for dynamically acquiring process descriptors in client Linux by adopting VMM (Virtual Machine Monitor) |
-
2011
- 2011-12-01 CN CN201110392530.1A patent/CN102521140B/en active Active
Patent Citations (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101227341A (en) * | 2007-12-18 | 2008-07-23 | 浪潮电子信息产业股份有限公司 | Method for fast catching Ethernet card on Linux system |
| CN101872312A (en) * | 2009-04-21 | 2010-10-27 | 张纪胜 | Method for dynamically acquiring process descriptors in client Linux by adopting VMM (Virtual Machine Monitor) |
Cited By (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN105471838A (en) * | 2015-11-10 | 2016-04-06 | 瑞斯康达科技发展股份有限公司 | Data processing method and device applied to L2TP |
| CN105471838B (en) * | 2015-11-10 | 2018-11-27 | 瑞斯康达科技发展股份有限公司 | A kind of data processing method and device applied in L2TP |
Also Published As
| Publication number | Publication date |
|---|---|
| CN102521140A (en) | 2012-06-27 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| US10446174B2 (en) | File system for shingled magnetic recording (SMR) | |
| US9135033B1 (en) | Virtual machine storage | |
| US20160378530A1 (en) | Remote-direct-memory-access-based virtual machine live migration | |
| CN102567215B (en) | Space distribution method and system for simplified supply | |
| CN102141931B (en) | Virtual machine establishing method, virtual machine monitor and virtual machine system | |
| US9836516B2 (en) | Parallel scanners for log based replication | |
| US9940331B1 (en) | Proactive scavenging of file system snaps | |
| CN108064377A (en) | A kind of management method and device of multisystem shared drive | |
| CN102831069A (en) | Memory processing method and memory management equipment | |
| US20160062757A1 (en) | Virtual appliance deployment | |
| CN107343023A (en) | Resource allocation methods, device and electronic equipment in a kind of Mesos management cluster | |
| CN104317734A (en) | Memory allocation method and device applicable to SLAB | |
| KR101765725B1 (en) | System and Method for connecting dynamic device on mass broadcasting Big Data Parallel Distributed Processing | |
| CN110162396A (en) | Method for recovering internal storage, device, system and storage medium | |
| CN104216781A (en) | Video memory allocating method and system | |
| CN102521140B (en) | Method and device for acquiring descriptor group of activities | |
| CN113407298A (en) | Method, device and equipment for realizing message signal interruption | |
| JP2013171542A (en) | Performance analysis device, method for analyzing performance, and performance analysis program | |
| CN102096594B (en) | Method and device for using system resources in memory | |
| CN109308310B (en) | Subsystem data interconnection processing method for asset management platform | |
| CN107589995B (en) | Pre-broadcast preview task scheduling method for data service | |
| US20150081968A1 (en) | Decommissioning virtual appliances | |
| CN101751283A (en) | Virtual machine monitor, virtual machine system and client operation system state acquiring method | |
| CN113076180B (en) | Method for constructing uplink data path and data processing system | |
| CN107977265A (en) | Internal memory initialization method, apparatus and memory allocation method, device |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| C06 | Publication | ||
| PB01 | Publication | ||
| C10 | Entry into substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| C14 | Grant of patent or utility model | ||
| GR01 | Patent grant |