CN115955319A - Data set generation system - Google Patents
Data set generation system Download PDFInfo
- Publication number
- CN115955319A CN115955319A CN202310243009.4A CN202310243009A CN115955319A CN 115955319 A CN115955319 A CN 115955319A CN 202310243009 A CN202310243009 A CN 202310243009A CN 115955319 A CN115955319 A CN 115955319A
- Authority
- CN
- China
- Prior art keywords
- production
- node
- information
- key
- array
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Granted
Links
- 238000004519 manufacturing process Methods 0.000 claims abstract description 192
- 230000004044 response Effects 0.000 claims abstract description 25
- 238000000034 method Methods 0.000 claims abstract description 19
- 239000013598 vector Substances 0.000 claims description 15
- 238000004140 cleaning Methods 0.000 claims description 12
- 230000008569 process Effects 0.000 claims description 12
- 238000005538 encapsulation Methods 0.000 claims description 7
- 238000003825 pressing Methods 0.000 claims description 3
- 238000004891 communication Methods 0.000 abstract description 7
- 230000001364 causal effect Effects 0.000 description 6
- 238000005516 engineering process Methods 0.000 description 5
- 238000013473 artificial intelligence Methods 0.000 description 4
- 230000009471 action Effects 0.000 description 3
- 230000008878 coupling Effects 0.000 description 3
- 238000010168 coupling process Methods 0.000 description 3
- 238000005859 coupling reaction Methods 0.000 description 3
- 238000010586 diagram Methods 0.000 description 2
- 230000004048 modification Effects 0.000 description 2
- 238000012986 modification Methods 0.000 description 2
- 230000006872 improvement Effects 0.000 description 1
- 238000004806 packaging method and process Methods 0.000 description 1
Images
Classifications
-
- Y—GENERAL TAGGING OF NEW TECHNOLOGICAL DEVELOPMENTS; GENERAL TAGGING OF CROSS-SECTIONAL TECHNOLOGIES SPANNING OVER SEVERAL SECTIONS OF THE IPC; TECHNICAL SUBJECTS COVERED BY FORMER USPC CROSS-REFERENCE ART COLLECTIONS [XRACs] AND DIGESTS
- Y02—TECHNOLOGIES OR APPLICATIONS FOR MITIGATION OR ADAPTATION AGAINST CLIMATE CHANGE
- Y02P—CLIMATE CHANGE MITIGATION TECHNOLOGIES IN THE PRODUCTION OR PROCESSING OF GOODS
- Y02P90/00—Enabling technologies with a potential contribution to greenhouse gas [GHG] emissions mitigation
- Y02P90/30—Computing systems specially adapted for manufacturing
Landscapes
- Management, Administration, Business Operations System, And Electronic Commerce (AREA)
Abstract
The application relates to the technical field of block chains, and provides a data set generation system, which comprises a plurality of production nodes and at least one scheduling node, wherein the production nodes and the scheduling node are in communication connection, and the scheduling node is used for sending broadcast information to the production nodes according to a production task so as to search for idle production nodes required by the completion of the production task; the idle production node is used for sending a response message to the scheduling node when the idle production node is the idle production node required by the production task; the scheduling node is used for determining a target production node according to the response message; the scheduling node and the target production node are used for jointly encapsulating the block chain data; the blockchain data includes founder blocks and production blocks. The method has the advantages of strong relevance among data and high data credibility.
Description
Technical Field
The present application relates to the field of blockchain technology, and in particular, to a data set generation system.
Background
The progress of big data and artificial intelligence technology makes the production and manufacture intelligentized possible, and sufficient basic data is one of the important prerequisites that big data algorithm and artificial intelligence algorithm can operate effectively. When big data and artificial intelligence are applied to the production and manufacturing field, the predicted value of the model is often seriously deviated from the actual value due to the incredibility of the data input into the model, thereby causing production accidents.
Blockchain technology is considered to be an emerging technology that can make data operations non-repudiatable and non-falsifiable, and researchers have developed various platforms using blockchain technology to obtain trusted underlying data. The mainstream method is to construct a block chain platform with a plurality of high-performance devices serving as block chain nodes, then send basic data to the block chain platform by a service system, and package the data into a block chain data structure managed by the platform by the block chain platform, wherein only the data processed and packaged by the block chain platform is trusted data. The method has the advantages that the system deployment is simple, a plurality of business systems can be simultaneously served only by deploying one set of block chain platform, and the efficiency is high. However, the biggest problem of such an architecture is that basic data are scattered in each block without logical association, and a large data platform and an artificial intelligence platform cannot acquire the basic data with causal association.
Based on the above problems, no effective solution exists at present.
Disclosure of Invention
The invention aims to provide a data set generation system, which adopts a block chain and a multiple signature mode to ensure that each generated vector data has strict causal relationship and improve the relevance and credibility of the data.
The application provides a data set generation system, which comprises a plurality of production nodes and at least one scheduling node, wherein each production node is in communication connection with each scheduling node, and the scheduling node is used for sending broadcast information to each production node according to a production task so as to find out an idle production node required by the completion of the production task; the idle production node is used for sending a response message to the scheduling node when the idle production node is the idle production node required by the production task; the scheduling node is used for determining a target production node according to the response message; the scheduling node and the target production node are used for jointly encapsulating the block chain data; the blockchain data includes founder blocks and production blocks.
According to the data set generation system, the scheduling node and the production node jointly package block chain data, and through the method, each generated data is guaranteed to have a strict causal relationship, the relevance of the data is improved, and meanwhile the redundancy is reduced.
Optionally, in the data set generating system provided by the application, when the scheduling node sends broadcast information to each of the production nodes to find an idle production node required to complete the production task, the scheduling node executes the following steps:
s1, acquiring the production task, current time information, a second public key of the production task, and a second private key of the production task;
s2, determining array information according to the production task; the array information records equipment type information of production nodes required by each process of the production task;
s3, signing the current time information, the second public key and the array information by using the second private key to generate second signature information;
and S4, generating the broadcast information according to the array information, the current time information, the second public key and the second signature information, and sending the broadcast information to each production node.
In this way, the scheduling node can determine the number of production tasks and the type of production node in each production process, and broadcast the number of production tasks and the type of production node to the production nodes.
Optionally, in the data set generation system provided by the present application, the array information includes a plurality of second elements, and the second elements include device types; the production node is further configured to:
when the self receives the broadcast information, the broadcast information is verified, and if the second signature information is respectively matched with the array information and the current time information and the second public key, the following steps are executed:
A1. acquiring a first private key and a first public key of the device, and traversing the array information to determine whether the array information records equipment type information matched with the production node;
A2. when the array information records equipment type information matched with the production node, recording the serial number and the equipment type of the second element, and acquiring first time information when the broadcast information is received;
A3. signing the first time information, the first public key, the serial number of the second element and the device type by using the first private key to generate first signature information;
A4. generating the response message according to the first time information, the first public key, the sequence number of the second element, the device type and the first signature information, and sending the response message to the scheduling node;
and if the second signature information is not matched with one of the array information and the current time information and the second public key, ignoring the broadcast information.
In this way, it is possible to find out a satisfactory free production node and to cause the satisfactory free production node to send a reply message to the scheduling node.
Optionally, in the data set generating system provided by the present application, when determining the target production node according to the response message, the scheduling node performs the following steps:
B1. generating a dynamic array according to the response message; the dynamic array comprises N first elements, wherein N is the number of process channels of the production task;
B2. generating corresponding key value pairs according to the first time information, the first public key, the serial number of the second element, the equipment type and the first signature information in each response message, pressing each key value pair into the corresponding first element in the dynamic array, and cleaning the key value pairs in each first element of the dynamic array according to the value of the key value pair;
B3. and determining a target production node according to the cleaned dynamic array.
Optionally, in the data set generation system provided by the application, the step of cleaning the key-value pairs in the first elements of the dynamic array according to the key-value pair values includes:
B201. acquiring the serial number, the equipment type and the first time information of the second element of each key value pair;
B202. dividing the key value pairs with the same serial number of the second element and the same equipment type into the same key value pair group to be deleted;
B203. and acquiring first time information of each key value pair in the key value pair group to be deleted aiming at each key value pair group to be deleted, and deleting the key value pairs except the key value pair corresponding to the minimum first time information.
By the online data cleaning mode, the original data is cleaned while being generated, and the data after the data generation is the cleaned data, so that the efficiency is high.
Optionally, in the data set generating system provided by the present application, the founder block is encapsulated by the scheduling node.
Optionally, in the data set generation system provided by the present application, when the scheduling node encapsulates the founding block, the following steps are performed:
C1. obtaining a production parameter vector of each target production node;
C2. filling the production parameter vectors into the corresponding key value pairs, recording the current time, and recording as a first current time;
C3. writing the dynamic array and the first current time into a data field of the created block, signing the data field by using the second private key, and writing the signed field into a signature field of the created block;
C4. and carrying out whole-network broadcasting on the created blocks.
Optionally, in the data set generation system provided by the present application, when receiving the created block, the target production node is further configured to confirm the credibility of the created block according to the second public key.
Optionally, in the data set generation system provided by the application, if the created block is a trusted block, the target production node is further configured to determine whether the target production node is an encapsulation node of the trusted block according to the first public key.
Optionally, in the data set generation system provided by the present application, the production block is encapsulated by the scheduling node and the selected production node; and the selected production node is an encapsulation node of the credible block.
According to the data set generation system, the scheduling node adopts an online data cleaning mode in the process of determining the target production node according to the response message, so that the cleaning operation is simultaneously performed in the process of generating original data, the generated data is cleaned data, and the data generation efficiency is improved; in the process of jointly encapsulating the blocks, the scheduling node and the production node adopt a multi-signature mode to ensure that each generated data has a strict causal relationship, so that the relevance of the data is improved and the redundancy is reduced.
In summary, the data set generation system of the present application ensures that each generated data has a strict causal relationship through online data cleaning, block chaining, and multiple signatures, improves the relevance of the data, and reduces the redundancy of the data.
Drawings
Fig. 1 is an overall topology structure diagram of a data set generation system provided in the present application.
Description of the reference symbols:
100. scheduling nodes; 200. and (6) producing nodes.
Detailed Description
The technical solutions in the embodiments of the present application will be clearly and completely described below with reference to the drawings in the embodiments of the present application, and it is obvious that the described embodiments are only a part of the embodiments of the present application, and not all of the embodiments. The components of the embodiments of the present application, as generally described and illustrated in the figures herein, could be arranged and designed in a wide variety of different configurations. Thus, the following detailed description of the embodiments of the present application, as presented in the figures, is not intended to limit the scope of the claimed application, but is merely representative of selected embodiments of the application. All other embodiments, which can be obtained by a person skilled in the art without making creative efforts based on the embodiments of the present application, belong to the protection scope of the present application.
It should be noted that: like reference numbers and letters refer to like items in the following figures, and thus, once an item is defined in one figure, it need not be further defined and explained in subsequent figures. Meanwhile, in the description of the present application, the terms "first", "second", and the like are used only for distinguishing the description, and are not construed as indicating or implying relative importance.
Referring to fig. 1, fig. 1 is an overall topology structure diagram of a data set generating system according to some embodiments of the present application, where each production node 200 is in communication connection with each scheduling node 100, and the scheduling node 100 is configured to send broadcast information to each production node 200 according to a production task to find a free production node required for completing the production task; the idle production node is used for sending a response message to the scheduling node 100 when the idle production node is required for completing the production task; the scheduling node 100 is configured to determine a target production node according to the response message; the scheduling node 100 and the target production node are used for jointly encapsulating the blockchain data; the blockchain data includes founder blocks and production blocks.
All the devices in the intelligent factory are divided into two types, one type is a device responsible for production and is marked as a production node 200, and the other type is a device responsible for scheduling and allocating resources and is marked as a scheduling node 100. The scheduling node 100 may be in communication connection with an existing cloud server, and the production task may be sent to the scheduling node 100 by the cloud server.
In a further embodiment, the scheduling node 100, when sending broadcast information to each production node 200 to find a free production node 200 needed to complete a production task, performs the following steps:
s1, acquiring a production task, current time information, a second public key of the production task, and a second private key of the production task;
s2, determining array information according to the production task; the array information records equipment type information of production nodes required by each process of the production task;
s3, signing the current time information, the second public key and the array information by using a second private key to generate second signature information;
and S4, generating broadcast information according to the array information, the current time information, the second public key and the second signature information, and sending the broadcast information to each production node 200.
In step S1, schedulingThe node 100 divides the production task into N production processes, wherein N is a preset positive integer; the second public key of the scheduling node 100 is denoted as
And the second private key is recorded as +>
(ii) a The current time information (i.e., the current time information) is denoted as T. Wherein, the current time information, the second public key and the second private key are obtained in the prior art, and the judgment result is based on the current time information, the second public key and the second private key>
Representing the scheduling node 100.
In step S2, the array information is recorded as S, and the array information comprises a plurality of second elements
The number of the elements of the array information is N, and is greater than or equal to N>
。/>
Representing the th in array information S>
Element that holds the ^ th ^ or ^ th ^>
The set of equipment types for all production nodes 200 required on a production run.
In step S3, based on the existing signature algorithm, the scheduling node 100 uses its second private key
Log group information S, current time T and second public key +>
Signing and generating second signature information>
。
In step S4, the array information, the current time information, the second public key, and the second signature information are integrated into a first tuple, which is denoted as (S, T,
，/>
) Then, broadcast information is generated according to the first tuple, and the broadcast information is broadcasted and transmitted to each production node 200.
In this manner, scheduling node 100 may be enabled to determine the number of steps of a production job and the type of production node 200 on each production step and broadcast to production nodes 200.
In a further embodiment, the array information includes a plurality of second elements, the second elements including a device type; the production node 200 is also used to:
when the self receives the broadcast information, the broadcast information is verified, and if the second signature information is respectively matched with the array information and the current time information and the second public key, the following steps are executed:
A1. acquiring a first private key and a first public key of the device, and traversing array information to determine whether the array information records equipment type information matched with the production node;
A2. when the equipment type information matched with the production node is recorded in the group information, recording the serial number and the equipment type of the second element, and acquiring first time information when the broadcast information is received;
A3. signing the first time information, the first public key, the sequence number of the second element and the device type by using a first private key to generate first signature information;
A4. generating a response message according to the first time information, the first public key, the sequence number of the second element, the device type and the first signature information, and sending the response message to the scheduling node 100;
and if the second signature information and one of the group information and the current time information are not matched with the second public key, ignoring the broadcast information.
In practical applications, when the production node 200 receives the broadcast message from the scheduling node 100, i.e. the first tuple (S, T,
，/>
) Then, the existing signature algorithm is used to verify whether the second signature information in the first tuple is respectively matched with the tuple information and the current time information and the second public key, that is, the judgment on whether the second signature information is greater or smaller than the preset value is made>
Whether or not to be compared with the array information S, the current time information T and the second public key->
Matching, if so, executing the step A1-the step A4; and if the second signature information and one of the group information and the current time information are not matched with the second public key, ignoring the broadcast information.
In step A1, the production node 200 first obtains its own first private key and first public key, and takes the first private key as pri and the first public key as pri
(ii) a Then all second pixels S [ -on the array information S are traversed>
]And all device types if a certain second element S [, is>
]Having associated therewith second signature information>
If the device type is matched, the second element number is recorded>
And device type->
。
In step A2, acquiring the first time information is prior art, and recording the first time information as
。
In step A3, the idle production node 200 signs the first time information, the first public key, the serial number of the second element, and the device type using the first private key pri, that is, pair
，/>
，/>
，/>
) And performing signature to generate first signature information sig.
In step A4, a second tuple is generated according to the first time information, the first public key, the second element sequence number, the device type, and the first signature information, and is denoted as: (
，/>
，/>
Sig) and then generates a response message from the second tuple to dispatch node 100.
In this way, it is possible to find out a satisfactory free production node 200 and to cause the satisfactory free production node 200 to send a reply message to the scheduling node 100.
In a further embodiment, the scheduling node 100, when determining the target production node from the reply message, performs the following steps:
B1. generating a dynamic array according to the response message; the dynamic array comprises N first elements, wherein N is the number of process channels of the production task;
B2. generating corresponding key value pairs according to the first time information, the first public key, the serial number of the second element, the equipment type and the first signature information in each response message, pressing each key value pair into the corresponding first element in the dynamic array, and cleaning the key value pairs in each first element of the dynamic array according to the key value pairs;
B3. and determining a target production node according to the cleaned dynamic array.
In step B1, the scheduling node 100 receives M response messages, determines a dynamic array P according to the response messages, where the dynamic array P includes a plurality of first elements, the number of the first elements is also N,
represents the ^ th or greater of the dynamic array P>
A first element which holds a ^ th ^ or ^ th ^>
The index of each production parameter vector of the production parameter vectors of all the production nodes 200 of the process is the first public key of the corresponding production node 200. Wherein it is present>
。
In step B2, the scheduling node 100 first traverses M response messages in the dynamic array, i.e. traverses M second tuples (M
，
，/>
，/>
Sig) and then rewritten to a "key-value pair"wherein the bond is `>
Value of (` based `)>
，/>
，/>
Sig) and pushes the key-value pair to the respective first element £ or @>
In which it stands or is located>
。
In step B3, the method for determining the target production node is the prior art, and is not described herein again.
In a further embodiment, the step of cleaning the key-value pairs in the first elements of the dynamic array according to the key-value pairs comprises:
B201. acquiring the serial number, the equipment type and the first time information of the second element of each key value pair;
B202. dividing key value pairs with the same serial number and equipment type of the second element into the same key value pair group to be deleted;
B203. and acquiring first time information of each key value pair in the key value pair group to be deleted aiming at each key value pair group to be deleted, and deleting the key value pairs except the key value pair corresponding to the minimum first time information.
In practical application, will (
,/>
) Field same but (@ v)>
Sig) field different keysThe value pairs are recorded as key value pairs to be deleted, and then the key value pairs are divided into the same key value pair group to be deleted; and then, according to the size of the first time information gamma, reserving the key value pair to be deleted corresponding to the minimum gamma, and deleting other key value pairs to be deleted.
Through the online data cleaning mode, the original data is cleaned while being generated, and the data after the data generation is finished is the cleaned data, so that the efficiency is high.
In some embodiments, scheduling node 100 and production node 200 are used to jointly encapsulate blockchain data. The scheduling node 100 first initializes the block array, denoted as
. Each block comprises a data field and a signature field, and the number of elements of the block is N +1. Wherein the first block is taken as the founder block->
And the rest blocks are used as production blocks.
In a further embodiment, the created block is encapsulated by the scheduling node 100.
Specifically, when encapsulating the created block, the scheduling node 100 performs the following steps:
C1. acquiring a production parameter vector of each target production node;
C2. filling the production parameter vectors into corresponding key value pairs, recording the current time, and recording as a first current time;
C3. writing the dynamic array and the first current moment into a data field of the creature block, signing the data field by using a second private key and writing the data field into a signature field of the creature block;
C4. and carrying out whole-network broadcasting on the created blocks.
In step C1, the scheduling node 100 obtains the production parameter vectors of all target production nodes in each production process according to the empirical values.
In step C2, the scheduling node 100 traverses the dynamic array, reads the key-value pair of each first element in the dynamic array, and for each keyA key of the value pair pub, writing the production parameter vector of the production node 200 corresponding to the pub into the value of the key value pair, and recording the production parameter vector as v, namely (v)
，/>
，/>
Sig) is overwritten as (@)>
，/>
，/>
Sig, v) and notes the first current time instant at this time ≥>
。
In step C3, the scheduling node 100 will assign the dynamic array P and the first current time
Write the data field of the founder block and then use its second private key @>
And writing the signed data field into the signature field of the created block.
In step C4, the scheduling node 100 performs a full-network broadcast on the processed created blocks, and sends the broadcast to each production node 200.
In a further embodiment, the target production node, upon receiving the created block, is further configured to verify the authenticity of the created block based on the second public key.
In practical applications, when the production node 200 receives the created block from the scheduling node 100, the number of non-empty elements in the created block is counted first, and the created block is used
Expressed as a th->
A non-empty element; then calls the first public key +>
Carrying out label checking operation on the data field and the signature field of each founding block in sequence, and if the label checking operation is passed, indicating that the founding block is credible; if the check label is not passed, the created block is not credible, and the block is discarded.
In a further embodiment, if the created block is a trusted block, the production node 200 is further configured to determine whether itself is an encapsulation node of the trusted block according to the first public key.
In practical applications, the production node 200 reads the founder block
The dynamic array of the inside->
First element of (2)
If the first element->
If the key in all the key value pairs does not contain the first public key of the production node 200, it means that the production node 200 itself is not an encapsulation node of the trusted block, and the created block is discarded. Otherwise, it indicates that the production node 200 is a packaging node of the trusted block, and at this time, the production node 200 reads the production parameter vector v in the "value" indexed by the "key" and performs production by using the production parameter vector as a reference value.
In a further embodiment, the production block is co-packaged by the scheduling node 100 and the selected production node; the selected production node is an encapsulation node of the credible block.
After the production node 200 completes production, the production node 200 needs to encapsulate sub-modules of the production block. Specifically, the production node 200 records the actual production parameter vector
Then generating a third triplet (
) And signs the third triplet using its first private key pri, generating a signature £ greater than or equal to>
And generates a fourth tuple (pick)>
,/>
,/>
,/>
) And then to the scheduling node 100. Wherein it is present>
Representing an array of blocks { (R })>
Is based on the fifth->
Hash value of an element->
Is the first public key of the production node 200.
The complete production block is then encapsulated by the scheduling node 100. Specifically, the scheduling node 100 reads the first element
All keys in the key pair are corresponding to the first public keyGather and wait for the fourth tuple (</or > is asserted by the production node 200 corresponding to all the first public keys>
, />
,/>
, />
) And the fourth tuples are packed into a new tuple G as elements, and the time instant at this time is recorded>
Then the array G and the time
Put into block array element>
And uses its second private key to->
Pair (G,/> -based on>
, 
) Signs and generates->
And then placed in the signature field. In this way, it is achieved that the scheduling node 100 and the production node 200 jointly encapsulate the production block.
As can be seen from the above, in the process of determining the target production node according to the response message, the scheduling node 100 implements, by using an online data cleaning manner, cleaning operations while generating original data in the process, so that the generated data is cleaned data, thereby improving the generation efficiency of the data; in the process of encapsulating the blocks together, the scheduling node 100 and the production node 200 adopt a multiple signature mode to ensure that each generated data has a strict causal relationship, so that the data relevance is improved and the redundancy is reduced.
In the embodiments provided in the present application, it should be understood that the disclosed system and method may be implemented in other ways. The above-described system embodiments are merely illustrative, and for example, the division of the units is merely a logical division, and there may be other divisions in actual implementation, and for example, a plurality of units or components may be combined or integrated into another system, or some features may be omitted, or not executed. In addition, the shown or discussed coupling or direct coupling or communication connection between each other may be through some communication interfaces, indirect coupling or communication connection of systems or units, and may be in an electrical, mechanical or other form.
In addition, units described as separate parts may or may not be physically separate, and parts displayed as units may or may not be physical units, may be located in one place, or may be distributed on a plurality of network units. Some or all of the units can be selected according to actual needs to achieve the purpose of the embodiment.
In addition, the functional modules in the embodiments of the present application may be integrated together to form an independent part, or each module may exist alone, or two or more modules may be integrated to form an independent part.
In this document, relational terms such as first and second, and the like may be used solely to distinguish one entity or action from another entity or action without necessarily requiring or implying any actual such relationship or order between such entities or actions.
The above description is only an embodiment of the present application and is not intended to limit the scope of the present application, and various modifications and changes may be made by those skilled in the art. Any modification, equivalent replacement, or improvement made within the spirit and principle of the present application shall be included in the protection scope of the present application.
Claims (10)
1. A data set generating system comprising a plurality of production nodes (200) and at least one scheduling node (100), wherein each of said production nodes (200) is communicatively coupled to each of said scheduling nodes (100), and wherein said scheduling node (100) is configured to send broadcast information to each of said production nodes (200) based on a production task to find a free production node required to complete said production task; the idle production node is used for sending a response message to the scheduling node (100) when the idle production node is the idle production node required by the production task; the scheduling node (100) is used for determining a target production node according to the response message; the scheduling node (100) and the target production node are configured to jointly encapsulate blockchain data; the blockchain data includes founder blocks and production blocks.
2. The data set generation system of claim 1, wherein the scheduling node (100), when sending broadcast information to each of the production nodes (200) to find free production nodes needed to complete the production task, performs the following steps:
s1, acquiring the production task, current time information, a second public key of the production task, and a second private key of the production task;
s2, determining array information according to the production task; the array information records equipment type information of production nodes required by each process of the production task;
s3, signing the current time information, the second public key and the array information by using the second private key to generate second signature information;
and S4, generating the broadcast information according to the array information, the current time information, the second public key and the second signature information, and sending the broadcast information to each production node (200).
3. The data set generation system of claim 2, wherein the array information includes a plurality of second elements, the second elements including a device type; the production node (200) is further configured to:
when the self receives the broadcast information, the broadcast information is verified, and if the second signature information is respectively matched with the array information and the current time information and the second public key, the following steps are executed:
A1. acquiring a first private key and a first public key of the device, and traversing the array information to determine whether the array information records equipment type information matched with the production node;
A2. when the array information records equipment type information matched with the production node, recording the serial number and the equipment type of the second element, and acquiring first time information when the broadcast information is received;
A3. signing the first time information, the first public key, the serial number of the second element and the device type by using the first private key to generate first signature information;
A4. generating the reply message according to the first time information, the first public key, the sequence number of the second element, the device type and the first signature information, and sending the reply message to the scheduling node (100);
and if the second signature information is not matched with one of the array information and the current time information and the second public key, ignoring the broadcast information.
4. A data set generating system according to claim 3, characterized in that the scheduling node (100), when determining the target production node from the reply message, performs the following steps:
B1. generating a dynamic array according to the response message; the dynamic array comprises N first elements, and N is the number of process steps of the production task;
B2. generating corresponding key value pairs according to the first time information, the first public key, the serial number of the second element, the equipment type and the first signature information in each response message, pressing each key value pair into the corresponding first element in the dynamic array, and cleaning the key value pairs in each first element of the dynamic array according to the value of the key value pair;
B3. and determining a target production node according to the cleaned dynamic array.
5. The data set generation system of claim 4, wherein the step of cleansing the key-value pairs in the first elements of the dynamic array according to the values of the key-value pairs comprises:
B201. acquiring the serial number of the second element, the device type and the first time information of each key value pair;
B202. dividing the key value pairs with the same serial number of the second element and the same equipment type into the same key value pair group to be deleted;
B203. and acquiring first time information of each key value pair in the key value pair group to be deleted aiming at each key value pair group to be deleted, and deleting the key value pairs except the key value pair corresponding to the minimum first time information.
6. The data set generation system of claim 5, wherein the founder block is encapsulated by the scheduling node (100).
7. The data set generation system of claim 6, wherein the scheduling node (100), when encapsulating the founder block, performs the steps of:
C1. obtaining a production parameter vector of each target production node;
C2. filling the production parameter vectors into the corresponding key value pairs, recording the current time, and recording as a first current time;
C3. writing the dynamic array and the first current time into a data field of the created block, signing the data field by using the second private key, and writing the signed field into a signature field of the created block;
C4. and carrying out whole-network broadcasting on the creature block.
8. The data set generation system of claim 7, wherein the target production node, upon receiving the founder block, is further configured to validate the credibility of the founder block based on the second public key.
9. The data set generation system of claim 8, wherein if the founder block is a trusted block, the target production node is further configured to determine whether itself is an encapsulation node for the trusted block based on the first public key.
10. The data set generation system of claim 9, wherein the production zone is co-packaged by the scheduling node (100) and the selected production node; and the selected production node is an encapsulation node of the credible block.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202310243009.4A CN115955319B (en) | 2023-03-14 | 2023-03-14 | Data set generation system |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202310243009.4A CN115955319B (en) | 2023-03-14 | 2023-03-14 | Data set generation system |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN115955319A true CN115955319A (en) | 2023-04-11 |
| CN115955319B CN115955319B (en) | 2023-06-02 |
Family
ID=85906996
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN202310243009.4A Active CN115955319B (en) | 2023-03-14 | 2023-03-14 | Data set generation system |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN115955319B (en) |
Citations (8)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN104219325A (en) * | 2014-09-23 | 2014-12-17 | 中国南方电网有限责任公司 | SOA load balancing device and routing algorithm using device |
| CN112488492A (en) * | 2020-11-26 | 2021-03-12 | 中科星通(廊坊)信息技术有限公司 | Remote sensing product production scheduling method based on priority |
| CN113037797A (en) * | 2019-12-25 | 2021-06-25 | 华为技术有限公司 | Data processing method and device |
| CN113553178A (en) * | 2021-07-15 | 2021-10-26 | 北京字跳网络技术有限公司 | Task processing method and device and electronic equipment |
| CN113641493A (en) * | 2021-08-11 | 2021-11-12 | 杭州安恒信息技术股份有限公司 | Task pushing method, device and equipment and computer readable storage medium |
| CN115373860A (en) * | 2022-10-26 | 2022-11-22 | 小米汽车科技有限公司 | Scheduling method, device and equipment of GPU (graphics processing Unit) tasks and storage medium |
| WO2022252941A1 (en) * | 2021-06-02 | 2022-12-08 | 腾讯科技（深圳）有限公司 | Data processing method and apparatus based on blockchain, and device and readable storage medium |
| WO2023284473A1 (en) * | 2021-07-14 | 2023-01-19 | 腾讯科技（深圳）有限公司 | Data management method and apparatus, computer device, and storage medium |
-
2023
- 2023-03-14 CN CN202310243009.4A patent/CN115955319B/en active Active
Patent Citations (8)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN104219325A (en) * | 2014-09-23 | 2014-12-17 | 中国南方电网有限责任公司 | SOA load balancing device and routing algorithm using device |
| CN113037797A (en) * | 2019-12-25 | 2021-06-25 | 华为技术有限公司 | Data processing method and device |
| CN112488492A (en) * | 2020-11-26 | 2021-03-12 | 中科星通(廊坊)信息技术有限公司 | Remote sensing product production scheduling method based on priority |
| WO2022252941A1 (en) * | 2021-06-02 | 2022-12-08 | 腾讯科技（深圳）有限公司 | Data processing method and apparatus based on blockchain, and device and readable storage medium |
| WO2023284473A1 (en) * | 2021-07-14 | 2023-01-19 | 腾讯科技（深圳）有限公司 | Data management method and apparatus, computer device, and storage medium |
| CN113553178A (en) * | 2021-07-15 | 2021-10-26 | 北京字跳网络技术有限公司 | Task processing method and device and electronic equipment |
| CN113641493A (en) * | 2021-08-11 | 2021-11-12 | 杭州安恒信息技术股份有限公司 | Task pushing method, device and equipment and computer readable storage medium |
| CN115373860A (en) * | 2022-10-26 | 2022-11-22 | 小米汽车科技有限公司 | Scheduling method, device and equipment of GPU (graphics processing Unit) tasks and storage medium |
Also Published As
| Publication number | Publication date |
|---|---|
| CN115955319B (en) | 2023-06-02 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN110245956B (en) | Asynchronous multi-chain based block chain transaction confirmation method and system | |
| CN104199957B (en) | A kind of implementation method of Redis general-purpose proxies | |
| CN113409047B (en) | Data processing method, device and equipment based on block chain and readable storage medium | |
| CN109391500A (en) | A kind of configuring management method, device and equipment | |
| CN111625593A (en) | Data processing method and device based on block chain and computer equipment | |
| CN110750341A (en) | Task scheduling method, device, system, terminal equipment and storage medium | |
| CN111522874B (en) | Block chain consensus method, apparatus, computer device and storage medium | |
| CN112651046A (en) | Data synchronization method, device and system for cross-chain transaction and terminal equipment | |
| CN109379764B (en) | Message sending method and device | |
| CN112348596B (en) | Bid quotation method, system, equipment and storage medium based on blockchain | |
| CN111984735A (en) | Data archiving method and device, electronic equipment and storage medium | |
| CN114663104A (en) | PBFT based on block chain product supply chain tracing | |
| CN116248304A (en) | Cloud service message transfer monitoring system for high-performance computing and application method thereof | |
| CN110798535A (en) | Method for realizing P2P communication in block chain, block chain application system and related equipment | |
| CN115955319B (en) | Data set generation system | |
| CN116009985A (en) | Interface calling method, device, computer equipment and storage medium | |
| CN113590348B (en) | Parameter transmission method, device, equipment and medium based on tree structure | |
| CN109614354A (en) | Interface assignment method, board, equipment and storage medium | |
| CN111510484B (en) | Block chain processing method, system, device, computer equipment and storage medium | |
| CN113297223B (en) | Block chain-based electronic data real-time certificate storing system and method | |
| CN111401819B (en) | Intersystem data pushing method and system | |
| CN104869056A (en) | Institution personnel data synchronization method based on relational data separation | |
| CN111240867B (en) | Information communication system and method | |
| CN112883301A (en) | Method and device for generating short link based on 55 system and storage medium | |
| CN112087373B (en) | Message sending method and service device |
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 | ||
| GR01 | Patent grant | ||
| GR01 | Patent grant |