CN108647154A - A method of carrying out parameter modification in concentrator - Google Patents
A method of carrying out parameter modification in concentrator Download PDFInfo
- Publication number
- CN108647154A CN108647154A CN201810467697.1A CN201810467697A CN108647154A CN 108647154 A CN108647154 A CN 108647154A CN 201810467697 A CN201810467697 A CN 201810467697A CN 108647154 A CN108647154 A CN 108647154A
- Authority
- CN
- China
- Prior art keywords
- parameter
- node
- chained list
- parameter storage
- concentrator
- 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.)
- Pending
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/08—Addressing or allocation; Relocation in hierarchically structured memory systems, e.g. virtual memory systems
- G06F12/0802—Addressing of a memory level in which the access to the desired data or data block requires associative addressing means, e.g. caches
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F3/00—Input arrangements for transferring data to be processed into a form capable of being handled by the computer; Output arrangements for transferring data from processing unit to output unit, e.g. interface arrangements
- G06F3/06—Digital input from, or digital output to, record carriers, e.g. RAID, emulated record carriers or networked record carriers
- G06F3/0601—Interfaces specially adapted for storage systems
- G06F3/0628—Interfaces specially adapted for storage systems making use of a particular technique
- G06F3/0638—Organizing or formatting or addressing of data
- G06F3/064—Management of blocks
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F3/00—Input arrangements for transferring data to be processed into a form capable of being handled by the computer; Output arrangements for transferring data from processing unit to output unit, e.g. interface arrangements
- G06F3/06—Digital input from, or digital output to, record carriers, e.g. RAID, emulated record carriers or networked record carriers
- G06F3/0601—Interfaces specially adapted for storage systems
- G06F3/0628—Interfaces specially adapted for storage systems making use of a particular technique
- G06F3/0646—Horizontal data movement in storage systems, i.e. moving data in between storage devices or systems
- G06F3/0652—Erasing, e.g. deleting, data cleaning, moving of data to a wastebasket
Landscapes
- Engineering & Computer Science (AREA)
- Theoretical Computer Science (AREA)
- Physics & Mathematics (AREA)
- General Engineering & Computer Science (AREA)
- General Physics & Mathematics (AREA)
- Human Computer Interaction (AREA)
- Information Retrieval, Db Structures And Fs Structures Therefor (AREA)
Abstract
The invention belongs to the technical fields of power utilization information collection system, are related to concentrator more particularly to a kind of method carrying out parameter modification in concentrator.Including following effective procedure：A, variable is created in memory first；B, analysis instruction determines the relative displacement and the occupied total bytes of the parameter of changed parameter；C, chained list node is created, while the node is inserted into parameter and stores chained list, the one piece of an equal amount of memory headroom of byte quantity application occupied according to parameter；D, the new parameter after parameter modification is written in the memory headroom of application；E, the data in parameter storage chained list are synchronous with the data of new parameter in the memory headroom of application, that is, complete the modification of concentrator parameter.The present invention is by providing a kind of method carrying out parameter modification in concentrator, and relative to traditional amending method, the present invention had both saved memory while having also improved transmission efficiency.
Description
Technical field
The invention belongs to the technical fields of power utilization information collection system, are related to concentrator, more particularly to one kind is in concentrator
The method for carrying out parameter modification.
Background technology
With the continuous propulsion that electric power information is transformed, usage amount of the concentrator in centralized meter-reading system is constantly increasing
It is long.There is up to tens kinds of all kinds of configuration parameters in concentrator, and exactly these all kinds of parameter co- controllings concentrator,
Make it according to the operation steady in a long-term of the intrinsic scheme of design.
But all parameters in concentrator are not unalterable, it is right according to actual external use environment
Its internal related parameter values dynamically change.Therefore how correct, effective modification manages these parameters and becomes extremely
It closes important.
The scheme of current general processing be Parameter File is created in external memory unit by file system, while
A parameter backup is done in memory.When needing to modify to parameter, first modifies to the backup parameter in memory, work as institute
After the completion of thering is the parameter to be changed to change in memory, the ginseng in the backup parameter Integral synchronous to external storage in memory
In number file.The advantages of such scheme is the characteristic for taking full advantage of memory, the drawbacks of changing and facilitate, is efficient, while bringing
It is exactly that memory overhead is bigger, with the increase of parameter type, the expense of memory also increases as, the production for embedded system
For product, the increase of hardware resource, especially memory size, it is meant that the raising of product cost is unfavorable for promoting the city of product
Field competitiveness.
Invention content
The present invention bigger, skill of high cost for leading to market competition force difference for above-mentioned concentrator parameter modification memory overhead
Art problem proposes that a kind of method is simple, modification is convenient, efficient and one kind few memory consumption carries out parameter in concentrator and repaiies
The method changed.
In order to achieve the above object, the technical solution adopted by the present invention is that the present invention provides one kind and carried out in concentrator
The method of parameter modification, including following effective procedure：
A, variable is created in memory first：Parameter storage organization body, parameter storage organization body pointer, node structure body,
Parameter stores chained list, wherein the parameter storage organization body is the concentrator all parameters to be stored；The parameter storage knot
Structure body pointer is the pointer variable that parameter storage organization body defines；The node structure body is for defining each node institute in chained list
Including members element；The parameter storage chained list is used for transmitting the parameter for needing to store；
B, analysis instruction determines the relative displacement and the occupied total bytes of the parameter of changed parameter；
C, chained list node is created, while the node is inserted into parameter and stores chained list, the byte quantity occupied according to parameter
Apply for one piece of an equal amount of memory headroom；
D, the new parameter after parameter modification is written in the memory headroom of application；
E, the data in parameter storage chained list are synchronous with the data of new parameter in the memory headroom of application, that is, complete collection
The modification of middle device parameter.
Preferably, in a steps, the node structure body includes sequential value, itself control block, wherein the sequence
Used in train value is sorted in chained list for each node, itself control block is for the control block address pointed by present node.
Preferably, in a steps, the parameter storage chained list includes number of nodes, chained list head pointer and chain
Table node pointer, wherein the number of nodes is used to count the total quantity of chained list interior joint；The chained list head pointer is for referring to
To the address of chained list start node, first node location is conveniently found in chain table search；The chained list node pointer is used for
It is directed toward the address of chained list node.
Preferably, in the b step, concrete operations are as follows：After concentrator receives the instruction of parameter modification, solve first
Precipitation currently needs design parameter x to be changed, then determines parameter by the parameter storage organization body pointer defined in step a
Relative displacements of the x in structure, the offset=addresses parameter x -1 address of parameter；Next determines that parameter x is stored in parameter
Occupied total amount of byte amount m in structure.
Preferably, in the step c, concrete operations are as follows：
C1, according to step a interior joint structures create node variable pointer, while the pointer be directed toward one piece newly apply it is interior
It deposits, the offset determined in step b is assigned to sequential value, that is, node variable pointer->Sequential value=offset；
C2, according to the occupied byte quantity m of the parameter x calculated in step b, an equal amount of memory of one piece of application is empty
Between, with season node variable pointer->Itself control block is directed toward this memory headroom；
C3, the node newly created is inserted into parameter storage chained list, due to being possible to can once become more in step b
Parameter, therefore the connection of multiple nodes is likely to be in parameter storage chained list, when a new node is inserted into existing structure
When in chain, the company between each node can be carried out by ascending order according to the sequential value of newly-increased node and the sequential value of existing node
It connects, while the number of nodes in parameter storage chained list adds one.
Preferably, in the step e, concrete operations are as follows：
E1, it determines in parameter storage chained list with the presence or absence of the newer parameter of needs, that is, judge that parameter stores chained list->Node
Whether quantity is more than zero, enters e2 if more than zero；
E2, to the parameter backup in parameter storage space, the parameter in current parameter storage space according to existing
Sequence is all read out, and is temporarily stored in the memory space of one piece of safety；
The current parameter storage space of e3, erasing；
Parameter in e4, parameter storage space is written again, due in previous step all numbers in parameter storage space
According to erasing operation has all been carried out, parameter parameter stored in chained list and step e2 temporary memory spaces is needed to be written from new herein
Into parameter storage space, to realize the change of new parameter.
Preferably, the concrete operations of the e4 steps are as follows：
E4a, the sequential value that first node is taken out in chained list is stored from parameter, the sequential value known to step c1 is each need
Offset of the parameter to be changed in parameter storage organization body relative to parameter 1, therefore pass through first node known to the value
Storage location of the parameter value stored in parameter storage space；
E4b, temporary memory space bias internal amount it is 0 to all parameter read-ins between the offset of parameter 1 to parameter
In memory space；
E4c, the parameter of the offset of parameter 1 is deposited by being written to parameter after first node taking-up in parameter storage chained list
Store up in space, at the same record rest position that the parameter stores in memory space relative to 1 initial address of parameter relatively partially
Shifting amount；
E4d, the sequential value that next node is taken out in chained list is stored from parameter, that is, the relative displacement of parameter, interim
Memory space bias internal amount is relative displacement to all parameter read-ins between the offset of parameter 1 to parameter storage space
It is interior；
E4e, it is written to parameter storage sky after the parameter of the offset of parameter 1 is stored the node taking-up in chained list by parameter
In, while recording the relative displacement of rest position that the parameter stores in memory space relative to 1 initial address of parameter；
E4f, step e4d, e4e is repeated until all parameter synchronizations are finished.
Compared with prior art, the advantages and positive effects of the present invention are,
The present invention is by providing a kind of method carrying out parameter modification in concentrator, relative to traditional amending method,
Present invention eliminates the backup of parameter region in memory, save a large amount of memory source, once transmitted using the form of chained list
Multiple parameters to be changed had both saved memory while having also improved transmission efficiency, carried out data update in parameter storage space
When, parameter backup is first carried out, in the disposably extracting parameter data progress data update from backup area or chained list, was both improved
Efficiency also ensures the safety of data.
Specific implementation mode
To better understand the objects, features and advantages of the present invention, with reference to embodiment to this hair
It is bright to be described further.It should be noted that in the absence of conflict, the feature in embodiments herein and embodiment can
To be combined with each other.
Many details are elaborated in the following description to facilitate a thorough understanding of the present invention, still, the present invention may be used also
With using implementing different from other modes described here, therefore, the present invention is not limited to the specific of specification is described below
The limitation of embodiment.
Embodiment 1, the method that the present embodiment provides a kind of to carry out parameter modification in concentrator,
Concrete operations are as follows：
1) following variable is created in memory：
" parameter storage organization body " DLT_PARA,
" parameter storage organization body pointer " pstDltPara,
" node structure body " ListItem_t,
" parameter storage chained list " xParaStoreList,
Wherein " parameter storage organization body " contains the concentrator all parameters to be stored, and specific format is as follows：
For specific parameter y each of in structure, different knots can be defined respectively according to respective actual conditions
Structure physique formula, i.e., different supplemental characteristics build different structure formats.
" parameter storage organization body pointer " pstDltPara is the pointer defined by " parameter storage organization body " DLT_PARA
Variable carries out assignment according to the absolute physical address that parameter region actually distributes in parameter storage unit to the variable.
" node structure body " defines the members element that each node is included in chained list, specific as follows：
1. " sequential value " xItemValue is mainly used to used in each node sorts in chained list.
" 2. itself control block " pvOwner, the control block address pointed by present node
" parameter storage chained list " is the chained list variable created, is mainly used to transmit the parameter for needing to store comprising member such as
Under:
" number of nodes " uxNumberOfItems, the total quantity for counting chained list interior joint.
" chained list head pointer " pxIndex, the address for being directed toward chained list start node are conveniently found in chain table search
First node location.
" chained list node pointer " xListEnd, the address for being directed toward chained list node
Such as：" parameter storage organization body " DLT_PARA elements are as shown in table 1, there are five class parameters, respectively parameter A,
Parameter B, parameter C, parameter D, parameter E, wherein parameter A include three elements As 1, A2, A3, and each element accounts for a byte, then
Parameter A is total to occupy three byte address spaces, and parameter B includes six element Bs 1, B2, B3, B4, B5, B6, and each element accounts for
One byte, then parameter B is total occupies six byte address spaces, and parameter C includes four Elements Cs 1, C2, C3, C4, each
Element accounts for a byte, then parameter C is total occupies four byte address spaces, parameter D include five element D1, D2, D3,
D4, D5, each element account for a byte, then parameter D is total occupies five byte address spaces, and parameter E includes six elements
E1, E2, E3, E4, E5, E6, each element account for a byte, then parameter E is total occupies six byte address spaces, amounts to and occupies
24 bytes, it is assumed that parameter A1 is 0x80001000 in the address of amount of physical memory, then the actual physical storage of the terminal is empty
Between ranging from 0x80001000-0x80001018.
Table 1 " parameter storage organization body " DLT_PARA lists of elements
2) analysis instruction determines the relative displacement and the occupied total bytes of the parameter of changed parameter.
For example, after concentrator receives the instruction of parameter modification, it is parameter B and ginseng that parsing, which currently needs parameter to be changed,
Number D, then determines parameter B in structure by " parameter storage organization body pointer " pstDltPara defined in step 1)
Relative displacement, the offset=addresses parameter B1-addresses parameter A1,0x80001003-0x80001000=3, offset
The occupied total amount of byte amount of addr=3, parameter B is 6；Similarly, relative displacement the offset addr=13, parameter D of parameter D
Occupied total amount of byte amount is 5
3) chained list node xItem is created, while the node is inserted into " parameter storage chained list " xParaStoreList.
Node variable pointer xItem 3-1) is created according to " node structure body " in step 1), creates two sections in this example
Point variable pointer xItemB and xItemD.The offset addr determined in step 2) is assigned to " sequential value " xItemValue,
That is, xItemB->XItemValue=3, xItemD->XItemValue=13.
It is 3-2) 6 and 5 according to calculated parameter B in step 2) and the occupied byte quantities of parameter D, therefore applies for two
Block memory headroom, byte quantity is respectively 6 bytes and 5 bytes, with season xItemB->The memory that pvOwner is directed toward 6 bytes is empty
Between, xItemD->PvOwner is directed toward the memory headroom of 5 bytes.
3-3) node xItemB and xItemD that newly create are inserted respectively into " parameter storage chained list "
In xParaStoreList.According to " sequence during being inserted into node toward chained list xParaStoreList
The value of value " xItemValue carries out ascending order arrangement, that is, node xItemB " joins simultaneously before node xItemD
" number of nodes " uxNumberOfItems in number storage chained list " xParaStoreList adds two.
4) the new parameter after parameter B and parameter D changes, i.e. B1, B2, B3, B4, B5, B6 and D1, D2, D3, D4, D5
New content is respectively written into step 3-2) in apllied xItemB->PvOwner and xItemD->In the spaces pvOwner.
5) data in " parameter storage chained list " xParaStoreList are synchronous with data in parameter storage space.
It 5-1) determines in " parameter storage chained list " xParaStoreList with the presence or absence of the newer parameter of needs, that is, judge
" number of nodes " xParaStoreList->UxNumberOfItems is greater than zero.Enter 5-2 if more than zero).
5-2) to the parameter backup in parameter storage space.The parameter in current parameter storage space according to existing
Sequence is all read out, and is temporarily stored in the memory space of one piece of safety.
5-3) wipe current parameter storage space.
5-4) parameter in parameter storage space is written again.By in previous step 5-3) in the institute in parameter storage space
There are data all to carry out erasing operation, needed herein " parameter storage chained list " xParaStoreList and step 5-2) it deposits temporarily
Parameter in storage space is written to from newly in parameter storage space, to realize the change of new parameter.Detailed process is as follows：
1. " sequential value " xItemValue of node is taken out from " parameter storage chained list " xParaStoreList, by step
First node known to 3-1) is xItemB, xItemB->XItemValue values are 3, and second node is xItemD,
xItemD->XItemValue values are 13.Due to " sequential value " xItemValue be it is each need to parameter to be changed " parameter is deposited
Offset in storage structure body " relative to parameter 1, therefore can know the actual storage locations of parameter B and parameter D.
2. being 0 to 2 (xItemB- temporary memory space bias internal amount>Gained after the value of xItemValue subtracts one) between
All parameter read-ins to parameter storage space in.
3. node xItemB->The data content that pvOwner is stored is by " parameter storage chained list "
It is taken out in xParaStoreList, i.e. the data content of B1, B2, B3, B4, B5, B6, by xItemB->
The position of xItemValue values 3 starts to be written in parameter storage space, amounts to and 6 address spaces (element of parameter B is written
Number records the opposite offset of rest position that parameter B is stored in memory space relative to parameter A initial addresses for 6)
Measure addr '=xItemB->XItemValue+6 (the byte total number of parameter B), i.e. addr '=9.
4. due to second node xItemD->XItemValue values are 13, then are 9 temporary memory space bias internal amount
In (by previous step 3. last calculated offset address value) to all parameter read-ins to parameter storage space 13.
5. repeating the process of step 3. node xItemD->The data content that pvOwner is stored is by " parameter storage chains
It is taken out in table " xParaStoreList, i.e. the data content of D1, D2, D3, D4, D5, by xItemD->XItemValue values 13
It sets and starts to be written in parameter storage space, while recording rest position that parameter D is stored in memory space relative to ginseng
The relative displacement addr ' of number A initial addresses=
xItemD->XItemValue+5 (the byte total number of parameter D), i.e. addr '=18.
6. repeating step 4. in temporary space memory space in remaining whole parameter read-ins to parameter storage space.
The above described is only a preferred embodiment of the present invention, being not that the invention has other forms of limitations, appoint
What those skilled in the art changed or be modified as possibly also with the technology contents of the disclosure above equivalent variations etc.
It imitates embodiment and is applied to other fields, but it is every without departing from technical solution of the present invention content, according to the technical essence of the invention
To any simple modification, equivalent variations and remodeling made by above example, the protection domain of technical solution of the present invention is still fallen within.
Claims (7)
1. a kind of method carrying out parameter modification in concentrator, which is characterized in that including following effective procedure：
A, variable is created in memory first：Parameter storage organization body, parameter storage organization body pointer, node structure body, parameter
Store chained list, wherein the parameter storage organization body is the concentrator all parameters to be stored；The parameter storage organization body
Pointer is the pointer variable that parameter storage organization body defines；The node structure body is used to define each node in chained list
Members element；The parameter storage chained list is used for transmitting the parameter for needing to store；
B, analysis instruction determines the relative displacement and the occupied total bytes of the parameter of changed parameter；
C, chained list node is created, while the node is inserted into parameter and stores chained list, the byte quantity application occupied according to parameter
One piece of an equal amount of memory headroom；
D, the new parameter after parameter modification is written in the memory headroom of application；
E, the data in parameter storage chained list are synchronous with the data of new parameter in the memory headroom of application, that is, complete concentrator
The modification of parameter.
2. a kind of method carrying out parameter modification in concentrator according to claim 1, which is characterized in that a steps
In rapid, the node structure body includes sequential value, itself control block, wherein the sequential value is arranged for each node in chained list
Used in sequence, itself control block is for the control block address pointed by present node.
3. a kind of method carrying out parameter modification in concentrator according to claim 2, which is characterized in that a steps
In rapid, the parameter storage chained list includes number of nodes, chained list head pointer and chained list node pointer, wherein the node
Quantity is used to count the total quantity of chained list interior joint；The chained list head pointer is used to be directed toward the address of chained list start node,
First node location is conveniently found when chain table search；The chained list node pointer is used to be directed toward the address of chained list node.
4. a kind of method carrying out parameter modification in concentrator according to claim 3, which is characterized in that the b steps
In rapid, concrete operations are as follows：After concentrator receives the instruction of parameter modification, parsing first currently needs specific ginseng to be changed
Number x, then determines relative displacements of the parameter x in structure by the parameter storage organization body pointer defined in step a,
Offset=the addresses parameter x -1 address of parameter；Next determines parameter x occupied total amount of byte in parameter storage organization body
Measure m.
5. a kind of method carrying out parameter modification in concentrator according to claim 4, which is characterized in that the c steps
In rapid, concrete operations are as follows：
C1, node variable pointer is created according to step a interior joint structures, while the pointer is directed toward one piece of memory newly applied,
The offset determined in step b is assigned to sequential value, that is, node variable pointer->Sequential value=offset；
C2, according to the occupied byte quantity m of the parameter x calculated in step b, apply for one piece of an equal amount of memory headroom, together
Seasonal node variable pointer->Itself control block is directed toward this memory headroom；
C3, the node newly created is inserted into parameter storage chained list, due to being possible to can once become more ginsengs in step b
Number, therefore the connection of multiple nodes is likely to be in parameter storage chained list, when a new node is inserted into existing structural chain
When middle, the connection between each node can be carried out by ascending order according to the sequential value of newly-increased node and the sequential value of existing node,
Number of nodes in the chained list of parameter storage simultaneously adds one.
6. a kind of method carrying out parameter modification in concentrator according to claim 5, which is characterized in that the e steps
In rapid, concrete operations are as follows：
E1, it determines in parameter storage chained list with the presence or absence of the newer parameter of needs, that is, judge that parameter stores chained list->Number of nodes
Whether it is more than zero, enters e2 if more than zero；
E2, to the parameter backup in parameter storage space, the parameter in current parameter storage space according to existing sequence
It all reads out, is temporarily stored in the memory space of one piece of safety；
The current parameter storage space of e3, erasing；
Parameter in e4, parameter storage space is written again, due in previous step all data in parameter storage space all
Erasing operation has been carried out, the parameter in parameter storage chained list and step e2 temporary memory spaces is needed to be written to ginseng from newly herein
In number memory space, to realize the change of new parameter.
7. a kind of method carrying out parameter modification in concentrator according to claim 6, which is characterized in that the e4 steps
Rapid concrete operations are as follows：
E4a, the sequential value for taking out first node in chained list is stored from parameter, be each to need to become by sequential value known to step c1
Offset of the parameter more in parameter storage organization body relative to parameter 1, therefore deposited by first node known to the value
Storage location of the parameter value of storage in parameter storage space；
E4b, all parameter read-ins of the temporary memory space bias internal amount between 0 to parameter 1 offset are stored to parameter
In space；
E4c, it is written to parameter storage sky after the parameter of the offset of parameter 1 is taken out by first node in parameter storage chained list
In, while recording the relative displacement of rest position that the parameter stores in memory space relative to 1 initial address of parameter；
E4d, the sequential value that next node is taken out in chained list is stored from parameter, that is, the relative displacement of parameter, interim storage
Space bias internal amount is in relative displacement to all parameter read-ins to parameter storage space between the offset of parameter 1；
E4e, it is written to parameter storage space after the parameter of the offset of parameter 1 is stored the node taking-up in chained list by parameter
It is interior, while recording the relative displacement of rest position that the parameter stores in memory space relative to 1 initial address of parameter；
E4f, step e4d, e4e is repeated until all parameter synchronizations are finished.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201810467697.1A CN108647154A (en) | 2018-05-14 | 2018-05-14 | A method of carrying out parameter modification in concentrator |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201810467697.1A CN108647154A (en) | 2018-05-14 | 2018-05-14 | A method of carrying out parameter modification in concentrator |
Publications (1)
| Publication Number | Publication Date |
|---|---|
| CN108647154A true CN108647154A (en) | 2018-10-12 |
Family
ID=63756101
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201810467697.1A Pending CN108647154A (en) | 2018-05-14 | 2018-05-14 | A method of carrying out parameter modification in concentrator |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN108647154A (en) |
Cited By (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN110489439A (en) * | 2019-09-12 | 2019-11-22 | 宁波三星医疗电气股份有限公司 | A kind of parameter processing method and electric power terminal |
Citations (6)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| EP1691296A2 (en) * | 1997-10-03 | 2006-08-16 | Matsushita Electric Industrial Co., Ltd. | Memory interface device and memory address generation device |
| CN101419571A (en) * | 2008-12-04 | 2009-04-29 | 上海大学 | Method for storing configuration parameter in NOR FLASH based on Hash arithmetic |
| CN102629221A (en) * | 2012-02-28 | 2012-08-08 | 华为技术有限公司 | Task synchronization method, device and system for distributed shared memory structure |
| CN103996003A (en) * | 2014-05-20 | 2014-08-20 | 金航数码科技有限责任公司 | Data wiping system in virtualization environment and method thereof |
| CN107168680A (en) * | 2016-03-07 | 2017-09-15 | 卡雷公司 | Atomic instructions with the subrange for being confined to intermediate cache rank |
| CN107729972A (en) * | 2017-09-01 | 2018-02-23 | 捷德（中国）信息科技有限公司 | A kind of data guard method of intellective IC card |
-
2018
- 2018-05-14 CN CN201810467697.1A patent/CN108647154A/en active Pending
Patent Citations (6)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| EP1691296A2 (en) * | 1997-10-03 | 2006-08-16 | Matsushita Electric Industrial Co., Ltd. | Memory interface device and memory address generation device |
| CN101419571A (en) * | 2008-12-04 | 2009-04-29 | 上海大学 | Method for storing configuration parameter in NOR FLASH based on Hash arithmetic |
| CN102629221A (en) * | 2012-02-28 | 2012-08-08 | 华为技术有限公司 | Task synchronization method, device and system for distributed shared memory structure |
| CN103996003A (en) * | 2014-05-20 | 2014-08-20 | 金航数码科技有限责任公司 | Data wiping system in virtualization environment and method thereof |
| CN107168680A (en) * | 2016-03-07 | 2017-09-15 | 卡雷公司 | Atomic instructions with the subrange for being confined to intermediate cache rank |
| CN107729972A (en) * | 2017-09-01 | 2018-02-23 | 捷德（中国）信息科技有限公司 | A kind of data guard method of intellective IC card |
Non-Patent Citations (1)
| Title |
|---|
| 蒋静远: "基于数据通道的非结构化数据多存储系统", 《中国优秀硕士学位论文全文数据库 信息科技辑》 * |
Cited By (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN110489439A (en) * | 2019-09-12 | 2019-11-22 | 宁波三星医疗电气股份有限公司 | A kind of parameter processing method and electric power terminal |
| CN110489439B (en) * | 2019-09-12 | 2022-09-20 | 宁波三星医疗电气股份有限公司 | Parameter processing method and power terminal |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN107688999B (en) | Block chain-based parallel transaction execution method | |
| KR960012993B1 (en) | Apparatus for transmitting data | |
| CN104778203B (en) | Take the storage of load record block index and querying method in control intelligent electric energy meter | |
| CN108205577A (en) | A kind of array structure, the method, apparatus and electronic equipment of array inquiry | |
| CN103853499B (en) | Multi-source data storing and reading method | |
| CN101840430A (en) | Intelligent card database multi-list operation method and device | |
| CN109542911A (en) | A kind of metadata organization method, system, equipment and computer readable storage medium | |
| CN108647154A (en) | A method of carrying out parameter modification in concentrator | |
| CN110191156A (en) | A kind of data processing method and device based on block chain | |
| CN102279729B (en) | Method, buffer and processor for dynamic reconfigurable array to schedule configuration information | |
| CN107256132A (en) | A kind of isomery Redis cluster-based storage distribution methods based on performance test | |
| CN102520902B (en) | Parallel write-in multi-FIFO (first in, first out) implementation method based on single chip block RAM (random access memory) | |
| CN102591787A (en) | Method and device for data processing of JAVA card | |
| CN108228606A (en) | The wiring method and device of data | |
| CN106294461A (en) | Data lead-in method and device | |
| CN105468539B (en) | A kind of implementation method of mixing memory write operation | |
| CN106227673A (en) | A kind of sequence waveform synthetic method based on DMA | |
| CN104268225B (en) | A kind of file system architecture and its generation and access mode of the addressing of the multidimensional free degree | |
| CN106372002A (en) | Data storage method and data reading and restoring method | |
| CN105550254A (en) | Method for automatically generating ICD (Interface Control Document) information database by ICD information | |
| CN107704208A (en) | A kind of restorative procedure of metadata, device and medium | |
| CN104424123B (en) | One kind is without lock data buffer zone and its application method | |
| CN104699414B (en) | A kind of data read-write method and storage device | |
| CN108280028B (en) | Method for realizing load record of intelligent electric energy meter based on dynamic allocation | |
| CN105391590A (en) | Method and system for automatically obtaining system routing table of NUMA |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| PB01 | Publication | ||
| PB01 | Publication | ||
| SE01 | Entry into force of request for substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| RJ01 | Rejection of invention patent application after publication | ||
| RJ01 | Rejection of invention patent application after publication |
Application publication date: 20181012 |