CN115955319B - Data set generation system - Google Patents
Data set generation system Download PDFInfo
- Publication number
- CN115955319B CN115955319B CN202310243009.4A CN202310243009A CN115955319B CN 115955319 B CN115955319 B CN 115955319B CN 202310243009 A CN202310243009 A CN 202310243009A CN 115955319 B CN115955319 B CN 115955319B
- 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.)
- Active
Links
- 238000004519 manufacturing process Methods 0.000 claims abstract description 191
- 230000004044 response Effects 0.000 claims abstract description 28
- 238000000034 method Methods 0.000 claims abstract description 21
- 238000004806 packaging method and process Methods 0.000 claims abstract description 8
- 239000013598 vector Substances 0.000 claims description 15
- 238000004140 cleaning Methods 0.000 claims description 12
- 230000008569 process Effects 0.000 claims description 11
- 238000005538 encapsulation Methods 0.000 claims description 5
- 238000003825 pressing Methods 0.000 claims description 4
- 238000004891 communication Methods 0.000 abstract description 7
- 230000001364 causal effect Effects 0.000 description 6
- 238000005516 engineering process Methods 0.000 description 5
- 230000009471 action Effects 0.000 description 3
- 238000013473 artificial intelligence Methods 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
- 238000012795 verification 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
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 blockchains and provides a data set generation system which comprises a plurality of production nodes and at least one scheduling node, wherein the production nodes are in communication connection with the scheduling nodes, and the scheduling nodes are used for sending broadcast information to the production nodes according to production tasks so as to find idle production nodes required by completing the production tasks; 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 completing 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 packaging the blockchain data; the blockchain data includes an creation block and a production block. The method has the advantages of strong relevance between data and high data reliability.
Description
Technical Field
The present application relates to the field of blockchain technologies, and in particular, to a data set generation system.
Background
Advances in big data and artificial intelligence technology have made production and manufacturing intelligentization possible, and a sufficient amount of basic data is one of important preconditions for the big data algorithms and artificial intelligence algorithms to operate effectively. When big data and artificial intelligence are applied to the field of manufacturing, the predicted value of the model is often seriously deviated from the actual value due to the unreliable data input into the model, thereby causing production accidents.
Blockchain technology is considered an emerging technology that makes data operations non-repudiatable and non-tamperable, and researchers currently use blockchain technology to develop various platforms to obtain trusted base data. The main stream is to construct a blockchain platform with a plurality of high performance devices acting as blockchain nodes, then the business system sends basic data to the blockchain platform, the blockchain platform encapsulates the data into a blockchain data structure managed by the platform, and only the data processed and encapsulated by the blockchain platform is trusted data. The method has the advantages that the system deployment is simple, a plurality of business systems can be simultaneously serviced only by deploying one set of block chain platform, and the efficiency is high. However, the biggest problem of this architecture is that the basic data are distributed in each block without logic association, and the large data platform and the artificial intelligent platform cannot acquire the basic data with causal association.
Based on the above problems, no effective solution is currently available.
Disclosure of Invention
The data set generation system adopts a block chain and multiple signature mode to ensure that each piece of generated vector data has strict causal relationship, and improves the relevance and the 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 an idle production node required for completing 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 completing 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 packaging the blockchain data; the blockchain data includes an creation block and a production block.
According to the data set generation system, the scheduling node and the production node jointly encapsulate the blockchain data, in this way, each generated data is guaranteed to have strict causal relation, and redundancy is reduced while the relevance of the data is improved.
Optionally, in the data set generating system provided in the present application, when the scheduling node sends broadcast information to each of the production nodes to find an idle production node required for completing the production task, the scheduling node 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 the 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;
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 be made to determine the number of production steps of the production task and the type of production node at each production step and broadcast to the production nodes.
Optionally, the data set generating system provided by the present application, the array information includes a plurality of second elements, and the second elements include a device type; the production node is further configured to:
when receiving 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 with 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 the device type information matched with the production node;
A2. when the equipment type information matched with the production node is recorded in the array information, the serial number and the equipment type of the second element are recorded, and the first moment information when the broadcast information is received is obtained;
A3. signing the first time information, the first public key, the sequence 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 serial number of the second element, the equipment 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, the current time information and the second public key, ignoring the broadcast information.
In this way, a satisfactory idle production node can be found, and the satisfactory idle production node is caused to send a response message to the scheduling node.
Optionally, in the data set generating system provided in the present application, the scheduling node performs the following steps when determining the target production node according to the response message:
B1. generating a dynamic array according to the response message; the dynamic array comprises N first elements, wherein N is the number of working procedures of the production task;
B2. generating corresponding key value pairs according to the first time information, the first public key, the serial numbers of the second elements, the equipment type and the first signature information in each response message, pressing each key value pair into a corresponding first element in the dynamic array, and cleaning the key value pairs in each first element of the dynamic array according to the values of the key value pairs;
B3. and determining a target production node according to the cleaned dynamic array.
Optionally, in the data set generating system provided in the present application, the step of cleaning the key value pairs in each first element of the dynamic array according to the value of the key value pair includes:
B201. acquiring a serial number of the second element, the equipment 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 aiming at each key value pair group to be deleted, acquiring first time information of each key value pair in the key value pair group to be deleted, and deleting key value pairs except the key value pair corresponding to the minimum first time information.
By the online data cleaning mode, original data are cleaned while generated, and the data after the data generation is finished are cleaned, so that the efficiency is high.
Optionally, in the data set generating system provided by the present application, the creation block is encapsulated by the scheduling node.
Optionally, in the data set generating system provided in the present application, the scheduling node performs the following steps when packaging the creation block:
C1. obtaining production parameter vectors of all the target production nodes;
C2. filling the production parameter vector into the corresponding key value pair, recording the current moment and recording the current moment as a first current moment;
C3. writing the dynamic array and the first current time into a data field of the creation block, signing the data field by using the second private key, and writing the data field into a signature field of the creation block;
C4. and broadcasting the creation block in a whole network.
Optionally, in the data set generating system provided by the present application, when the target production node receives the creation block, the target production node is further configured to confirm the credibility of the creation block according to the second public key.
Optionally, in the data set generating system provided by the present application, if the created block is a trusted block, the target production node is further configured to confirm whether the created block is a packaging node of the trusted block according to the first public key.
Optionally, in the data set generating system provided by the present application, the production blocks are encapsulated together by the scheduling node and the selected production node; the selected production node is the encapsulation node of the trusted block.
According to the data set generation system, in the process of determining the target production node according to the response message, the scheduling node adopts an online data cleaning mode to realize that the original data are generated and cleaned simultaneously in the process, so that the generated data are cleaned data, and the generation efficiency of the data is improved; in the process of jointly packaging the blocks, the scheduling node and the production node adopt a multi-signature mode, so that each generated data has strict causal relation, the relevance of the data is improved, and the redundancy is reduced.
In summary, the data set generating system ensures that each generated data has strict causal relationship through the modes of online data cleaning, blockchain and multiple signatures, improves the relevance of the data and reduces the redundancy degree of the data.
Drawings
Fig. 1 is an overall topology diagram of a data set generating system provided in the present application.
Description of the reference numerals:
100. scheduling nodes; 200. and (5) producing nodes.
Detailed Description
The following description of the embodiments of the present application will be made clearly and fully with reference to the accompanying drawings, in which it is evident that the embodiments described are only some, but not all, of the embodiments of the present application. The components of the embodiments of the present application, which are generally described and illustrated in the figures herein, may be arranged and designed in a wide variety of different configurations. Accordingly, the following detailed description of the embodiments of the present application, provided in the accompanying drawings, is not intended to limit the scope of the application, as claimed, but is merely representative of selected embodiments of the application. All other embodiments, which can be made by those skilled in the art based on the embodiments of the present application without making any inventive effort, are intended to be within the scope of the present application.
It should be noted that: like reference numerals and letters denote like items in the following figures, and thus once an item is defined in one figure, no further definition or explanation thereof is necessary in the following figures. Meanwhile, in the description of the present application, the terms "first", "second", and the like are used only to distinguish the description, and are not to be construed as indicating or implying relative importance.
Referring to fig. 1, fig. 1 is an overall topology 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 an idle 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 to jointly encapsulate the blockchain data; the blockchain data includes an creation block and a production block.
All devices in the intelligent factory are classified into two types, one type is a device responsible for production, and is denoted as a production node 200, and the other type is a device responsible for scheduling and allocating resources, and is denoted 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 an idle production node 200 required 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 the production nodes required by each process of the production task;
s3, signing the current time information, the second public key and the data group information by using the second private key to generate second signature information;
s4, broadcasting information is generated according to the array information, the current time information, the second public key and the second signature information, and the broadcasting information is sent to each production node 200.
In step S1, the scheduling node 100 divides the production task into N production processes, where N is a preset positive integer; the second public key of the scheduling node 100 is noted as
The second private key is recorded as +.>
The method comprises the steps of carrying out a first treatment on the surface of the 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 by the prior art, < + >>
Representing a scheduling node 100.
In step S2, the array information is S, and the array information contains a plurality of second elements
Array informationThe number of elements is N # -, # ->
。
Representing +.o in array information S>
The individual elements are stored as +.>
The set of device types for all production nodes 200 that are required in the process.
In step S3, the scheduling node 100 uses its second private key based on the existing signature algorithm
Logarithmic information S, current time T and second public key +>
Signing to generate 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 array, denoted (S, T,
，
) Then, broadcast information is generated from the first tuple, and the broadcast information is broadcast and transmitted to each production node 200.
In this way, the scheduling node 100 can be made to determine the number of production steps of a production task and the type of production node 200 at each production step, and broadcast to the 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 for:
when receiving the broadcast information, the method verifies the broadcast information, and if the second signature information is respectively matched with the array information and the current time information and the second public key, the method executes the following steps:
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 the equipment type information matched with the production node;
A2. when the equipment type information matched with the production node is recorded in the array information, the serial number and the equipment type of the second element are recorded, and the first moment information when the broadcast information is received is obtained;
A3. signing the first moment information, the first public key, the serial number of the second element and the equipment type by using the first private key to generate first signature information;
A4. generating a response message 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, and transmitting the response message to the scheduling node 100;
if the second signature information and the group information, the current time information and one of the second public keys are not matched, the broadcast information is ignored.
In practice, when the production node 200 receives the broadcast information from the scheduling node 100, i.e. the first tuple (S, T,
，
) Then using the existing signature algorithm to verify whether the second signature information in the first tuple is matched with the tuple information and the current time information respectively, and the second public key, namely judging whether the second signature information ++>
Whether to match the array information S, the current time information T, the second public key +.>
Matching, if so, executingStep A1-step A4; if the second signature information and the group information, the current time information and one of the second public keys are not matched, the broadcast information is ignored.
In step A1, the production node 200 first obtains its own first private key and first public key, and marks the first private key as pri and the first public key as pri
The method comprises the steps of carrying out a first treatment on the surface of the Then traversing all second elements S [ ] on the array information S>
]And all device types, if a certain second element S [ -A)>
]With second signature information->
The matching device type is then marked with the second element number +.>
And device type->
。
In step A2, the first time information is obtained as the prior art, and the first time information is recorded 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 by using the first private key pri, that is, signs
，
，
，
) Signing is carried out, and first signature information sig is generated.
In step A4, a second tuple is generated according to the first time information, the first public key, the second element serial number, the equipment type and the first signature information and is marked as [ ]
，
，
Sig) and then generates a response message based on the second tuple to dispatch node 100.
In this way, a satisfactory idle production node 200 can be found and the satisfactory idle production node 200 is caused to send a reply message to the scheduling node 100.
In a further embodiment, the scheduling node 100 performs the following steps when determining the target production node from the reply message:
B1. generating a dynamic array according to the response message; the dynamic array comprises N first elements, wherein N is the number of the working procedures of the production task;
B2. generating corresponding key value pairs according to the first moment information, the first public key, the serial numbers of the second elements, the equipment types 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 in the dynamic array according to the values of 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 +.>
The first element is kept +.>
The production parameter vectors of all production nodes 200 of the process, each production parameter vector having an index of the first public key of the corresponding production node 200. Wherein (1)>
。
In step B2, the scheduling node 100 first traverses M response messages in the dynamic array, i.e. traverses M second tuples
，
，
，
Sig) and then rewritten to the form of "key value pair", wherein the bond is +.>
The value is (++>
，
，
Sig) and pressing the key value pair into the respective first element +.>
In which (1) is (are) added>
。/>
In step B3, the manner of determining the target production node is the prior art, and will not be described herein.
In a further embodiment, the step of cleaning the key value pairs in each first element of the dynamic array according to the value pairs of the key value pairs includes:
B201. acquiring a serial number, a device type and first time information of a second element of each key value pair;
B202. dividing the key value pairs with the same serial number and the same equipment type of the second element into the same key value pair group to be deleted;
B203. and aiming at each key value pair group to be deleted, acquiring first time information of each key value pair in the key value pair group to be deleted, and deleting key value pairs except for the key value pair corresponding to the minimum first time information.
In practical application, will
,
) Fields are identical but (+)>
Sig) field is marked 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 moment information Γ, reserving the key value pair to be deleted corresponding to the minimum value Γ, and deleting other key value pairs to be deleted.
By the online data cleaning mode, original data are cleaned while generated, and the data after the data generation is finished are cleaned, 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 creation block +.>
The remaining blocks are used as production blocks.
In a further embodiment, the creative block is encapsulated by the scheduling node 100.
Specifically, when the created block is encapsulated, the scheduling node 100 performs the following steps:
C1. obtaining production parameter vectors of all target production nodes;
C2. filling the production parameter vector into the corresponding key value pair, recording the current moment, and recording the current moment as the first current moment;
C3. writing the dynamic array and the first current time into a data field of the creation block, signing the data field by using a second private key, and writing the signature field of the creation block;
C4. and broadcasting the created block in the whole network.
In step C1, the scheduling node 100 obtains the production parameter vectors of all the 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, writes the production parameter vector of the production node 200 corresponding to each key value pair into the "value" of the key value pair corresponding to each key value pair, and marks the production parameter vector as v, namely-
，
，
Sig) is rewritten as (++>
，
，
Sig, v) and notes the first current moment at this time +.>
。
In step C3, the scheduling node 100 sets the dynamic array P and the first current time
Writing the data field of the creation block and then using its second private key +.>
After signing the data field, writing the data field into the signature field of the creation block.
In step C4, the scheduling node 100 broadcasts the processed creation block to all production nodes 200.
In a further embodiment, the target production node is further configured to confirm the authenticity of the creation block based on the second public key when receiving the creation block.
In practical application, when the production node 200 receives the created block from the scheduling node 100, the number of non-empty elements of the created block is counted
The +.>
A non-null element; then call the first public key
Sequentially carrying out signature verification operation on the data field and the signature field of each created block, and if the signature verification passes, indicating that the created block is credible; if the verification sign does not pass, the created block is not trusted, 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 the created block is a packaging node of the trusted block according to the first public key.
In practical application, the production node 200 reads the creation block
Dynamic array->
Is a first element of (2)
If the first element->
The "key" in the key-value pair does not include the first public key of the production node 200, which indicates that the production node 200 itself is not the encapsulation node of the trusted block, and the created block is discarded. Otherwise, it is indicated that the production node 200 is a trusted block encapsulation node, and at this time, the production node 200 reads the production parameter vector v in the "value" indexed by the "key" and uses the production parameter vector as a reference value for production.
In a further embodiment, the production blocks are co-encapsulated by the scheduling node 100 and the selected production node; the selected production node is the encapsulation node of the trusted block.
When the production node 200 completes production, the production node 200 needs to package the sub-modules of the production block. Specifically, the production node 200 records the actual production parameter vector
Then a third tuple (++>
) And signs the third tuple using its first private key pri, generating a signature +.>
And generating a fourth tuple
,
,
,
) And then to the scheduling node 100. Wherein (1)>
Representing the block array->
Is>
Hash value of individual 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
The set of the first public keys corresponding to the "keys" in all key-value pairs in the key-value pairs waits for the fourth tuple (") sent by the production node 200 corresponding to all the first public keys>
,
,
,
) The fourth elements are encapsulated as elements into a new array G, and the moment +.>
Then, array G and time +.>
Put into block array element->
Is used with its second private key +.>
Couple (G,)>
,
) Signing to generate->
And then placed in the signature field. In this way, it is achieved that the scheduling node 100 and the production node 200 together 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 performs the cleaning operation in the process of generating the original data by adopting an online data cleaning manner, so that the generated data is cleaned data, and the data generating efficiency is improved; in the process of jointly packaging the blocks, the scheduling node 100 and the production node 200 adopt a multi-signature mode, so that each generated data has strict causal relationship, the relevance of the data is improved, and the redundancy is reduced.
In the embodiments provided in this application, it should be understood that the disclosed systems and methods may be implemented in other ways. The system embodiments described above are merely illustrative, e.g., the division of the elements is merely a logical functional division, and there may be additional divisions in actual implementation, and e.g., multiple elements or components may be combined or integrated into another system, or some features may be omitted, or not performed. Alternatively, the coupling or direct coupling or communication connection shown or discussed with each other may be through some communication interface, system or unit indirect coupling or communication connection, which may be in electrical, mechanical or other form.
Further, the units described as separate units may or may not be physically separate, and units displayed as units may or may not be physical units, may be located in one place, or may be distributed over a plurality of network units. Some or all of the units may be selected according to actual needs to achieve the purpose of the embodiment.
Furthermore, the functional modules in the embodiments of the present application may be integrated together to form a single part, or each module may exist alone, or two or more modules may be integrated to form a single 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 foregoing is merely an embodiment of the present application, and is not intended to limit the scope of the present application, so that various modifications and variations may be made by those skilled in the art. Any modification, equivalent replacement, improvement, etc. made within the spirit and principles of the present application should be included in the protection scope of the present application.
Claims (9)
1. A data set generating system comprising a plurality of production nodes (200) and at least one scheduling node (100), wherein each production node (200) is communicatively connected to 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 an idle production node required to complete 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 the idle production node required by 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 configured to jointly encapsulate blockchain data; the blockchain data comprises an creation block and a production block;
the scheduling node (100) performs the following steps when sending broadcast information to each of the production nodes (200) to find an idle production node required to complete the production task:
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 the 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;
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).
2. The data set generation system of claim 1, wherein the array information comprises a plurality of second elements, the second elements comprising device types; the production node (200) is further configured to:
when receiving 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 with 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 the device type information matched with the production node;
A2. when the equipment type information matched with the production node is recorded in the array information, the serial number and the equipment type of the second element are recorded, and the first moment information when the broadcast information is received is obtained;
A3. signing the first time information, the first public key, the sequence 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 serial 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 is not matched with one of the array information, the current time information and the second public key, ignoring the broadcast information.
3. The data set generating system according to claim 2, wherein the scheduling node (100) performs the following steps when determining the target production node from the reply message:
B1. generating a dynamic array according to the response message; the dynamic array comprises N first elements, wherein N is the number of working procedures of the production task;
B2. generating corresponding key value pairs according to the first time information, the first public key, the serial numbers of the second elements, the equipment type and the first signature information in each response message, pressing each key value pair into a corresponding first element in the dynamic array, and cleaning the key value pairs in each first element of the dynamic array according to the values of the key value pairs;
B3. and determining a target production node according to the cleaned dynamic array.
4. A data set generating system according to claim 3, wherein the step of cleaning key pairs in each first element of the dynamic array according to the values of the key pairs comprises:
B201. acquiring a serial number of the second element, the equipment 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 aiming at each key value pair group to be deleted, acquiring first time information of each key value pair in the key value pair group to be deleted, and deleting key value pairs except the key value pair corresponding to the minimum first time information.
5. The data set generating system according to claim 4, wherein the creative block is encapsulated by the scheduling node (100).
6. The data set generating system according to claim 5, wherein the scheduling node (100) performs the following steps when encapsulating the creative block:
C1. obtaining production parameter vectors of all the target production nodes;
C2. filling the production parameter vector into the corresponding key value pair, recording the current moment and recording the current moment as a first current moment;
C3. writing the dynamic array and the first current time into a data field of the creation block, signing the data field by using the second private key, and writing the data field into a signature field of the creation block;
C4. and broadcasting the creation block in a whole network.
7. The data set generating system of claim 6, wherein the target production node is further configured to confirm the trustworthiness of the creation block based on the second public key upon receipt of the creation block.
8. The data set generating system of claim 7, wherein if the originating block is a trusted block, the target production node is further configured to determine whether the target production node is a packaging node of the trusted block according to the first public key.
9. The data set generation system of claim 8, wherein the production block is co-encapsulated by the scheduling node (100) and the selected production node; the selected production node is the encapsulation node of the trusted 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 CN115955319A (en) | 2023-04-11 |
| CN115955319B true 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 (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN113553178A (en) * | 2021-07-15 | 2021-10-26 | 北京字跳网络技术有限公司 | Task processing method and device and electronic equipment |
| WO2022252941A1 (en) * | 2021-06-02 | 2022-12-08 | 腾讯科技（深圳）有限公司 | Data processing method and apparatus based on blockchain, and device and readable storage medium |
Family Cites Families (6)
| 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 |
| CN113037797B (en) * | 2019-12-25 | 2024-09-03 | 华为技术有限公司 | Data processing method and device |
| CN112488492A (en) * | 2020-11-26 | 2021-03-12 | 中科星通(廊坊)信息技术有限公司 | Remote sensing product production scheduling method based on priority |
| CN113239098B (en) * | 2021-07-14 | 2021-09-28 | 腾讯科技（深圳）有限公司 | Data management method, computer and readable storage medium |
| CN113641493A (en) * | 2021-08-11 | 2021-11-12 | 杭州安恒信息技术股份有限公司 | Task pushing method, device and equipment and computer readable storage medium |
| CN115373860B (en) * | 2022-10-26 | 2023-01-10 | 小米汽车科技有限公司 | Scheduling method, device and equipment of GPU (graphics processing Unit) tasks and storage medium |
-
2023
- 2023-03-14 CN CN202310243009.4A patent/CN115955319B/en active Active
Patent Citations (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| WO2022252941A1 (en) * | 2021-06-02 | 2022-12-08 | 腾讯科技（深圳）有限公司 | Data processing method and apparatus based on blockchain, and device and readable storage medium |
| CN113553178A (en) * | 2021-07-15 | 2021-10-26 | 北京字跳网络技术有限公司 | Task processing method and device and electronic equipment |
Also Published As
| Publication number | Publication date |
|---|---|
| CN115955319A (en) | 2023-04-11 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN110288345B (en) | Cross-link communication method, device, main chain node and storage medium | |
| CN110245956B (en) | Asynchronous multi-chain based block chain transaction confirmation method and system | |
| CN110113388B (en) | Improved clustering algorithm-based block chain system consensus method and device | |
| CN112446785A (en) | Cross-chain transaction method, system, device, equipment and storage medium | |
| CN104199957B (en) | A kind of implementation method of Redis general-purpose proxies | |
| CN113095827B (en) | Anonymous multiple signature method, computer device, and storage medium | |
| CN113409047B (en) | Data processing method, device and equipment based on block chain and readable storage medium | |
| CN111625593A (en) | Data processing method and device based on block chain and computer equipment | |
| CN114048264A (en) | Consensus intelligent contract algorithm | |
| CN111651525A (en) | Block chain data storage method and device | |
| CN111522874B (en) | Block chain consensus method, apparatus, computer device and storage medium | |
| CN111061678B (en) | Service data processing method, device, computer equipment and storage medium | |
| CN111984735A (en) | Data archiving method and device, electronic equipment and storage medium | |
| CN112348596B (en) | Bid quotation method, system, equipment and storage medium based on blockchain | |
| CN109379764B (en) | Message sending method and device | |
| CN109348434A (en) | A kind of sending method of scene information, sending device and terminal device | |
| CN115955319B (en) | Data set generation system | |
| CN113255011A (en) | Block chain state mapping method, system, computer device and storage medium | |
| CN114172742A (en) | Layered authentication method for power internet of things terminal equipment based on node map and edge authentication | |
| CN114897532A (en) | Operation log processing method, system, device, equipment and storage medium | |
| Ding et al. | A genetic algorithm for minimizing bandwidth utilization by packing CAN-FD frame | |
| CN112087373B (en) | Message sending method and service device | |
| CN111510484A (en) | Block chain processing method, system, device, computer equipment and storage medium | |
| CN109451016A (en) | Data downloading management method, system and relevant device | |
| CN115941119B (en) | Information transmission method, device and medium |
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 |