CN105550234B - Transmission method when being chosen based on binary search moonlet data - Google Patents
Transmission method when being chosen based on binary search moonlet data Download PDFInfo
- Publication number
- CN105550234B CN105550234B CN201510891750.7A CN201510891750A CN105550234B CN 105550234 B CN105550234 B CN 105550234B CN 201510891750 A CN201510891750 A CN 201510891750A CN 105550234 B CN105550234 B CN 105550234B
- Authority
- CN
- China
- Prior art keywords
- data
- moonlet
- binary search
- memory
- frame
- 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
- 238000000034 method Methods 0.000 title claims abstract description 42
- 230000005540 biological transmission Effects 0.000 title claims abstract description 25
- 238000010845 search algorithm Methods 0.000 claims abstract description 24
- 230000008569 process Effects 0.000 claims abstract description 19
- 238000005538 encapsulation Methods 0.000 claims abstract description 15
- 238000005070 sampling Methods 0.000 claims abstract description 9
- 238000012163 sequencing technique Methods 0.000 claims abstract description 4
- 238000013461 design Methods 0.000 abstract description 4
- 230000008878 coupling Effects 0.000 abstract description 2
- 238000010168 coupling process Methods 0.000 abstract description 2
- 238000005859 coupling reaction Methods 0.000 abstract description 2
- 230000001174 ascending effect Effects 0.000 description 4
- 238000013500 data storage Methods 0.000 description 4
- 238000013523 data management Methods 0.000 description 2
- 239000000284 extract Substances 0.000 description 2
- 238000000605 extraction Methods 0.000 description 2
- 230000006870 function Effects 0.000 description 2
- 238000007726 management method Methods 0.000 description 2
- 230000008520 organization Effects 0.000 description 2
- 238000012545 processing Methods 0.000 description 2
- 230000002123 temporal effect Effects 0.000 description 2
- 238000004458 analytical method Methods 0.000 description 1
- 230000006399 behavior Effects 0.000 description 1
- 230000008901 benefit Effects 0.000 description 1
- 238000007405 data analysis Methods 0.000 description 1
- 230000007812 deficiency Effects 0.000 description 1
- 238000011161 development Methods 0.000 description 1
- 238000010586 diagram Methods 0.000 description 1
- 230000000694 effects Effects 0.000 description 1
- 238000005265 energy consumption Methods 0.000 description 1
- 238000005516 engineering process Methods 0.000 description 1
- 238000011156 evaluation Methods 0.000 description 1
- 230000005055 memory storage Effects 0.000 description 1
- 238000012544 monitoring process Methods 0.000 description 1
- 238000012216 screening Methods 0.000 description 1
- 238000012360 testing method Methods 0.000 description 1
- 230000005641 tunneling Effects 0.000 description 1
Classifications
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F16/00—Information retrieval; Database structures therefor; File system structures therefor
- G06F16/20—Information retrieval; Database structures therefor; File system structures therefor of structured data, e.g. relational data
- G06F16/24—Querying
- G06F16/245—Query processing
- G06F16/2455—Query execution
- G06F16/24552—Database cache management
-
- 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/08—Addressing or allocation; Relocation in hierarchically structured memory systems, e.g. virtual memory systems
- G06F12/10—Address translation
- G06F12/1009—Address translation using page tables, e.g. page table structures
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F16/00—Information retrieval; Database structures therefor; File system structures therefor
- G06F16/10—File systems; File servers
- G06F16/17—Details of further file system functions
- G06F16/172—Caching, prefetching or hoarding of files
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F16/00—Information retrieval; Database structures therefor; File system structures therefor
- G06F16/20—Information retrieval; Database structures therefor; File system structures therefor of structured data, e.g. relational data
- G06F16/23—Updating
- G06F16/2308—Concurrency control
- G06F16/2315—Optimistic concurrency control
- G06F16/2322—Optimistic concurrency control using timestamps
Landscapes
- Engineering & Computer Science (AREA)
- Theoretical Computer Science (AREA)
- Physics & Mathematics (AREA)
- General Engineering & Computer Science (AREA)
- General Physics & Mathematics (AREA)
- Databases & Information Systems (AREA)
- Data Mining & Analysis (AREA)
- Computational Linguistics (AREA)
- Communication Control (AREA)
- Data Exchanges In Wide-Area Networks (AREA)
Abstract
Transmission method when a kind of moonlet data based on binary search algorithm of the present invention are chosen, comprising the following steps: reading and writing spatial cache storing process: is marked off in the memory of moonlet；User's frame data are deposited by sampling time sequencing to write buffer space；Reading process: the data category of time range and target data when setting is chosen；The starting page address of target data in memory is obtained using binary search algorithm；According to the starting page address by the raw information in storage order reading memory；Protocol encapsulation is carried out to the raw information read, then is issued by transmitter.The present invention is simple and effective, using grading design, I O operation and Service control it is mutually isolated, the coupling between module is low, and module is portable high, highly reliable；Using binary search algorithm, search time is short, can obtain the valid data for meeting object time requirement in a short time, and channel utilization is high, and in moonlet field, the present invention has important application meaning.
Description
Technical field
Transmission method when choosing the present invention relates to the moonlet delay data based on binary search, belongs to moonlet data processing
Technical field.
Background technique
With the development of aeronautical and space technology, for moonlet using more and more extensive, design complexities are higher and higher.Moonlet
With small in size, low in energy consumption, functional module integrated level is high, load quantity is more, data storage capacity is big, data management requires high spy
Point.
Satellite in orbit when, platform telemetry data and load data can be generated, platform telemetry data are used for monitoring platform
State, data store always, and storage data quantity is larger, and load is usually only opened in experimental stage, and the load data amount of generation is few,
But data sense is very big；For Low earth orbit satellite, Satellite TT segmental arc (satellite Observable segmental arc) is very short, in order to from a large amount of
Data within the scope of the object time are obtained in storing data, are such as obtained in load test time range from a large amount of platform telemetry data
Platform telemetry data, the way of traditional large satellite be since data store initial position issue data on star, by mentioning
High downstream rate, makes ground receiver mass data, and ground system extracts target data from the reception data content again.
It is limited to downstream rate and TT & c arc, it is sometimes desirable to which multiple TT & c arcs could be completed, usual moonlet downlink
Rate is low, and this data down transmission mode is applied in moonlet data management, will lead to more observing and controlling, number passes the wave of resource
Take, and if improving moonlet downstream rate and long-play, whole star power consumption can be made to increase, crisis occurs in energy supply on star；
So the mode that traditional large satellite selects target data in mass data is not particularly suited for moonlet.
Another method is that data are carried out with the processing mode that decimation in time, other times data abandon at equal intervals, the party
Formula advantage is the data volume for reducing redundancy and passing down, while can pass partial target data below.But the method deficiency is, big
The data equal intervals extraction section data of amount, linear gauge evaluation time is longer, and if extract interval too small, amount of redundant data will
Increase；If the ratio of extraction is excessive, data are excessively sparse, can greatly reduce the valid data amount within the scope of object time, give ground
Data analysis work is made troubles.
It is small satellite system software design so how to obtain the data generated in object time under limited resource
Emphasis is needed to consider the problems of in the process.
Summary of the invention
It is an object of the invention to design transmission method when one kind is chosen, effective acquisition moonlet produces within object time
Raw in-orbit data.
Transmission method when a kind of moonlet data based on binary search algorithm are chosen, comprising the following steps:
Storing process:
Reading and writing spatial cache is marked off in the memory of moonlet；
User's frame data are deposited by sampling time sequencing to write buffer space；
Memory is written into write buffer spatial data again；
Reading process:
The data category of time range and target data when setting is chosen；
The starting page address of target data in memory is obtained using binary search algorithm；
According to the starting page address by the raw information in storage order reading memory；
Protocol encapsulation is carried out to the raw information read, then is issued by transmitter.
The present invention, in conjunction with binary search algorithm, can obtain target in memory in data read process in a short time
Data in time range effectively improve TT & c arc resource utilization.
The reading and writing spatial cache is respectively a storage unit size.One storage unit can be according to universal means
Setting, such as 8K byte.
Sampling time for arranging user's frame data is the time on star.
It is when write buffer insufficient space is to accommodate next user's frame data, the data write-in in the write buffer space is small
In the memory of satellite.
For the ease of indexing different types of data, it is divided into multiple regions, needle by data category in memory in the present invention
Sequence round-robin queue structure is used to each region, i.e., manages the storing process of data in a manner of datacycle covering.
In the present invention, the format of user's frame data is successively are as follows:
User's frame frame head is used for mark data type；
User's frame count is the serial number of each frame；
User's frame time second and user's frame time millisecond, for indicating active user's frame data sampling time (when on star
Between)；
Valid data；
Redundancy check bit；
Postamble.
The present invention devises a kind of customized user's frame data format, opens up the slow of a storage unit size in memory
It deposits, by user's frame data by sampling time sequencing write-in caching, when caching is not enough to accommodate next user's frame data,
By in the data cached write-in memory (mass storage characteristic), memory storage management is tied using sequence round-robin queue
Structure manages the storing process of data in a manner of datacycle covering.
When reading the raw information in memory, reading first will after read buffer space takes to the read buffer space
The data in read buffer space remove and carry out the protocol encapsulation.
The storing process and reading process pass through the software realization of two layers of framework, wherein to write buffer space and memory
Middle write-in data, and the raw information read in memory are realized in first layer；To raw information carry out protocol encapsulation with
And it issues and is realized in the second layer.
First layer mainly completes initial data classification on star, storage, reads management work in two layers of framework, and the second layer is main
It completes to carry out input data protocol encapsulation and data down transmission works；By a memory control block, manage data storage,
Screening process is calculated according to memory cell data institutional framework each in storage region by binary search when reading and data are chosen
Method quickly positions the starting page address for meeting time conditions data, and as the input of second layer control block, passes purpose down
Data in time range.
It is fast using binary search algorithm using the time as search attribute in first layer control block to the data in storage region
Speed obtains the starting page address of target data in memory, and the starting input address as second layer control block, by storage
Sequence reads the raw information in memory, carries out protocol encapsulation to raw information in second layer control block, passes through transmitter
Data after issuing encapsulation.
Transmission method is simple and effective when choosing the present invention is based on the moonlet data of binary search, using grading design, I O behaviour
Make and Service control is mutually isolated, the coupling between module is low, and module is portable high, highly reliable；Make full use of two points
Searching algorithm, search time is short, can obtain the data in memory within the scope of the object time in a short time.
In moonlet application field, when transmission objectives data, the present invention can save computing resource and power supply on star
Resource, and transmission channel utilization rate is high, effectively improves the utilization rate of ground observing and controlling resource in TT & c arc, saves ground observing and controlling money
Source.
Detailed description of the invention
Fig. 1 is customized user's frame structure diagram of the method for the present invention.
Fig. 2 is the memory cell data organization chart of the method for the present invention.
Fig. 3 is that the storage unit of the method for the present invention the storage organization figure after circulation covering occurs.
Fig. 4 is the framework map of the method for the present invention functions of modules.
Specific embodiment
The storage unit of usual mass storage becomes a page (page), and a page size is typically larger than a Fig. 1
User's frame of definition, therefore common way is that spatial cache (this of one or integer page size is opened up in processor memory
Invention is designed as opening up a page size), when the insufficient space is to accommodate user's frame data, which is written and is stored
In device.
Frame structure as shown in Figure 1, wherein user's frame frame head is used for mark data type, user's frame time second and user's frame
Time on star of the time millisecond for indicating active user's frame sampling；User's frame count is the serial number of each frame, and Crc is redundancy check
Position.
As shown in figure 4, the method for the present invention is realized by existing hardware using software function module, functional module difference first
Layer and the second layer, two layers of the control block division of labor is clear, and independently of each other, first layer control block manages the storage and reading of initial data,
Second layer control block carries out protocol encapsulation and data transmission to raw information.
In first layer control block, memory control block divides memory block according to sample rate, the data volume of each categorical data
Domain, every kind of data type separate storage, memory space are mutually isolated.The corresponding storage region of every class data is by multiple storage units
It constitutes, each storage unit is made of multiple user's frames；If each storage unit size is A byte, type i data correspond to user
Frame length is set as LiByte, for Fig. 2, free area shown in Fig. 3, if the length is EiByte can be stored in each storage unit
User's number of frames be Ni, then have:
Ei=A%Li (Li≥14)
Storage unit size A is required to be more than or equal to L at thisi, for the data that condition is not satisfied, can be used by splitting
Family frame meets above-mentioned condition.
Satellite in orbit during, the data of the generation corresponding time is ascending order.In a memory cell structure, number
User's frame time ascending order arranges accordingly；In the corresponding storage region of specific type of data, in data field vacant state, data are also
With the arrangement of user's frame time ascending order, as shown in Fig. 2, expiring state in data field, data storage can have a time inflection point, at this
It is with the arrangement of time ascending order, as shown in Figure 3 before and after the corresponding storage unit of time inflection point.
After receiving " data type selection " and " object time information " instruction on star, passing of satelline memory control block,
Corresponding categorical data such as Fig. 4 in memory is obtained, then passes through binary search algorithm, storage region corresponding to the type data
According to object time progress binary search and acquisition meets the purpose data storage starting page address P of time requirement0, this two points are searched
The algorithm description of rope is as shown in Figure 4.The core of the binary search algorithm is, reads a page information from memory every time,
The corresponding temporal information of first user's frame for extracting this page, it is compared with object time, is chosen constantly if met
Between condition, then record the page address information of this page.The output of entire binary search algorithm is to meet object time requirement data
Starting page address.
The binary search algorithm case study:
Due to only obtaining each page of the corresponding temporal information of first user's frame one as binary search algorithm
Compare attribute, it may appear that regular hour deviation, because storing N in a pageiUser's frame of a the type, if purpose is searched for
Between be Tt, the start page of the return corresponding time is Tp, data sampling rate T, deviation meets relationship Tt≤Tp+Ni*T。
The binary search algorithm complexity and time Overhead Analysis:
If the effective memory space in memory block accounts for n storage unit, the time for reading the consumption of a storage unit is T0, usually
T0Time is millisecond magnitude, then the maximum time t that the binary search algorithm needs0Expense are as follows:
t0=T0*log2n (n≥1)
Traditional order searches the maximum time expense t needed1Are as follows:
t1=T0*n(n≥1)
Practical application compares:
One page size data time-consuming 8.9ms of memory is read, storage size is L page, and each page of size is 8K
Byte, the target data citing page of memory area initial position D, tcThe time required to issuing target data for traditional order, tsFor
The time required to this system issues target data (time not comprising the consumption of protocol encapsulation process), in the enough conditions of downstream rate
Under, there is following table,
The table 1-1 time compares
| L | D | tc/s | ts/s | D | tc/s | ts/s | D | tc/s | ts/s |
| 1000 | 10 | 0.0898 | 0.0719 | 500 | 4.455 | 0.0805 | 990 | 8.817 | 0.0802 |
| 5000 | 10 | 0.0903 | 0.0985 | 2500 | 22.251 | 0.1068 | 4990 | 44.416 | 0.0801 |
| 10000 | 10 | 0.0896 | 0.1071 | 5000 | 44.505 | 0.1157 | 9990 | 88.915 | 0.0892 |
| 100000 | 10 | 0.0898 | 0.1510 | 50000 | 445.09 | 0.1429 | 99990 | 889.916 | 0.1334 |
| 200000 | 10 | 0.0903 | 0.1608 | 100000 | 890.08 | 0.1515 | 199990 | 1779.918 | 0.1425 |
| 500000 | 10 | 0.0897 | 0.1505 | 250000 | 2225.04 | 0.1604 | 499990 | 4449.912 | 0.1608 |
It can be seen that binary search algorithm is searched relative to traditional order needs less time loss.
Specific binary search algorithm can be by encoding realization as follows:
After obtaining memory block start position information by first layer control block, satellite starts to read " purpose number from the position
According to stream ", using purpose data flow as the input of second layer control block.
In second layer control block, " telemetering, number pass channel to channel adapter " module effect is the selection in channel, because different
Channel is different to the tunneling that data are taken.Control is instructed when the channel to channel adapter is chosen by ground.For " transmission association
" the protocol encapsulation process of module, different data types, same channel is consistent, and difference is data source for view encapsulation.Such as
This can come out protocol encapsulation process abstraction, as an independent module, data, data type and every kind of data type pair
Input of the attribute packet answered as the module, output are the transmission frame for meeting transport protocol, and transmission frame can directly be sent to transmitting
Machine is issued to ground.
It can be seen that the input of first layer control block is surface instruction, the data starting of transmission conditions when choosing to meet is exported
Page address；The input of second layer control block is the starting page address of data transmission channel, data type and purpose data, and it is full for exporting
The transmission frame of sufficient consensus standard.
Claims (7)
- Transmission method when 1. a kind of moonlet data based on binary search algorithm are chosen, which comprises the following steps:Storing process:Reading and writing spatial cache is marked off in the memory of moonlet；User's frame data are deposited by sampling time sequencing to write buffer space；Memory is written into write buffer spatial data again；Reading process:The data category of time range and target data when setting is chosen；The starting page address of target data in memory is obtained using binary search algorithm；According to the starting page address by the raw information in storage order reading memory；Protocol encapsulation is carried out to the raw information read, then is issued by transmitter.
- Transmission method when 2. the moonlet data based on binary search algorithm are chosen as described in claim 1, which is characterized in that institute The reading and writing spatial cache stated is respectively a storage unit size.
- Transmission method when 3. the moonlet data based on binary search algorithm are chosen as claimed in claim 2, which is characterized in that when When write buffer insufficient space is to accommodate next user's frame data, by the storage of the data write-in moonlet in the write buffer space In device.
- Transmission method when 4. the moonlet data based on binary search algorithm are chosen as claimed in claim 3, which is characterized in that deposit It is divided into multiple regions by data category in reservoir, uses sequence round-robin queue structure for each region, i.e., covered with datacycle The mode of lid manages the storing process of data.
- Transmission method when 5. the moonlet data based on binary search algorithm are chosen as described in claim 1, which is characterized in that institute State the format of user's frame data successively are as follows:User's frame frame head is used for mark data type；User's frame count is the serial number of each frame；User's frame time second and user's frame time millisecond, for indicating active user's frame data sampling time；Valid data；Redundancy check bit；Postamble.
- Transmission method when 6. the moonlet data based on binary search algorithm are chosen as described in claim 1, which is characterized in that read When raw information in access to memory, read first to the read buffer space, after read buffer space takes, by read buffer space Data remove and carry out the protocol encapsulation.
- Transmission method when 7. the moonlet data based on binary search algorithm are chosen as described in claim 1, which is characterized in that institute It states storing process and reading process passes through the software realization of two layers of framework, wherein number is written into write buffer space and memory According to, and read memory in raw information first layer realize；Protocol encapsulation is carried out to raw information and is issued The second layer is realized.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201510891750.7A CN105550234B (en) | 2015-12-07 | 2015-12-07 | Transmission method when being chosen based on binary search moonlet data |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201510891750.7A CN105550234B (en) | 2015-12-07 | 2015-12-07 | Transmission method when being chosen based on binary search moonlet data |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN105550234A CN105550234A (en) | 2016-05-04 |
| CN105550234B true CN105550234B (en) | 2018-12-25 |
Family
ID=55829423
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201510891750.7A Active CN105550234B (en) | 2015-12-07 | 2015-12-07 | Transmission method when being chosen based on binary search moonlet data |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN105550234B (en) |
Families Citing this family (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN112206532A (en) * | 2020-10-19 | 2021-01-12 | 珠海金山网络游戏科技有限公司 | Object processing method and device |
Citations (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US5920886A (en) * | 1997-03-14 | 1999-07-06 | Music Semiconductor Corporation | Accelerated hierarchical address filtering and translation using binary and ternary CAMs |
| CN101388110B (en) * | 2008-10-31 | 2011-08-17 | 深圳市同洲电子股份有限公司 | Data rapidly-reading method and apparatus |
| CN103259737A (en) * | 2013-04-18 | 2013-08-21 | 西安交通大学 | Method for quickly positioning parallel storage high speed network flow |
| CN104407986A (en) * | 2014-10-27 | 2015-03-11 | 华为技术有限公司 | Method and device for caching configuration in storage equipment and controller |
-
2015
- 2015-12-07 CN CN201510891750.7A patent/CN105550234B/en active Active
Patent Citations (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US5920886A (en) * | 1997-03-14 | 1999-07-06 | Music Semiconductor Corporation | Accelerated hierarchical address filtering and translation using binary and ternary CAMs |
| CN101388110B (en) * | 2008-10-31 | 2011-08-17 | 深圳市同洲电子股份有限公司 | Data rapidly-reading method and apparatus |
| CN103259737A (en) * | 2013-04-18 | 2013-08-21 | 西安交通大学 | Method for quickly positioning parallel storage high speed network flow |
| CN104407986A (en) * | 2014-10-27 | 2015-03-11 | 华为技术有限公司 | Method and device for caching configuration in storage equipment and controller |
Non-Patent Citations (2)
| Title |
|---|
| 中国海洋一号卫星星务管理系统设计与在轨性能评估;贾涛;《航天器工程》;20030930;全文 * |
| 微小卫星综合电子系统设计;李孝同;《航天器工程》;20080131;全文 * |
Also Published As
| Publication number | Publication date |
|---|---|
| CN105550234A (en) | 2016-05-04 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN109085997A (en) | Memory-efficient for nonvolatile memory continues key assignments storage | |
| US7733892B2 (en) | Buffer management method based on a bitmap table | |
| CN101162441B (en) | Access apparatus and method for data | |
| US20210203477A1 (en) | Method and device for blockchain full sharding based on a p2p storage network and a multi-layer architecture | |
| US20180052631A1 (en) | Method and apparatus for compressing addresses | |
| CN106202138A (en) | Storage device and method for autonomous space compression | |
| CN104156400B (en) | The storage method and device of a kind of mass network flow data | |
| CN110489407A (en) | Data filling mining method, apparatus, computer equipment and storage medium | |
| CN104408190A (en) | Spark based data processing method and device | |
| CN107430554A (en) | Storage cache performance is improved as the standard that cache is inserted by using the compressibility of data | |
| CN107147590A (en) | A kind of method and system based on rdma protocol message communicating | |
| CN104615684A (en) | Mass data communication concurrent processing method and system | |
| CN106503008A (en) | File memory method and device and file polling method and apparatus | |
| CN105279108A (en) | Method for writing data of solid-state drive | |
| CN106407226B (en) | A kind of data processing method, backup server and storage system | |
| CN104536700B (en) | Quick storage/the read method and system of a kind of bit stream data | |
| US20220342934A1 (en) | System for graph node sampling and method implemented by computer | |
| CN105550234B (en) | Transmission method when being chosen based on binary search moonlet data | |
| CN103902471B (en) | Data buffer storage treating method and apparatus | |
| CN109508317A (en) | A kind of Large Volume Data and service management system | |
| CN111259014B (en) | Method and system for storing data of one-way linked list of FPGA (field programmable Gate array) | |
| CN106776680A (en) | A kind of acquisition method of distributed stream data | |
| CN109521954B (en) | Distribution network FTU fixed point file management method and device | |
| CN103927269B (en) | A kind of reconfigurable configuration data cache system based on Block-matching and compression method | |
| CN110096456A (en) | A kind of High rate and large capacity caching method and device |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| C06 | Publication | ||
| PB01 | Publication | ||
| C10 | Entry into substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| GR01 | Patent grant | ||
| GR01 | Patent grant |