CN104063327B - A kind of storage method and read-write storage device applied to wireless telecommunications - Google Patents
A kind of storage method and read-write storage device applied to wireless telecommunications Download PDFInfo
- Publication number
- CN104063327B CN104063327B CN201310092388.8A CN201310092388A CN104063327B CN 104063327 B CN104063327 B CN 104063327B CN 201310092388 A CN201310092388 A CN 201310092388A CN 104063327 B CN104063327 B CN 104063327B
- Authority
- CN
- China
- Prior art keywords
- pointer
- space
- odd
- even number
- state
- 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
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 kind of storage method applied to wireless telecommunications and read-write storage device, this method includes：The migration of correspondence pointer is selected to adjust storage organization according to the type of service of data, self-adjusted block memory space, correspondence pointer is read in the case of write operation, whether the state that memory space is judged according to state instruction is the upward merging phase of non-space, if, corresponding memory space is then found according to the pointer of reading and data write operation is performed, if it is not, then entering the judgement of line pointer odd even.Using the present invention, the combination property of memory space and the utilization rate of memory space are improved.
Description
Technical field
The present invention relates to memory technology, more particularly to a kind of storage method and read-write storage dress applied to wireless telecommunications
Put.
Background technology
In the communications field, usually there are multiple FPDPs to send, reception processing packet, be related to multiple operation sources with depositing
The interaction of storage device.Common processing mode is the read-write operation these operation sources, is subdivided into multiple read-write queues and storage
Device is interacted.
How data space distributes the performance for being related to whole storage device in storage, many factors such as cost.It is common
Existing storage allocation plan have following several：
One：Fixed allocation method.To each a piece of memory space of queue fixed allocation.Each queue exclusively enjoys distributed storage
Space, not the memory space with other queues interact, system control is simple, but memory space utilization rate is low.Due to communication
It is uncertain, it is possible to which that some queue only has low volume data, and memory space is largely idle, and another queue has substantial amounts of number
According to, insufficient memory is applicable, but is due to that, using the fixed method of salary distribution, the memory space between queue can not be interacted, because
The carrying of this memory space is uneven, causes memory space utilization rate relatively low.
Two：Directly share storage method.A piece of, the big memory space of all queue sharings, all queues are to this piece space
There is access limit.Due to each queue, the arrival time of queue is different, and the read access time of each queue is also not true
It is fixed, therefore after a period of time, whole memory space free space is discontinuous, it is not easy to find one section and continuous sufficiently long deposit
Space is stored up to new queue assignment task, causes memory space utilization rate also not high.
Three：Chained list shares storage method.For the above second way, it is not easy to find continuous sheet of sufficiently long sky
Between, using chained list mode.Using chained list mode, discontinuous free space can be chained up being supplied to big data bag to carry out
Use.Using chained list mode, after data processing after a while, idle storage space fragment will become sufficiently small, still
The length of chained list will become long enough, and this will cause storage device performance drastically to decline, memory space utilization rate also can significantly under
Drop.
Four：Fixed elementary cell sharing approach.In the communal space, basic unit of storage is opened up by the length of maximum bag, often
Individual packet takes a basic unit of storage.Such a method performance is high, but space availability ratio is also low.
In summary, using existing memory technology, for multi-source technology of sharing, although each scheme respectively has local excellent
Gesture, still, has integrated obvious limitation, it is impossible to take into account the advantage of each side, the memory space utilization rate pole for example having
It is low, and what is had is beyond affordability in storage performance.And the fixed service type specified all only is adapted to, once so that service class
Type sends change, and uncontrollable index decreased may occur for combination property memory space utilization rate.
The content of the invention
In view of this, it is a primary object of the present invention to provide a kind of storage method applied to wireless telecommunications and read-write to deposit
Storage device, improves the combination property of memory space and the utilization rate of memory space.
To reach above-mentioned purpose, the technical proposal of the invention is realized in this way：
A kind of storage method applied to wireless telecommunications, this method includes：
Select the migration of correspondence pointer according to the type of service of data to adjust storage organization, self-adjusted block storage is empty
Between, correspondence pointer is read in the case of write operation, whether the state that memory space is judged according to state instruction is that non-space is upward
Merging phase, if it is, corresponding memory space is found according to the pointer of reading and data write operation is performed, if it is not, then
Enter the judgement of line pointer odd even.
Wherein, it is described enter line pointer odd even judge specifically include：If the pointer read is odd number pointer, according to reading
Odd number pointer find corresponding memory space and perform data write operation；If the pointer read is even number pointer, it will read
The even number pointer taken is sent to state of parity space and it is updated, and the corresponding status indicator of even number pointer is set into height.
Wherein, even number pointer is only stored in the state of parity space, the corresponding status indicator of the even number pointer is set
For it is high when, it is the free time to indicate the corresponding space of the even number pointer；
Each even number pointer and corresponding odd number pointer constitute an odd even pair.
A kind of storage method applied to wireless telecommunications, this method includes：Correspondingly referred to according to the selection of the type of service of data
The migration of pin adjusts storage organization, and self-adjusted block memory space reads correspondence pointer in the case of read operation and find correspondence
Memory space and perform data reading operation, read and the pointer of reading correspondence space discharged after finishing, if according to shape
State indicates to judge the state of memory space for the upward merging phase in space, then enters line pointer odd even and judge.
Wherein, it is described enter line pointer odd even judge specifically include：If the pointer read is even number pointer, it is not done
Processing；If the pointer read is odd number pointer, it whether there is in state of parity space querying and matched with the odd number pointer
Even number pointer, even number pointer if there is the matching and corresponding status indicator of even number pointer is set to height then carries out odd even
Pointer merges.
Wherein, even number pointer is only stored in the state of parity space, the corresponding status indicator of the even number pointer is set
For it is high when, it is the free time to indicate the corresponding space of the even number pointer；
Each even number pointer and corresponding odd number pointer constitute an odd even pair.
Wherein, this method also includes：If release is the corresponding strange space of the odd even centering odd number pointer, described
The corresponding even space of odd even centering even number pointer is cooperatively discharged with the strange space, and two memory spaces are closed upwards simultaneously
And be a continuous memory space in address.
Wherein, carry out after odd even pointer merging, the size in the new pointer correspondence odd even space after the merging of odd even pointer is：Very
The strange space of the corresponding original of odd number pointer former even space sum corresponding with even number pointer in couple.
Wherein, this method also includes：If judging that the state of memory space decomposes downwards shape for space according to state instruction
State, then be decomposed into odd number pointer and corresponding even number pointer by a pointer of reading, realize that space is decomposed downwards；
Accordingly, the size in the corresponding former space of the pointer of reading is divided into two parts, the corresponding strange space of odd number pointer with
The corresponding even space of even number pointer respectively accounts for the half of former space size.
One kind read-write storage device, the device includes：Master Control Unit, multi-path choice unit, odd even decision unit；Wherein,
Master Control Unit, for controlling multi-path choice unit to be selected the migration of correspondence pointer to adjust according to the type of service of data
The storage organization of whole memory space, self-adjusted block memory space；
Multi-path choice unit, during for type of service for the packet adaptable with existing storage organization, corresponding selection is former
Beginning free pointer queue；When type of service is beyond the big data bag of existing storage organization, corresponding selection merges free pointer team
Row；When type of service is the small data packets less than existing storage organization, corresponding selection decomposes free pointer queue after pointer is decomposed；
Odd even decision unit, the working condition for the memory space controlled in the Master Control Unit merges upwards for space
During state, enter the judgement of line pointer odd even.
Wherein, the working condition of the memory space is specifically included：Normal condition, the downward decomposing state in space or space to
Upper merging phase.
Wherein, the device also includes：Address decoding unit, during merging phase upward for space for the working condition,
Judge whether the address indicated by the pointer read belongs to the region of space merging, when belonging to the region of space merging, will read
Pointer be sent to the odd even decision unit.
Wherein, the odd even decision unit, is further used in the case of write operation, to being obtained from the address decoding unit
When the pointer taken carries out odd even judgement, the pointer of reading is odd number pointer, and corresponding storage is found according to the odd number pointer of reading
Space simultaneously performs data write operation；If the pointer read is even number pointer, the even number pointer of reading is sent to state of parity empty
Between it is updated, and the corresponding status indicator of even number pointer is set to height.
Wherein, the odd even decision unit, is further used in the case of read operation, and the pointer of reading is even number pointer,
It is not processed；The pointer of reading is odd number pointer, then whether there is and the odd number pointer in state of parity space querying
The even number pointer of matching, even number pointer if there is the matching and corresponding status indicator of even number pointer is set to height is then notified
Merge Pointer unit and carry out odd even pointer merging.
Wherein, even number pointer is only stored in the state of parity space, the corresponding status indicator of the even number pointer is set
For it is high when, it is the free time to indicate the corresponding space of the even number pointer；Each even number pointer and corresponding odd number pointer are constituted
One odd even pair.
Wherein, the device also includes：Pointer resolving cell, during decomposing state downward for space for the working condition,
One pointer of reading is decomposed into odd number pointer and corresponding even number pointer, realizes that space is decomposed downwards.
The present invention selects the migration of correspondence pointer to adjust storage organization according to the type of service of data, and self-adjusted block is deposited
Space is stored up, correspondence pointer is read in the case of write operation, whether the state that memory space is judged according to state instruction is non-space
Upward merging phase, if it is, corresponding memory space is found according to the pointer of reading and data write operation is performed, if
It is no, then enter the judgement of line pointer odd even.
Prior art is to pre-set storage organization according to fixed data traffic types, it is impossible to which subsequent dynamic is adjusted, and
Using the present invention, due to energy self-adjusted block memory space, therefore, prior art is contrasted, the comprehensive of memory space is improved
The utilization rate of energy and memory space.
Brief description of the drawings
Fig. 1 is implementation process figure of the inventive method embodiment in the case of write operation；
Fig. 2 is implementation process figure of the inventive method embodiment in the case of read operation；
Fig. 3 is the composition structural representation of apparatus of the present invention embodiment.
Embodiment
The present invention basic thought be：The migration of correspondence pointer is selected according to the type of service of data to adjust storage knot
Structure, self-adjusted block memory space reads correspondence pointer in the case of write operation, the shape of memory space is judged according to state instruction
Whether state is the upward merging phase of non-space, if it is, finding corresponding memory space according to the pointer of reading and performing number
According to write operation, if it is not, then entering the judgement of line pointer odd even.
The present invention is the storage scheme applied to wireless telecommunications multi-data source read-write operation, relates generally to pointer classification pipe
Reason, pointer is divided into three classes altogether, merges pointer, and original pointer decomposes pointer.Each space is after reading is finished, it is necessary to right
The corresponding pointer in space, is delivered to pointer management center by the space release answered.By the migration of three class pointers, realize that storage is empty
Between dynamic adjustment, when substantial amounts of pointer toward when merging pointer area migration, it is necessary to enter line pointer union operation, memory space base
This unit becomes big, and big unit becomes many, is adapted to the storage of big data bag；When a large amount of pointers are migrated, it is necessary to enter toward pointer area is decomposed
Line pointer operation splitting, memory space elementary cell diminishes, and junior unit becomes many, adapts to small data packets storage；When pointer is largely past
Original pointer is migrated, it is not necessary to additionally pointer is handled, currently stored Structure adaptation current data pack arrangement, data storage
It need not change.
The implementation to technical scheme is described in further detail below in conjunction with the accompanying drawings.
The technical scheme of the inventive method is as follows, is mainly divided to reading and writing two aspects：
First, in the case of write operation, the embodiment of the method for storage method of the present invention is as shown in figure 1, including herein below：
The first step：Write request is obtained in write queue, the write request application to memory space is initiated.
Second step：It is long according to the bag of application, a kind of memory cell most adapted to is selected to current data packet.
Here, this step enters the selection of line storage unit and uses comparison method, two immediate classes of selection attendant of a stage actor's length
Memory cell, and round downwards.Than if any four class memory cell, size difference, 64,128,256,512.A length of 384 are currently wrapped,
Then immediate memory cell is 256 and 512, is then rounded downwards, finally selects 256 memory cell, deposit for the first time
Storage operation.
3rd step：If the memory cell of distribution does not have free space, second step is returned, memory cell is redistributed.
4th step：The corresponding free pointer queue of memory cell is accessed, correspondence pointer is read.Here, the free pointer
Queue includes：Decompose free address pointer alignment, merge free address pointer alignment and original free address pointer alignment.
5th step：Whether according to state instruction, it is the upward merging phase in space (current maximum base to judge current state
This memory cell expands).
Here, the upward merging phase of this step judges according to the long distribution of bag, if most of (configurable) maximum
Bag is bigger than maximum storage unit, then carries out the upward union operation of maximum storage unit；Or, most of most parcel compares minimum memory
Unit is big, then carries out minimum memory unit and merge upwards.
6th step：If the upward merging phase of non-space, then corresponding memory space is found according to pointer.
7th step：If the upward merging phase in space, then pointer odd even is judged, if pointer is odd number, according to finger
Pin, finds corresponding memory space.If pointer is even number, state of parity space is updated, this pointer is abandoned.
Here, the state of parity space of this step, expression is that the memory cell classification merged upwards is all even pointers
The full state of sky in correspondence space.If read such memory cell, acquired pointer is even number, then in odd even space
In, it is idle condition the corresponding Space notation of this pointer.When read operation is being performed, if release is that this is strange
When strange space in couple, can cooperatively it be discharged with even space, while the space discharged jointly is merged upwards together.
8th step：Data storage is carried out in correspondence memory space, bag length is updated.
9th step：The bag of renewal is grown and judged, if zero, then terminate write operation, otherwise jump to second step, enter
The storage of row remaining data bag.
2nd, in the case of read operation, the embodiment of the method for storage method of the present invention is as shown in Fig. 2 including herein below：
The first step：From queue is read, read pointer is obtained, the read request to memory space is initiated.
Second step：According to read pointer, corresponding memory space and chained list are searched out, digital independent is carried out.Read data complete
Bi Hou, carries out the release management in read pointer correspondence space.
3rd step：Whether according to state instruction, it is the upward merging phase in space to judge current state, if it is, and
Current pointer is that corresponding even pointer correspondence space is idle in strange pointer, and state of parity space, then carries out odd even pointer
Merge.New pointer correspondence odd even space, size is original twice, realizes space and merges upwards.
4th step：According to the corresponding address of pointer and master control state, corresponding free pointer queue is selected.Here, it is described
Free pointer queue includes：Decompose free address pointer alignment, merge free address pointer alignment and original free address pointer
Queue.
5th step：If the current pointer queue of selection is processing spatial decomposition region, performs pointer and decompose, one
Pointer resolves into odd even pointer, and the corresponding space of each pointer is the half of original space, completes space and decomposes downwards.
6th：Enter line pointer storage, and the link table information obtained according to second step, judge whether it is chain end of list (EOL), such as
Fruit is yes, then terminates, if NO, do not terminate also, then jumps to second step execution.
Here, each pointer alignment of above-mentioned 5th step has the respective Address space mappinD of oneself.
For example overall space is set to be 1-1000.Firm only one of which pointer alignment at first, sets each pointer correspondence
10 address spaces, all pointers all store this pointer alignment.
Merge upwards if 500-1000 performs space, then overall to become 2 pointer alignments.First queue correspondence
Pointer 1-500 pointer, each pointer correspondence space 10.Second pointer alignment correspondence 501-1000 pointer, each pointer
To a space 20.
Then 1-255 performs space and decomposed downwards, then overall to become 3 pointer alignments.First pointer alignment pair
1-255 is answered, it is 5 not have individual pointer correspondence space.Second pointer alignment is 256-500, and each pointer correspondence space is 10.3rd
Individual pointer alignment position 501-1000, each pointer correspondence space is 20.
Corresponding to above-mentioned read/write operation, composition structural representation such as Fig. 3 institutes of present invention read-write storage device embodiment
Show, including：
Memory space 101：For the principal space of data storage, double data rate DDR memory can be used, can also be used
The various memory devices such as on-chip SRAM, wherein, the SRAM is the internal memory with static access facility.
Master Control Unit 102：To carry out the Master Control Unit of storage control, for carrying out the integrated scheduling control of memory space.
Such as it is used for controlling working condition --- the normal condition of memory space, the upward merging phase in space (merges front and rear base while recording
The bulk of this memory cell), the downward decomposing state in space is (while record the space of basic unit of storage before and after spatial decomposition
Size), according to state instruction, for when pointer discharges, the control that pointer merges and decomposed；Multi channel selecting is controlled；Storage
Space distribution selection；The address space range of each pointer alignment is recorded, corresponding queue is arrived in the space pointer storage of release
In go.Here, every storage region of memory space has a corresponding pointer alignment, but the address realm of this panel region
It is also what is be continually changing as space merges the progress decomposed downwards upwards, it is therefore desirable to each current pointer of Master Control Unit record
The address realm of queue, when to facilitate space to discharge, the enqueue operations of pointer.
Read and write queue 103：Store read-write requests queue of the peripheral operation source to memory space.
Write control unit 104：Control unit is write for memory space, for writing data to memory space 101.
Free address pointer alignment 105 is decomposed, merges free address pointer alignment 107, original free address pointer alignment
108, the corresponding pointer alignment of respectively all kinds of idle storage spaces, the number of wherein queue is dynamic adjustment, can be increased
It can also reduce.It need to be noted that be：During using decomposing free address pointer alignment 105, the work of correspondence memory space
State is that space is decomposed downwards, performs pointer operation splitting, and the applicable type of service of this operation stores for small data packets；Using conjunction
And during free address pointer alignment 107, the working condition of correspondence memory space merges upwards for space, performs pointer and merges behaviour
Make, the applicable type of service of this operation stores for big data bag；During using original free address pointer alignment 108, correspondence storage
The working condition in space is normal, performs original pointer operation, and the applicable type of service of this operation is without dynamic adjustment, with working as
The current data packet that preceding storage organization is adapted to.
Pointer resolving cell 106：For pointer operation splitting need to be performed, i.e., when execution space is decomposed downwards, by original
The corresponding pointer of memory space resolves into odd, even two pointers, correspond to respectively the first half of former memory space memory space and
Latter half of memory space.
Address decoding unit 109：For that need to perform pointer union operation, i.e., when execution space merges upwards, original refers to
Pin queue is included in the pointer for merging address area and the pointer of unconsolidated address area.If the pointer currently read belongs to
Merge address area, then the current pointer of reading is sent to odd even decision unit 110 and carries out the upward merging treatment in follow-up space, it is no
Then it is routed directly to write address computation when control unit 104 is used for write operation.Wherein, using the benefit of odd even decision unit
It is：By it is increasing in memory space, exist because storage causes to become in memory space less and less basic unit of storage
First discharged during read operation, then judge that the continuous qualified pointer address in address merges after discharging by odd even, i.e., really
Protecting the adjacent space elementary cell address that pointer is pointed in memory space continuously just allows to merge.
Odd even decision unit 110：It is sent to the pointer of odd even decision unit and all participates in space and merges upwards.Due to being
System after running after a while, due to the discontinuous randomness of free space address difference in former memory space, therefore
Space is completed during write operation and merges that to write be highly difficult upwards, thus further consider to realize when space is read and discharged to
It is upper to merge.If strange pointer, then pointer is sent to and writes control unit 104 and carry out normal write operation, if even pointer, then will
Pointer is sent to state of parity space 111, and state of a control space is updated.
State of parity space 111：For the idle condition for the even pointer for recording correspondence queue.If odd even decision unit
110 convey the even pointer that comes, then the corresponding status indicator of this pointer will be set to height, represent that the corresponding space of this pointer is
It is idle.It is all low when wherein state space is initialized.Wherein only to big Storage Unit Pointer queue, and its minimum memory
There is corresponding odd states space in unit pointer queue space.Therefore, no matter memory space is after decomposing and merging, how much is generation
Pointer alignment, finally be up to two state of parity spaces, and each pointer state only has a bit, total expense is little,
It can be built with register.
Multi-path choice unit 112：According to the control of Master Control Unit, the pointer of release is sent in corresponding queue.
Merge Pointer unit 113：If the corresponding pointer in the space currently discharged merges correspondingly upwards in space
Location scope, and current pointer is strange pointer, then performs pointer union operation, reads the corresponding idol in state of parity space 111 and refers to
Needle-like state, if even pointer state is height, pointer merges successfully, and the pointer after merging is sent to merging free address pointer alignment
107；If even pointer state is low, pointer merges failure, and current pointer is transported to original free address pointer alignment 108.
Read control unit 114：Control unit is write for memory space, for reading data to memory space 101.
It need to be noted that be：Above-mentioned memory space 101, reads and writes queue 103, writes control unit 104, reads control unit
114, be in the prior art frequently with equipment, miscellaneous equipment is to realize the equipment set up of the present invention.
Using the present invention, fixed partition low space utilization in the prior art is overcome, chained list connection fragment is more, and performance is low
The characteristics of, it is a kind of adaptive memory allocation scheme, can be according to the situation of practical business type, adjust automatically storage knot
Structure, drastically increases space availability ratio and storage performance.And it is layered and is adjusted, it is ensured that does not cause complexity because of adjustment
Diverging.Here, the adjustment refers to：1)：Merge upwards for storage granularity just for minimum and maximum memory cell and decomposition downwards,
The storage granularity adjustment in the middle of minimum and maximum memory cell is not considered, that is to say, that, it is not necessary to all storage granularities are all free
It is changed, so that for all storage granularities are all freely changed, reduce complexity, and be finally reached
Effect and all storage granularities are all freely changed；2)：When merging decomposition, use with 2 (strange, even) storage granularities
Merge and decompose, but be not limited to this mode, it is also contemplated that merged with the storage granularity of the other values such as 3,4,5 and
The situation of decomposition.Present invention selection is merged and decomposed with 2 (strange, even) storage granularities, is a kind of optimal implementation, relatively
For the situation for merging and decomposing with the storage granularity of the other values such as 3,4,5, although the speed adjusted on the surface is fast
It is fast a lot, but actually complexity index rises, and system, after the operation of certain time, free memory locations divide at random
After cloth, the efficiency that other granularities merge decomposition is drastically reduced, and the final efficiency decomposed and the storage effect of merging is all not as this
The mode for merging and decomposing with 2 (strange, even) granularities that invention is selected.
Application example of the inventive method in the case of write operation is performed, comprises the following steps：
Step 201：Send and write application, and row write application is enrolled into read-write queue.
Step 202：The application that control unit reads read-write queue is write, the header packet information of packet is obtained, while by total
Control basic storage in unit reading space division information, the species and number of free pointer queue, and its every class pointer alignment single
The size of member, according to the long basic unit of storage calculated in selection memory space of bag.
Step 203：Selection is compared close pointer alignment with bag length, and judges whether memory space is idle, if idle,
Then application, if this pointer alignment is not idle, updated using the pointer of this pointer alignment and uses other pointer alignments, then judged
It is whether idle, if all pointer alignments are not idle, write operation pause.
Step 204：Idle pointer at most is obtained from original free address pointer alignment, if being currently normal shape
State, or the downward decomposing state in space, then this pointer, which is sent to, writes control unit, is writing control unit according to pointer calculating storage
Location, performs data write operation.Then packet header length is subtracted the size of the memory space of current pointer instruction, if result is just
Number, then update packet header length, jump to the 203rd step, until the packet header length updated is non-positive number.
Step 205：If during currently empty upward merging phase, the pointer obtained from original free address pointer alignment
First pass through address decoding unit and carry out address decoding, judge whether the address indicated by current pointer belongs to the area of space merging
Domain, if be not belonging to, performs the normal operating of step 204, is otherwise transported to odd even decision unit and carries out odd even judgement, pointer
It is strange, then is sent to and writes the normal write operation of control unit progress, be even number, be then sent to state of parity space, update current pointer pair
The state in space is answered, status indicator is the free time.
Step 206, after a packet storage is finished, this packet first address pointer can be registered in read-write queue 103,
Reading index is carried out for follow-up.
Step 207, after packet storage is finished, through after a period of time, outside is sent to read-write queue and sends reading application, reads
The packet first address that write queue is stored between is input to reading control unit and carries out subsequent treatment.
Application example of the inventive method in the case of read operation is performed, comprises the following steps：
Step 301：Control unit is read directly by pointer, the data space of packet storage is calculated, reads corresponding bag
Head data and its link table information.
Step 302：, it is necessary to which the corresponding memory space of original storage bag data is carried out after step 301 read operation is finished
Release, is registered in free pointer queue, and follow-up other packets are used later.
Step 303：Through after a period of time, data are surrounded by reading demand.Peripheral operation source, data are read to read-write queue registration
Submit a report asking for and ask.The pointer that read-write queue stores step 302 spues, and is sent to reading control unit and assists to carry out read operation.
Step 304：Control unit is read according to the pointer of acquisition, the address of data storage is calculated, and be read out data and
The operation of linked list head.After all data all read and finished, pointer currently is sent to merging Pointer unit and subsequently grasped
Make.
Step 305：The chained list header that analyzing step 304 is obtained, judges whether packet reads and finishes, and has not read such as
Bi Ze lifts new pointer information, repeat step 304 according to linked list head.
Step 306：Merge Pointer unit and receive the pointer for reading the space to be released that control unit is brought, and judge current
Whether pointer belongs to the upward consolidation scope in space, is not belonging to, and pointer does not handle direct output.Belong to consolidation scope, according to current
The size of pointer correspondence memory space, it is to merge prior pointer to judge current pointer, or merges backpointer, merges backpointer then straight
Connect output.Pointer before merging then judges that pointer is strange pointer or even pointer, and even pointer does not handle direct output, and strange pointer is then
State of parity space is read, the even pointer state of matching is checked, pointer success is merged if the even pointer of matching is the free time, it is no
It is then unsuccessful.
Step 307：Receive and merge the free pointer that comes of Pointer unit conveying, according to Master Control Unit, pointer is sent to pair
The pointer alignment answered.Wherein each pointer alignment has each self-corresponding address realm, except the pointer for merging failure, all fingers
Pin arrives respective pointer alignment by address realm storage.Original pointer queue is arrived in the pointer storage for merging failure, merges successful
Pointer storage, which is arrived, merges pointer alignment.
Step 308：Convey toward the pointer for decomposing pointer alignment, according to the size of current pointer correspondence memory space, judge
Current pointer is to decompose prior pointer, or decomposes backpointer.Pointer after decomposition is directly stored in pointer alignment, the finger before decomposition
Pin, then resolve into two pointers of odd even by pointer resolving cell, be then stored into pointer alignment and go.
The invention belongs to stored digital field, it is adapted to various electronic storage devices, is particularly suitable for use in the field of communications
Data storage processing.
In summary, using the present invention, have the advantages that：
1st, with adaptation function, the use of memory space can according to the types of service of data, be adjusted.It is divided into for business
Type is that the dynamic in the case of big data bag, small data packets and three kinds of the current data packet consistent with distribution storage organization is adjusted.
2nd, the utilization rate of memory space is high, due to being adapted dynamically, therefore the storage of relatively existing fixed elementary cell
For the secret sharing of space, if maximum bag most parcel differs several magnitudes in data flow, then using the present invention, space utilization
Rate just has the lifting of several magnitudes with respect to existing scheme, while performance is held essentially constant.
3rd, the synthesis storage performance of memory space is high, relative to existing chained list sharing method, with the lengthening of processing time,
Performance boost ratio is higher, and final performance can lift tens times, while keeping space availability ratio also more slightly higher than existing scheme.
4th, it is low in energy consumption：Using the present invention, when storage organization adjustment is carried out, it is not related to data-moving, finger is not related to
Pin is moved, and without operation bidirectional, normal data storage is not influenceed, does not increase power dissipation overhead additionally substantially.
The foregoing is only a preferred embodiment of the present invention, is not intended to limit the scope of the present invention.
Claims (13)
1. a kind of storage method applied to wireless telecommunications, it is characterised in that this method includes：
The migration of correspondence pointer is selected to adjust storage organization according to the type of service of data, self-adjusted block memory space,
Correspondence pointer is read in the case of write operation, whether the state that memory space is judged according to state instruction is that non-space merges shape upwards
State, if it is, finding corresponding memory space according to the pointer of reading and performing data write operation, if it is not, then being referred to
Pin odd even judges；
It is described enter line pointer odd even judge specifically include：If the pointer read is odd number pointer, referred to according to the odd number of reading
Pin finds corresponding memory space and performs data write operation；If the pointer read is even number pointer, by the even number of reading
Pointer is sent to state of parity space and it is updated, and the corresponding status indicator of even number pointer is set into height.
2. according to the method described in claim 1, it is characterised in that even number pointer, institute are only stored in the state of parity space
When stating the corresponding status indicator of even number pointer and being set to high, it is the free time to indicate the corresponding space of the even number pointer；
Each even number pointer and corresponding odd number pointer constitute an odd even pair.
3. a kind of storage method applied to wireless telecommunications, it is characterised in that this method includes：Selected according to the type of service of data
Select the migration of correspondence pointer to adjust storage organization, self-adjusted block memory space reads correspondence pointer in the case of read operation
Find corresponding memory space and perform data reading operation, read and the pointer correspondence space of reading is discharged after finishing, such as
Fruit judges the state of memory space for the upward merging phase in space according to state instruction, then enters the judgement of line pointer odd even；
It is described enter line pointer odd even judge specifically include：If the pointer read is even number pointer, it is not processed；If
The pointer of reading is odd number pointer, then refers in state of parity space querying with the presence or absence of the even number matched with the odd number pointer
Pin, even number pointer if there is the matching and corresponding status indicator of even number pointer is set to height then carries out odd even pointer merging.
4. method according to claim 3, it is characterised in that even number pointer, institute are only stored in the state of parity space
When stating the corresponding status indicator of even number pointer and being set to high, it is the free time to indicate the corresponding space of the even number pointer；
Each even number pointer and corresponding odd number pointer constitute an odd even pair.
5. method according to claim 4, it is characterised in that this method also includes：If release is the odd even pair
The corresponding strange space of middle odd number pointer, then the corresponding even space of the odd even centering even number pointer with the strange space cooperatively
Two memory spaces are merged into a continuous memory space in address by release upwards simultaneously.
6. method according to claim 4, it is characterised in that carry out after odd even pointer merging, after odd even pointer merges
Newly the size in pointer correspondence odd even space is：The corresponding former strange space of odd even centering odd number pointer is corresponding with even number pointer former even
Space sum.
7. method according to claim 3, it is characterised in that this method also includes：If being judged to deposit according to state instruction
The state for storing up space is the downward decomposing state in space, then a pointer of reading is decomposed into odd number pointer and corresponding idol
Number pointer, realizes that space is decomposed downwards；
Accordingly, the size in the corresponding former space of the pointer of reading is divided into two parts, the corresponding strange space of odd number pointer and even number
The corresponding even space of pointer respectively accounts for the half of former space size.
8. one kind read-write storage device, it is characterised in that the device includes：Master Control Unit, multi-path choice unit, odd even judgement are single
Member；Wherein,
Master Control Unit, for controlling multi-path choice unit to be selected the migration of correspondence pointer to be deposited to adjust according to the type of service of data
Store up the storage organization in space, self-adjusted block memory space；
Multi-path choice unit, during for type of service for the packet adaptable with existing storage organization, the original sky of corresponding selection
Not busy pointer alignment；When type of service is beyond the big data bag of existing storage organization, corresponding selection merges free pointer queue；Industry
When service type is the small data packets less than existing storage organization, corresponding selection decomposes free pointer queue after pointer is decomposed；
Odd even decision unit, the working condition of the memory space for being controlled in the Master Control Unit is the upward merging phase in space
When, enter the judgement of line pointer odd even；
The odd even decision unit, is further used in the case of write operation, and the pointer obtained from address decoding unit is carried out
When odd even judges, the pointer of reading is odd number pointer, finds corresponding memory space according to the odd number pointer of reading and performs number
According to write operation；If the pointer read is even number pointer, the even number pointer of reading is sent into state of parity space is carried out more to it
Newly, and by the corresponding status indicator of even number pointer it is set to height.
9. device according to claim 8, it is characterised in that the working condition of the memory space is specifically included：Normally
State, the upward merging phase of the downward decomposing state in space or space.
10. device according to claim 8, it is characterised in that the device also includes：Address decoding unit, for described
When working condition is the upward merging phase in space, judge whether the address indicated by the pointer read belongs to the area that space merges
Domain, when belonging to the region of space merging, the odd even decision unit is sent to by the pointer of reading.
11. device according to claim 9, it is characterised in that the odd even decision unit, is further used in read operation
In the case of, the pointer of reading is even number pointer, and it is not processed；The pointer of reading is odd number pointer, then empty in state of parity
Between inquiry with the presence or absence of the even number pointer that is matched with the odd number pointer, refer to and be directed to if there is the even number pointer and even number of matching
The status indicator answered is set to height, then notifies that merging Pointer unit carries out odd even pointer merging.
12. the device according to claim 10 or 11, it is characterised in that only store even number in the state of parity space and refer to
Pin, when the corresponding status indicator of the even number pointer is set to high, it is the free time to indicate the corresponding space of the even number pointer；Each
Even number pointer and corresponding odd number pointer constitute an odd even pair.
13. the device according to claim 10 or 11, it is characterised in that the device also includes：Pointer resolving cell, is used for
When the working condition is the downward decomposing state in space, a pointer of reading is decomposed into odd number pointer and corresponding idol
Number pointer, realizes that space is decomposed downwards.
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 CN104063327A (en) | 2014-09-24 |
| CN104063327B true 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) |
Families Citing this family (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN107391388B (en) * | 2016-05-17 | 2021-06-11 | 阿里巴巴集团控股有限公司 | Method and equipment for storing data 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 |
Also Published As
| Publication number | Publication date |
|---|---|
| CN104063327A (en) | 2014-09-24 |
| WO2013189324A2 (en) | 2013-12-27 |
| WO2013189324A3 (en) | 2014-02-20 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN107360206A (en) | A kind of block chain common recognition method, equipment and system | |
| US8984085B2 (en) | Apparatus and method for controlling distributed memory cluster | |
| CN103914399B (en) | Disk buffering method and device in a kind of concurrent computational system | |
| CN103701934B (en) | Resource optimal scheduling method and virtual machine host machine optimal selection method | |
| CN104615684B (en) | A kind of mass data communication concurrent processing method and system | |
| CN107045456A (en) | A kind of resource allocation methods and explorer | |
| CN101021814A (en) | Storage and polling method and storage controller and polling system | |
| CN104123304B (en) | The sorting in parallel system and method for data-driven | |
| CN103345514A (en) | Streamed data processing method in big data environment | |
| CN104320854B (en) | Resource regulating method and device | |
| CN104111936B (en) | Data query method and system | |
| CN109885397A (en) | The loading commissions migration algorithm of time delay optimization in a kind of edge calculations environment | |
| CN110162388A (en) | A kind of method for scheduling task, system and terminal device | |
| CN104023042B (en) | Cloud platform resource scheduling method | |
| CN104834484B (en) | Data processing system based on embedded programmable logic array and processing method | |
| CN109902975A (en) | Dispatching method, system, device and computer readable storage medium | |
| CN107239342A (en) | A kind of storage cluster task management method and device | |
| CN106934577A (en) | Goods layout method and device | |
| CN110308982A (en) | A kind of shared drive multiplexing method and device | |
| CN102779183B (en) | Data inquiry method, equipment and system | |
| CN103001793A (en) | Method and device for managing ACL (access control list) | |
| CN101374109B (en) | Method and apparatus for scheduling packets | |
| CN109639596A (en) | A kind of Scheduling of Gateway method for vehicle-mounted CAN-CANFD hybrid network | |
| CN108446180A (en) | A kind of data center dynamic method for scheduling task based on Data Migration | |
| CN104156505B (en) | A kind of Hadoop cluster job scheduling method and devices based on user behavior analysis |
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 | ||
| 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. |