CN104063327A - Storage method applied to wireless communication and reading and writing storage device - Google Patents
Storage method applied to wireless communication and reading and writing storage device Download PDFInfo
- Publication number
- CN104063327A CN104063327A CN201310092388.8A CN201310092388A CN104063327A CN 104063327 A CN104063327 A CN 104063327A CN 201310092388 A CN201310092388 A CN 201310092388A CN 104063327 A CN104063327 A CN 104063327A
- Authority
- CN
- China
- Prior art keywords
- pointer
- space
- odd
- storage
- even number
- 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
- G06F12/00—Accessing, addressing or allocating within memory systems or architectures
- G06F12/02—Addressing or allocation; Relocation
- G06F12/0223—User address space allocation, e.g. contiguous or non contiguous base addressing
- G06F12/023—Free address space management
Abstract
The invention discloses a storage method applied to wireless communication and a reading and writing storage device. The method comprises the steps as follows: according to data business types, corresponding pointer migration is selected for adjusting a storage structure, storage space is self-adaptively allocated, a corresponding pointer is read under the condition of write operation, whether the storage space is in a non-space upward merging state is judged according to the state indication, if yes, the corresponding storage space is found out according to the read pointer, data write operation is executed, and otherwise, odd/even judgment of the pointer is performed. According to the invention, the comprehensive performance and the utilization ratio of the storage space are improved.
Description
Technical field
The present invention relates to memory technology, relate in particular to a kind of storage means and read-write memory storage that is applied to wireless telecommunications.
Background technology
In the communications field, usually have that multiple FPDP will send, reception & disposal packet, relate to the mutual of multiple operate source and memory storage.Common processing mode is the read-write operation these operate source, is subdivided into multiple read-write queues and memory storage and carries out alternately.
In storage, how data space distributes the performance that relates to whole memory storage, the many factors such as cost.Common existing storage allocation plan has several as follows:
One: fixed allocation method.To each queue fixed allocation a slice storage space.Each queue exclusively enjoys distributed storage space, and not mutual with the storage space of other queue, system control is simple, but storage space utilization factor is low.Due to the uncertainty of communication, likely certain queue only has low volume data, storage space is idle in a large number, another one queue has a large amount of data, insufficient memory is suitable for, but owing to adopting fixing allocation scheme, the storage space between queue can not be mutual, therefore storage space carrying is uneven, causes storage space utilization factor lower.
Two: directly share storage method.All queue sharing a slices, large storage space, all queues have access limit to this sheet space.Due to each queue, be different the time of arrival of queue, the time of reading of each queue is also uncertain, therefore after a period of time, whole storage space free space is discontinuous, be not easy to find one section of continuous sufficiently long storage space to new queue assignment task, cause storage space utilization factor also not high.
Three: chained list is shared storage means.For the above second way, be not easy to find the continuous sufficiently long space of a slice, adopt chained list mode.Adopt chained list mode, discontinuous free space can be linked and offers large packet and use.Use chained list mode, after data processing after a while, it is enough little that idle storage space fragment will become, but the length of chained list will become long enough, and this will cause memory storage performance sharply to decline, and storage space utilization factor also can decline to a great extent.
Four: fixing elementary cell sharing approach.In the communal space, open up basic unit of storage by the length of maximum bag, each packet takies a basic unit of storage.This kind of method performance is high, but space availability ratio is also low.
In sum, adopt existing memory technology, for multi-source technology of sharing, although each scheme Dou Geyou local superiority,, integrate obvious restriction, can not take into account the advantage of each side, the storage space utilization factor for example having is extremely low, and what have is beyond affordability in memory property.And all only adapt to the fixed service type of specifying, thereby once type of service sends variation, just may there is uncontrollable index decreased in combination property storage space utilization factor.
Prior art is to set in advance storage organization according to fixing data service type, cannot subsequent dynamic adjustment, and adopt the present invention, due to energy self-adaptation memory allocated space, therefore, contrast prior art, has improved the combination property of storage space and the utilization factor of storage space.
Summary of the invention
In view of this, fundamental purpose of the present invention is to provide a kind of storage means and read-write memory storage that is applied to wireless telecommunications, has improved the combination property of storage space and the utilization factor of storage space.
For achieving the above object, technical scheme of the present invention is achieved in that
A storage means that is applied to wireless telecommunications, the method comprises:
Select the migration of corresponding pointer to adjust storage organization according to the type of service of data, self-adaptation memory allocated space, in write operation situation, read corresponding pointer, according to state, instruction judges whether the state of storage space is upwards merging phase of non-space, if, find corresponding storage space executing data write operation according to the pointer reading, if not, carry out the judgement of pointer odd even.
Wherein, described in, carrying out the judgement of pointer odd even specifically comprises: if the pointer reading is odd number pointer, find corresponding storage space executing data write operation according to the odd number pointer reading; If the pointer reading is even number pointer, the even number pointer reading is sent to state of parity space it is upgraded, and status indicator corresponding to even number pointer is set to height.
Wherein, described state of parity is only stored even number pointer in space, and status indicator corresponding to described even number pointer is set to when high, indicates space that described even number pointer is corresponding for idle;
Each even number pointer and the odd number pointer corresponding with it form an odd even pair.
A kind of storage means that is applied to wireless telecommunications, the method comprises: select the migration of corresponding pointer to adjust storage organization according to the type of service of data, self-adaptation memory allocated space, in read operation situation, read corresponding pointer and find corresponding storage space executing data read operation, after reading, the corresponding space of the pointer reading is discharged, if instruction judges that the state of storage space is upwards merging phase of space according to state, carry out the judgement of pointer odd even.
Wherein, described in, carrying out the judgement of pointer odd even specifically comprises: if the pointer reading is even number pointer, it is not processed; If the pointer reading is odd number pointer, whether there is at state of parity space querying the even number pointer mating with described odd number pointer, if exist even number pointer and the status indicator corresponding to even number pointer of coupling to be set to height, carry out the merging of odd even pointer.
Wherein, described state of parity is only stored even number pointer in space, and status indicator corresponding to described even number pointer is set to when high, indicates space that described even number pointer is corresponding for idle;
Each even number pointer and the odd number pointer corresponding with it form an odd even pair.
Wherein, the method also comprises: if release is strange space corresponding to described odd even centering odd number pointer, the even space that described odd even centering even number pointer is corresponding jointly discharges together with described strange space, and two storage spaces are upwards merged into a storage space that address is continuous simultaneously.
Wherein, carry out after the merging of odd even pointer, the size in the corresponding odd even of the new pointer space after odd even pointer merges is: the former strange space former even space sum corresponding with even number pointer that odd even centering odd number pointer is corresponding.
Wherein, the method also comprises: if instruction judges that the state of storage space is the downward decomposing state in space according to state, the pointer reading is decomposed into odd number pointer and the even number pointer corresponding with it, decompose downwards implementation space;
Accordingly, the size in the former space that the pointer that reads is corresponding is divided into two parts, and the even space corresponding with even number pointer, strange space that odd number pointer is corresponding respectively accounts for the half of former space size.
A kind of read-write memory storage, this device comprises: Master Control Unit, multichannel selected cell, odd even decision unit; Wherein,
Master Control Unit, selects the migration of corresponding pointer to adjust the storage organization of storage space for controlling multichannel selected cell according to the type of service of data, self-adaptation memory allocated space;
Multichannel selected cell, is when having the packet that storage organization adapts for type of service, the original free pointer queue of corresponding selection; Type of service is that while exceeding the large packet of existing storage organization, corresponding selection merges free pointer queue; Type of service is during lower than the small data packets of existing storage organization, and after pointer decomposes, corresponding selection is decomposed free pointer queue;
Odd even decision unit, in the duty of the storage space of described Master Control Unit control being space upwards when merging phase, carries out the judgement of pointer odd even.
Wherein, the duty of described storage space specifically comprises: normal condition, the downward decomposing state in space or upwards merging phase of space.
Wherein, this device also comprises: address decoding unit is space upwards when merging phase for described duty, and whether the indicated address of pointer that judgement is read belongs to the region that space merges, while belonging to the region of space merging, the pointer reading is mail to described odd even decision unit.
Wherein, described odd even decision unit, is further used in write operation situation, and the pointer obtaining from described address decoding unit is carried out to odd even while judging, the pointer reading is odd number pointer, finds corresponding storage space executing data write operation according to the odd number pointer reading; If the pointer reading is even number pointer, the even number pointer reading is sent to state of parity space it is upgraded, and status indicator corresponding to even number pointer is set to height.
Wherein, described odd even decision unit, is further used in read operation situation, and the pointer reading is even number pointer, and it is not processed; The pointer reading is odd number pointer, whether there is at state of parity space querying the even number pointer mating with described odd number pointer, if exist even number pointer and the status indicator corresponding to even number pointer of coupling to be set to height, notice merging pointer unit carries out the merging of odd even pointer.
Wherein, described state of parity is only stored even number pointer in space, and status indicator corresponding to described even number pointer is set to when high, indicates space that described even number pointer is corresponding for idle; Each even number pointer and the odd number pointer corresponding with it form an odd even pair.
Wherein, this device also comprises: pointer resolving cell, while being the downward decomposing state in space for described duty, the pointer reading is decomposed into odd number pointer and the even number pointer corresponding with it, and decompose downwards implementation space.
The present invention selects the migration of corresponding pointer to adjust storage organization according to the type of service of data, self-adaptation memory allocated space, in write operation situation, read corresponding pointer, according to state, instruction judges whether the state of storage space is upwards merging phase of non-space, if, find corresponding storage space executing data write operation according to the pointer reading, if not, carry out the judgement of pointer odd even.
Brief description of the drawings
Fig. 1 is the realization flow figure of the inventive method embodiment in write operation situation;
Fig. 2 is the realization flow figure of the inventive method embodiment in read operation situation;
Fig. 3 is the composition structural representation of apparatus of the present invention embodiment.
Embodiment
Basic thought of the present invention is: select the migration of corresponding pointer to adjust storage organization according to the type of service of data, self-adaptation memory allocated space, in write operation situation, read corresponding pointer, according to state, instruction judges whether the state of storage space is upwards merging phase of non-space, if, find corresponding storage space executing data write operation according to the pointer reading, if not, carry out the judgement of pointer odd even.
The present invention is the storage scheme that is applied to wireless telecommunications multi-data source read-write operation, relates generally to pointer Classification Management, and pointer is divided three classes altogether, merges pointer, and original pointer decomposes pointer.Each space, after reading, need to discharge corresponding space, and pointer corresponding space is delivered to pointer management center.By the migration of three class pointers, realize the dynamic adjustment of storage space, in the time that a large amount of pointers moves toward merging pointer area, need to carry out pointer union operation, it is large that storage space elementary cell becomes, and it is many that big unit becomes, and is adapted to large packet storage; When a large amount of pointers are toward decomposing pointer area migration, need to carry out pointer operation splitting, storage space elementary cell diminishes, and it is many that junior unit becomes, and adapts to small data packets storage; Do not need additionally pointer to be processed toward original pointer migration when pointer is a large amount of, current storage organization adapts to current data pack arrangement, and data storage does not need to change.
Below in conjunction with accompanying drawing, the enforcement of technical scheme is described in further detail.
The technical scheme of the inventive method is as follows, mainly divides reading and writing two aspects:
One,, in write operation situation, the embodiment of the method for storage means of the present invention as shown in Figure 1, comprises following content:
The first step: obtain write request from write queue, initiate the write request application to storage space.
Second step: long according to the bag of application, select a kind of storage unit adapting to most to current data packet.
Here, what this step carried out that the selection of storage unit adopts is relative method, selects the long two immediate class storage unit of the attendant of a stage actor, and rounds downwards.Such as there being four class storage unit, size difference, 64,128,256,512.Current Bao Changwei 384, immediate storage unit is 256 and 512, then rounds downwards, finally selects 256 storage unit, carries out storage operation for the first time.
The 3rd step: if the storage unit of distributing does not have free space, return to second step, redistribute storage unit.
The 4th step: the free pointer queue that storage unit access is corresponding, read corresponding pointer.Here, described free pointer queue comprises: decompose idle address pointer alignment, merge idle address pointer alignment and original idle address pointer alignment.
The 5th step: according to state instruction, judge whether current state is upwards merging phase (basic unit of storage of current maximum expands) of space.
Here, according to bag, long distribution judges the upwards merging phase of this step, if most of (configurable) maximum bag is larger than maximum storage unit, carries out upwards union operation of maximum storage unit; Or the parcel of major part is larger than minimum memory unit, carries out minimum memory unit and upwards merges.
The 6th step: upwards merging phase of non-space if, finds corresponding storage space according to pointer.
The 7th step: upwards merging phase of space if, judge pointer odd even, if pointer is odd number, according to pointer, find corresponding storage space.If pointer is even number, upgrade state of parity space, abandon this pointer.
Here, the state of parity space of this step, expression be that the storage unit classification that upwards merges is the full state of sky in the corresponding space of all even pointers.If when reading this type of storage unit, the pointer obtaining is even number,, in odd even space, is idle condition Space notation corresponding this pointer.When carrying out when read operation, if discharge be the strange space of this odd even centering time, can jointly discharge together with even space, the space jointly discharging is upwards merged together simultaneously.
The 8th step: carry out data storage in corresponding stored space, upgrade bag long.
The 9th step: to the bag progress row judgement of upgrading, if zero, finish write operation, otherwise jump to second step, carry out the storage of remaining data bag.
Two,, in read operation situation, the embodiment of the method for storage means of the present invention as shown in Figure 2, comprises following content:
The first step: from reading queue, obtain read pointer, initiate the read request to storage space.
Second step: according to read pointer, search out corresponding storage space and chained list, carry out data and read.After reading out data, carry out the release management in the corresponding space of read pointer.
The 3rd step: according to state instruction, judge whether current state is upwards merging phase of space, if so, and current pointer is strange pointer, and in state of parity space, the corresponding corresponding space of even pointer is idle, carries out the merging of odd even pointer.The corresponding odd even of new pointer space, size is original twice, has realized space and has upwards merged.
The 4th step: according to address corresponding to pointer and master control state, select corresponding free pointer queue.Here, described free pointer queue comprises: decompose idle address pointer alignment, merge idle address pointer alignment and original idle address pointer alignment.
The 5th step: if the current pointer queue of selecting is to process spatial decomposition region, carries out pointer and decompose, a pointer is resolved into odd even pointer, the half that the space that each pointer is corresponding is original space, completes space and decompose downwards.
The 6th: carry out pointer storage, and the chained list information of obtaining according to second step, judge whether it is chain end of list (EOL), if YES, finish, if NO, also do not finish, jump to second step and carry out.
Here, above-mentioned the 5th each pointer alignment of step has the Address space mappinD of oneself separately.
It is 1-1000 that overall space is for example set.Just only had at first a pointer alignment, corresponding 10 address spaces of each pointer are set, all pointers all store this pointer alignment into.
Upwards merge if 500-1000 carries out space, entirety will become 2 pointer alignments so.The pointer of the corresponding pointer 1-500 of first queue, the corresponding space 10 of each pointer.The pointer of second corresponding 501-1000 of pointer alignment, each pointer is to a space 20.
Then decompose downwards in 1-255 execution space, and entirety will become 3 pointer alignments so.The corresponding 1-255's of first pointer alignment, not having the corresponding space of individual pointer is 5.The second pointer alignment is 256-500, and the corresponding space of each pointer is 10.The 3rd pointer alignment position 501-1000, the corresponding space of each pointer is 20.
Corresponding to above-mentioned read/write operation, the composition structural representation that the present invention reads and writes memory storage embodiment as shown in Figure 3, comprising:
Storage space 101: for the principal space of storage data, can use double data rate DDR storer, also can use the various memory devices such as on-chip SRAM, wherein, described SRAM is the internal memory with static access facility.
Master Control Unit 102: for storing the Master Control Unit of controlling, be used for carrying out the integrated scheduling control of storage space.As be used for duty---the normal condition in control store space, space is merging phase (record merges the bulk of front and back basic unit of storage simultaneously) upwards, the downward decomposing state in space (record space is decomposed the bulk of front and back basic unit of storage simultaneously), indicate according to state, for in the time that pointer discharges, the control that pointer merges and decomposes; Multi channel selecting control; Memory allocation is selected; Record the address space range of each pointer alignment, the space pointer discharging is stored in corresponding queue and gone.Here, every storage area of storage space has a corresponding pointer alignment, but the address realm of this panel region is along with the carrying out that space upwards merges downward decomposition is also constantly to change, therefore need Master Control Unit to record the address realm of current each pointer alignment, with facilitate space discharge time, the operation of joining the team of pointer.
Read-write queue 103: the read-write requests queue of storage peripheral operation source to storage space.
Write control module 104: be the control module of writing of storage space, for to storage space 101 data writings.
Decompose idle address pointer alignment 105, merge idle address pointer alignment 107, original idle address pointer alignment 108, is respectively pointer alignment corresponding to all kinds of idle storage space, and wherein the number of queue is dynamically to adjust, and can increase also and can reduce.Here it is to be noted: adopt while decomposing idle address pointer alignment 105, the duty in corresponding stored space is that decompose downwards in space, carry out pointer operation splitting, this operates applicable type of service is small data packets storage; Adopt while merging idle address pointer alignment 107, the duty in corresponding stored space is that space upwards merges, and carries out pointer union operation, and this operates applicable type of service is large packet storage; While adopting original idle address pointer alignment 108, the duty in corresponding stored space is normal, carries out original pointer operation, and this operates applicable type of service is the current data packet adapting to without dynamically adjusting, with current storage organization.
Pointer resolving cell 106: for need are carried out pointer operation splitting, in the time carrying out space decomposition downwards, by pointer corresponding former storage space resolve into very, even two pointers, the respectively storage space of the first half of corresponding former storage space and latter half of storage space.
Address decoding unit 109: for need are carried out pointer union operation,, in the time that execution space upwards merges, former pointer alignment comprises in merging the pointer of address area and the pointer of unconsolidated address area.If the pointer reading current belongs to and merges address area, the current pointer reading is sent to odd even decision unit 110 and carries out follow-up space and upwards merge processing, otherwise be directly sent to address computation when writing control module 104 for write operation.Wherein, adopt the benefit of odd even decision unit to be: by increasing in storage space, first discharge in the time carrying out read operation because storage causes the basic unit of storage that becomes more and more less in storage space, judge that by odd even will discharge the continuous qualified pointer address in rear address merges again, guarantee that the adjacent elementary cell address, space that storage space pointer points to just allows to merge continuously.
Odd even decision unit 110: the pointer of delivering to odd even decision unit all wants participating space upwards to merge.Because system is after operation after a while, due to the discontinuous randomness respectively of the free space address in former storage space, therefore in the time of write operation, to complete space and upwards merge that to write be very difficult, therefore further consider when space reads to discharge and realize upwards and merging.If strange pointer, pointer is sent to and writes control module 104 and carry out normal write operation, if even pointer is sent to pointer state of parity space 111, state of a control space is upgraded.
State of parity space 111: the idle condition of the even pointer that is used for recording corresponding queue.If odd even decision unit 110 is carried the even pointer of coming, the status indicator that this pointer is corresponding will be set to height, represent that the space that this pointer is corresponding is the free time.When wherein state space is initialized, be low entirely.Wherein only have large Storage Unit Pointer queue, and have corresponding odd states space between minimum memory unit pointer queue empty.Therefore, no matter storage space is through after decomposing and merging, produce how many pointer alignments, finally have at most two state of parity spaces, and each pointer state only have a bit, total expense little, can build with register.
Multichannel selected cell 112: according to the control of Master Control Unit, the pointer discharging is sent in corresponding queue and is gone.
Merge pointer unit 113: if pointer corresponding to the space of current release upwards merges corresponding address realm in space, and current pointer is strange pointer, carry out pointer union operation, read the even pointer state of state of parity space 111 correspondences, if even pointer state is high, pointer merges successfully, and the pointer after merging is sent to and merges idle address pointer alignment 107; If even pointer state is low, pointer merges unsuccessfully, and current pointer is transported to original idle address pointer alignment 108.
Read control module 114: be the control module of writing of storage space, for to storage space 101 sense datas.
Here it is to be noted: above-mentioned storage space 101, read-write queue 103, writes control module 104, reads control module 114, is the normal equipment adopting in prior art, and miscellaneous equipment is to realize the equipment that the present invention sets up.
Adopt the present invention, overcome in prior art fixed partition space availability ratio low, it is many that chained list connects fragment, the feature that performance is low, it is a kind of adaptive memory allocation scheme, can, according to the situation of practical business type, automatically adjust storage organization, greatly improve space availability ratio and memory property.And layering is adjusted, guarantee not disperse because adjustment causes complexity.Here, described adjustment refers to: 1): only for minimum and maximum storage unit, in order to store, granularity upwards merges and decomposition downwards, do not consider the storage granularity adjustment that minimum and maximum storage unit is middle, that is to say, do not need all storage granularities all freely to change, thereby for all storage granularities all freely change, reduced complexity, and the effect finally reaching all freely changes with all storage granularities the same; 2): merge when decomposition, adopt with 2 (strange, even) storage granularity and merge and decompose, but be not limited to this mode, also can consider with 3,4 the situation that the storage granularity of 5 other values such as grade merges and decomposes.The present invention selects with 2 (strange, occasionally) storage granularity merges and decomposes, it is a kind of best implementation, with respect to 3, 4, the situation that the storage granularity of 5 other values such as grade merges and decomposes, although the speed of adjusting is from the teeth outwards a lot of rapidly, but in fact complexity index rises, and system is after the operation of certain hour, after idle storage unit stochastic distribution, other granularities merge the efficiency of decomposing and sharply reduce, final merge that the efficiency of decomposing and storage effect all be not so good as that the present invention selects with 2 (very, the mode that occasionally) granularity merges and decomposes.
The inventive method, at the application example of carrying out in write operation situation, comprises the following steps:
Step 201: send and write application, and application is write in registration in read-write queue.
Step 202: write control module and read the application of reading and writing queue, obtain the header packet information of packet, read spatial division information by Master Control Unit simultaneously, the kind of free pointer queue and number, and the size of basic unit of storage in every class pointer alignment, according to the long basic unit of storage of selecting in storage space that calculates of bag.
Step 203: select and the long more close pointer alignment of bag, and judge that whether storage space is idle, if idle, application is used the pointer of this pointer alignment, if this pointer alignment is not idle, upgrades and adopt other pointer alignment, then judge whether the free time, if all pointer alignments are not idle, write operation suspends.
Step 204: obtain idle pointer at most from the pointer alignment of original idle address, normal condition if current, or the downward decomposing state in space, this pointer is sent to and writes control module, writing control module according to pointer calculating memory addresses, executing data write operation.Then packet header length is deducted to the size of the storage space of current pointer instruction, if result is positive number, upgrade so packet header length, jump to the 203rd step, until the packet header length of upgrading is non-positive number.
Step 205: be that space is upwards when merging phase if current, the pointer obtaining from original idle address pointer alignment first carries out address decoding through address decoding unit, judge whether the indicated address of current pointer belongs to the region that space merges, if do not belonged to, perform step 204 normal running, otherwise be transported to odd even decision unit and carry out odd even judgement, pointer is strange, be sent to and write control module and carry out normal write operation, it is even number, be sent to state of parity space, upgrade the state in the corresponding space of current pointer, status indicator is idle.
Step 206, after a packet storage, can be at read-write queue 103 these packet first address pointers of registration, for the follow-up index of reading.
Step 207, after packet storage, through after a period of time, outside is sent to read-write queue and sends and read application, read-write queue between the packet first address of storage be input to and read control module and carry out subsequent treatment.
The inventive method, at the application example of carrying out in read operation situation, comprises the following steps:
Step 301: read control module directly by pointer, the data space of computational data bag storage, reads corresponding header data and chained list information thereof.
Step 302: after step 301 read operation, storage space corresponding to former storage bag data need to be discharged, register in free pointer queue, later follow-up other packet uses.
Step 303: through after a period of time, data are surrounded by the demand of reading.Peripheral operation source, submits a report asking for and asks to read-write queue registration read data.Read-write queue pointer that step 302 is stored spues, and is sent to read control module and assist to carry out read operation.
Step 304: read control module according to the pointer obtaining, the address of computational data storage, and carry out the operation of reading out data and linked list head.After all data all read, the pointer of current use is sent to merging pointer unit and carries out subsequent operation.
Step 305: the linked list head information that analyzing step 304 is obtained, judge whether packet reads complete, as do not read completely according to linked list head, mention new pointer information, repeating step 304.
Step 306: merge the reception of pointer unit and read the pointer for the treatment of Free up Memory that control module is brought, and judge whether current pointer belongs to space and upwards merge scope, do not belong to pointer and do not process direct output.Belong to merging scope, according to the size in current pointer corresponding stored space, judge that current pointer is to merge prior pointer, still merge backpointer, merge directly output of backpointer.Pointer before merging judges that pointer is strange pointer or even pointer, and even pointer is not processed direct output, and strange pointer reads state of parity space, checks the even pointer state of coupling, if the even pointer of coupling is the free time, merges pointer success, otherwise unsuccessful.
Step 307: receive merging pointer unit and carry the free pointer of coming, according to Master Control Unit, pointer is delivered to corresponding pointer alignment.Wherein each pointer alignment has each self-corresponding address realm, and except merging failed pointer, all pointers store pointer alignment separately into by address realm.Merge failed pointer and store original pointer queue into, merge successful pointer and store merging pointer alignment into.
Step 308: carry toward the pointer that decomposes pointer alignment, according to the size in current pointer corresponding stored space, judge that current pointer is to decompose prior pointer, still decomposes backpointer.Pointer after decomposition directly deposits pointer alignment in, and the pointer before decomposition resolves into two pointers of odd even through pointer resolving cell, then stores in pointer alignment and go.
The invention belongs to stored digital field, be adapted to various electronic storage devices, be particularly useful for the data storage processing in the communications field.
In sum, adopt the present invention, there is following beneficial effect:
1, there is adaptation function, can, according to the type of service of data, adjust the use of storage space.Being divided into for type of service is large packet, small data packets and dynamic adjustment in three kinds of situations of current data packet consistent with memory allocated structure.
2, the utilization factor of storage space is high, owing to dynamically adjusting, therefore the storage space secret sharing of relatively existing fixing elementary cell, if maximum is wrapped parcel and is differed several magnitudes in data stream, adopt so the present invention, the relatively existing scheme of space availability ratio just has the lifting of several magnitudes, and performance remains unchanged substantially simultaneously.
3, the comprehensive memory property of storage space is high, shares method with respect to existing chained list, and along with the lengthening in processing time, performance boost ratio is higher, and final performance can promote tens times, keeps space availability ratio also slightly high than existing scheme simultaneously.
4, low in energy consumption: to adopt the present invention, in carrying out storage organization adjustment, do not relate to data-moving, do not relate to pointer and move, there is no operation bidirectional, do not affect normal data storage, substantially additionally do not increase power consumption expense.
The above, be only preferred embodiment of the present invention, is not intended to limit protection scope of the present invention.
Claims (16)
1. a storage means that is applied to wireless telecommunications, is characterized in that, the method comprises:
Select the migration of corresponding pointer to adjust storage organization according to the type of service of data, self-adaptation memory allocated space, in write operation situation, read corresponding pointer, according to state, instruction judges whether the state of storage space is upwards merging phase of non-space, if, find corresponding storage space executing data write operation according to the pointer reading, if not, carry out the judgement of pointer odd even.
2. method according to claim 1, is characterized in that, described in carry out the judgement of pointer odd even and specifically comprise: if the pointer reading is odd number pointer, find corresponding storage space executing data write operation according to the odd number pointer reading; If the pointer reading is even number pointer, the even number pointer reading is sent to state of parity space it is upgraded, and status indicator corresponding to even number pointer is set to height.
3. method according to claim 2, is characterized in that, described state of parity is only stored even number pointer in space, and status indicator corresponding to described even number pointer is set to when high, indicates space that described even number pointer is corresponding for idle;
Each even number pointer and the odd number pointer corresponding with it form an odd even pair.
4. one kind is applied to the storage means of wireless telecommunications, it is characterized in that, the method comprises: select the migration of corresponding pointer to adjust storage organization according to the type of service of data, self-adaptation memory allocated space, in read operation situation, read corresponding pointer and find corresponding storage space executing data read operation, after reading, the corresponding space of the pointer reading is discharged, if instruction judges that the state of storage space is upwards merging phase of space according to state, carry out the judgement of pointer odd even.
5. method according to claim 4, is characterized in that, described in carry out the judgement of pointer odd even and specifically comprise: if the pointer reading is even number pointer, it is not processed; If the pointer reading is odd number pointer, whether there is at state of parity space querying the even number pointer mating with described odd number pointer, if exist even number pointer and the status indicator corresponding to even number pointer of coupling to be set to height, carry out the merging of odd even pointer.
6. method according to claim 5, is characterized in that, described state of parity is only stored even number pointer in space, and status indicator corresponding to described even number pointer is set to when high, indicates space that described even number pointer is corresponding for idle;
Each even number pointer and the odd number pointer corresponding with it form an odd even pair.
7. method according to claim 6, it is characterized in that, the method also comprises: if release is strange space corresponding to described odd even centering odd number pointer, the even space that described odd even centering even number pointer is corresponding jointly discharges together with described strange space, and two storage spaces are upwards merged into a storage space that address is continuous simultaneously.
8. method according to claim 6, it is characterized in that, carry out after the merging of odd even pointer, the size in the corresponding odd even of the new pointer space after odd even pointer merges is: the former strange space former even space sum corresponding with even number pointer that odd even centering odd number pointer is corresponding.
9. method according to claim 4, it is characterized in that, the method also comprises: if instruction judges that the state of storage space is the downward decomposing state in space according to state, the pointer reading is decomposed into odd number pointer and the even number pointer corresponding with it, decompose downwards implementation space;
Accordingly, the size in the former space that the pointer that reads is corresponding is divided into two parts, and the even space corresponding with even number pointer, strange space that odd number pointer is corresponding respectively accounts for the half of former space size.
10. a read-write memory storage, is characterized in that, this device comprises: Master Control Unit, multichannel selected cell, odd even decision unit; Wherein,
Master Control Unit, selects the migration of corresponding pointer to adjust the storage organization of storage space for controlling multichannel selected cell according to the type of service of data, self-adaptation memory allocated space;
Multichannel selected cell, is when having the packet that storage organization adapts for type of service, the original free pointer queue of corresponding selection; Type of service is that while exceeding the large packet of existing storage organization, corresponding selection merges free pointer queue; Type of service is during lower than the small data packets of existing storage organization, and after pointer decomposes, corresponding selection is decomposed free pointer queue;
Odd even decision unit, in the duty of the storage space of described Master Control Unit control being space upwards when merging phase, carries out the judgement of pointer odd even.
11. devices according to claim 10, is characterized in that, the duty of described storage space specifically comprises: normal condition, the downward decomposing state in space or upwards merging phase of space.
12. devices according to claim 10, it is characterized in that, this device also comprises: address decoding unit, be that space is upwards when merging phase for described duty, whether the indicated address of pointer that judgement is read belongs to the region that space merges, while belonging to the region of space merging, the pointer reading is mail to described odd even decision unit.
13. devices according to claim 12, it is characterized in that, described odd even decision unit, be further used in write operation situation, the pointer obtaining from described address decoding unit is carried out to odd even while judging, the pointer reading is odd number pointer, finds corresponding storage space executing data write operation according to the odd number pointer reading; If the pointer reading is even number pointer, the even number pointer reading is sent to state of parity space it is upgraded, and status indicator corresponding to even number pointer is set to height.
14. devices according to claim 12, is characterized in that, described odd even decision unit is further used in read operation situation, and the pointer reading is even number pointer, and it is not processed; The pointer reading is odd number pointer, whether there is at state of parity space querying the even number pointer mating with described odd number pointer, if exist even number pointer and the status indicator corresponding to even number pointer of coupling to be set to height, notice merging pointer unit carries out the merging of odd even pointer.
15. according to the device described in claim 13 or 14, it is characterized in that, described state of parity is only stored even number pointer in space, and status indicator corresponding to described even number pointer is set to when high, indicates space that described even number pointer is corresponding for idle; Each even number pointer and the odd number pointer corresponding with it form an odd even pair.
16. according to the device described in claim 13 or 14, it is characterized in that, this device also comprises: pointer resolving cell, while being the downward decomposing state in space for described duty, the pointer reading is decomposed into odd number pointer and the even number pointer corresponding with it, and decompose downwards implementation space.
Priority Applications (2)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201310092388.8A CN104063327B (en) | 2013-03-21 | 2013-03-21 | A kind of storage method and read-write storage device applied to wireless telecommunications |
| PCT/CN2013/081020 WO2013189324A2 (en) | 2013-03-21 | 2013-08-07 | Storage method and read-write storage device which are applied to wireless communications |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201310092388.8A CN104063327B (en) | 2013-03-21 | 2013-03-21 | A kind of storage method and read-write storage device applied to wireless telecommunications |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN104063327A true CN104063327A (en) | 2014-09-24 |
| CN104063327B CN104063327B (en) | 2017-09-12 |
Family
ID=49769494
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201310092388.8A Active CN104063327B (en) | 2013-03-21 | 2013-03-21 | A kind of storage method and read-write storage device applied to wireless telecommunications |
Country Status (2)
| Country | Link |
|---|---|
| CN (1) | CN104063327B (en) |
| WO (1) | WO2013189324A2 (en) |
Cited By (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN107391388A (en) * | 2016-05-17 | 2017-11-24 | 阿里巴巴集团控股有限公司 | A kind of method and apparatus that data storage is carried out based on instant messaging |
Citations (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN1677946A (en) * | 2004-04-02 | 2005-10-05 | 华为技术有限公司 | Buffer distribution method and apparatus |
| CN101175228A (en) * | 2006-11-03 | 2008-05-07 | 中兴通讯股份有限公司 | Implementing method for supporting variable length data structure in intelligent network |
| CN101221536A (en) * | 2008-01-25 | 2008-07-16 | 中兴通讯股份有限公司 | Internal memory managing method and device of embedded system |
-
2013
- 2013-03-21 CN CN201310092388.8A patent/CN104063327B/en active Active
- 2013-08-07 WO PCT/CN2013/081020 patent/WO2013189324A2/en active Application Filing
Patent Citations (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN1677946A (en) * | 2004-04-02 | 2005-10-05 | 华为技术有限公司 | Buffer distribution method and apparatus |
| CN101175228A (en) * | 2006-11-03 | 2008-05-07 | 中兴通讯股份有限公司 | Implementing method for supporting variable length data structure in intelligent network |
| CN101221536A (en) * | 2008-01-25 | 2008-07-16 | 中兴通讯股份有限公司 | Internal memory managing method and device of embedded system |
Cited By (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN107391388A (en) * | 2016-05-17 | 2017-11-24 | 阿里巴巴集团控股有限公司 | A kind of method and apparatus that data storage is carried out based on instant messaging |
Also Published As
| Publication number | Publication date |
|---|---|
| CN104063327B (en) | 2017-09-12 |
| WO2013189324A2 (en) | 2013-12-27 |
| WO2013189324A3 (en) | 2014-02-20 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN102243598B (en) | Method for scheduling task in Distributed Data Warehouse and system | |
| CN103034617A (en) | Caching structure for realizing storage of configuration information of reconfigurable system and management method | |
| CN104102693A (en) | Object processing method and device | |
| CN101373445B (en) | Method and apparatus for scheduling memory | |
| CN110058940B (en) | Data processing method and device in multi-thread environment | |
| CN108369562A (en) | Intelligently encoding memory architecture with enhanced access scheduling device | |
| CN107122244A (en) | A kind of diagram data processing system and method based on many GPU | |
| CN105892955A (en) | Method and equipment for managing storage system | |
| CN106598495A (en) | Mixed storage service quality control method and control apparatus | |
| CN107729137A (en) | Server, the method and storage medium of the decryption of block chain sign test | |
| CN104615684A (en) | Mass data communication concurrent processing method and system | |
| CN102025753B (en) | Load balancing method and equipment for data resources of servers | |
| CN102779183B (en) | Data inquiry method, equipment and system | |
| CN102279729B (en) | Method, buffer and processor for dynamic reconfigurable array to schedule configuration information | |
| CN106776025A (en) | A kind of computer cluster job scheduling method and its device | |
| CN104572498A (en) | Cache management method for message and device | |
| CN104156505B (en) | A kind of Hadoop cluster job scheduling method and devices based on user behavior analysis | |
| CN103218254B (en) | A kind of AFC (Automatic Fare Collection) data processing method of many queues | |
| CN104050193A (en) | Message generating method and data processing system for realizing method | |
| US11429299B2 (en) | System and method for managing conversion of low-locality data into high-locality data | |
| CN102780620B (en) | A kind of network processes device and message processing method | |
| CN110297810A (en) | A kind of stream data processing method, device and electronic equipment | |
| CN106356088A (en) | Data processing method and device | |
| CN104063327A (en) | Storage method applied to wireless communication and reading and writing storage device | |
| CN104156316A (en) | Hadoop cluster batch processing method and system |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| C06 | Publication | ||
| PB01 | Publication | ||
| C10 | Entry into substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| GR01 | Patent grant | ||
| GR01 | Patent grant | ||
| TR01 | Transfer of patent right |
Effective date of registration: 20221116 Address after: 518055 Zhongxing Industrial Park, Liuxian Avenue, Xili street, Nanshan District, Shenzhen City, Guangdong Province Patentee after: SANECHIPS TECHNOLOGY Co.,Ltd. Address before: 518057 Ministry of justice, Zhongxing building, South Science and technology road, Nanshan District hi tech Industrial Park, Shenzhen, Guangdong Patentee before: ZTE Corp. |
|
| TR01 | Transfer of patent right |