87 results about "Atomicity" patented technology

The invention discloses a multi-copy storage method and a multi-copy storage system for a distributed database system, and belongs to the field of computer software. The multi-copy storage system comprises a main Master node, a standby Master node, a plurality of storage nodes and a connection network. The multi-copy storage method includes steps of 1, storing data in different data pieces; 2, only allowing a user to operate the data in a primary version, and enabling the multi-copy storage system to synchronize change of the data to various copies in real time and guarantee the atomicity; 3, enabling the multi-copy storage system to detect survival conditions of the nodes via synchronous heartbeat detection, and enabling a main Master host to instantly select an available copy to replace the primary version when a certain storage node of the data in the primary version dies; 4, enabling the multi-copy storage system to carry out detection and repair operation for the storage copies regularly, and migrating the data pieces with excessively low quantities of copies to other available storage nodes by means of local storage migration. A main storage model and a standby storage model are adopted for each data piece, and the copies are of completely identical logical structures and are distributed on different physical storage nodes. The multi-copy storage method and the multi-copy storage system have the advantages that the integrity and the availability of the data are protected against the death of optional nodes of the system.

The invention provides a method for quickly copying cluster data in a database. According to the method, from a data copying theory of synchronizing and then processing, the atomicity and the inseparability of the database are introduced; a cluster database management device is used for separating different requests submitted by a user into structured query language (SQL) sentences of data atoms and transmitting the SQL sentences to respective servers in a cluster for executing the SQL sentences; and a final execution result is fed back to the user, so that the consistency of the data of each database server in the database cluster is ensured, and the working efficiency of the whole cluster is guaranteed. The requests submitted by the user are classified according to the atomicity and the inseparability of the database, firstly synchronized to the servers in each cluster, processed and executed by free servers in the cluster and fed back to the user, so that the data of each database server can be quickly synchronized; and therefore, the data in the cluster can be quickly copied and the servers can be efficiently managed.

The MSMC (Multicore Shared Memory Controller) described is a module designed to manage traffic between multiple processor cores, other mastering peripherals or DMA, and the EMIF (External Memory InterFace) in a multicore SoC. The invention unifies all transaction sizes belonging to a slave previous to arbitrating the transactions in order to reduce the complexity of the arbitration process and to provide optimum bandwidth management among all masters. Two consecutive slots are assigned per cache line access to automatically guarantee the atomicity of all transactions within a single cache line. The need for synchronization among all the banks of a particular SRAM is eliminated, as synchronization is accomplished by assigning back to back slots.

One embodiment facilitates data storage. During operation, the system selects a first page of a non-volatile storage to be recycled in a garbage collection process. The system determines that the first page is a first partial page which includes valid data and invalid data. The system combines the valid data from the first partial page with valid data from a second partial page to form a first full page, wherein a full page is aligned with a physical page in the non-volatile storage. The system writes the first full page to a first newly assigned physical page of the non-volatile storage.

The embodiment of the invention provides a block verification method and device, and equipment, and the block verification method comprises the steps: obtaining a to-be-detected block, wherein a plurality of transactions are stored in the to-be-detected block; obtaining a plurality of state operation queues according to the state item of each state operation in each transaction, wherein each stateoperation queue comprises state operations belonging to the same state item; and performing parallel verification on each state operation queue to obtain a verification result of the block. The blockverification method divides each state operation of each transaction in the to-be-detected block into the state operation queues corresponding to the state items, and performs parallel verification on each state operation queue, so that the sequential relationship of the state operations corresponding to the same state item and the DAG topology atomicity between transactions are ensured, and theaccuracy of a verification result is ensured, and the block verification efficiency is improved.

The invention provides a transaction method and node design of a database system. When the transaction in the database relates to on-chain and off-chain data operations or a plurality of on-chain dataoperations, the transaction initiating node performs endorsement and consensus operations on the on-chain data and the nodes of the respective data chains respectively. After all on-chain data passesthrough endorsement and consensus processes, the event is submitted, so that the atomicity of the event in the database is ensured.

The invention provides a system and method for a transaction write optimization framework of a persistent memory file system. The system comprises a module M1, a module M2 and a module M3; the moduleM1 comprises a write file input metadata module, the metadata module dynamically backs up metadata in the write file system and supports metadata fault recovery; the module M2 writes a file and inputting the file into the data module, and the data module ensures the consistency of data and recovers the consistency state when a fault occurs; and the module M3 judges the atomicity of file metadata and data operation after the metadata module and the data module are completed, and writes the latest metadata information and/or data information judged by the atomicity decision logic module back tothe metadata module and/or the data module. The invention provides a transaction optimization read-write method mainly for solving the consistency realization problem of a persistent memory file system.

The invention provides a hardware database rollback method and device and a software database rollback method and device, and the method comprises the steps: transmitting failure state information under the condition that a transaction is an updating task when the hardware database executes an error of the transaction; receiving table data obtained by executing log-based rollback operation according to the failure state information before the transaction is executed; and using the received table data before the transaction is executed to replace the table data after the transaction is executedby mistake in the hardware database. Through the scheme, the atomicity of the hardware database can be ensured.

The invention provides a data writing method and device. The method comprises the steps that a main node stores N sub-logs of a log locally, the log is generated according to an atomic writing request, the atomic writing request comprises N sub-writes, information of the sub-writes is recorded in the sub-logs, and N is a positive integer larger than 0; the main node backs up the N sub-logs into astandby node; and under the condition that the main node determines that all the N sub-logs are stored in the standby node, the logs are marked as valid. According to the technical scheme provided bythe invention, the atomicity of a group of write requests can be ensured through a log mechanism in a data backup process, and the atomicity is prevented from being realized through a file system semantic lock in the prior art, so that the process complexity and the system overhead can be reduced.

The invention discloses a global address space management method for a distributed persistent memory. The global address space management method comprises the steps that a local address allocator initiates a page allocation request; the global monitor receives a page allocation request, and selects a corresponding number of slave copy nodes to allocate idle pages; after distribution of the slave copy nodes is completed, corresponding page addresses are returned to the global monitor; after the global monitor receives all messages returned from the slave copy nodes, a unique global address is distributed, a global address mapping table is updated, and global address mapping information in the updated global address mapping table is returned to the slave copy nodes; and the slave copy nodescache the global address mapping information through a mapping table buffer, and manages the data page through a local address allocator to process a data allocation request with any granularity. According to the method, the atomicity during global address space allocation in the distributed persistent memory system can be ensured, the performance, reliability and expansibility during global address allocation are improved, and meanwhile, the recovery capability of the system after crash is ensured.

The invention discloses a micro-business service process interface generation method and a terminal. According to the method, all methods in a project are scanned according to a preset framework, and the methods marked with preset annotations are added to an execution unit list; obtaining an annotation attribute of the preset annotation defined by the user for the to-be-generated interface, selecting the corresponding execution unit according to the annotation attribute, and splicing to generate a superior and subordinate service process linked list; obtaining input information of the to-be-generated interface and output information of the execution unit at the tail end of the superior and subordinate service process linked list, and generating the to-be-generated interface according to the input information and the output information; according to the method, the method of each micro-service is labeled through the preset annotation, and the service process required by the aggregation/combination interface can be automatically spliced according to the annotation information provided by developers, so that the developers are more focused on atomic development in the field of parts, hard coding of aggregation and combination codes is reduced, and the development cost is reduced.

The invention discloses a fragment-based blockchain expandability implementation method and system, and the method comprises the steps of dividing a network where nodes in a blockchain system are located into different subnets, taking each subnet as a fragment, and enabling each fragment to be responsible for maintaining disjoint account book data and processing disjoint transactions; generating identifiers of the nodes based on the IDs of the nodes and the IDs of the fragments to which the nodes belong, and storing the identifiers of all the nodes in an identifier database; and using the identification database as an intermediary to realize cross-fragment transaction between nodes of two different fragments. According to the invention, on the basis of the tamper-proof, traceable and decentralized block chain technology, the graph structure is fragmented by adopting a manner based on the fragmentation technology, so that transactions in the same fragment can be processed, cross-fragment transactions among nodes of different fragments can be realized by taking the identification database as an intermediary, the atomicity of the transactions is ensured, and the expandability of the block chain can be improved.

The invention discloses a data organization and storage method based on a Java smart contract. According to the method, a data organization and storage method is realized on the basis of a new data organization structure column cluster table, and a complex mapping and set nested structure is converted into the column cluster table, so that the problem of too slow serialization and deserializationis avoided, the contract execution speed is increased, the atomicity of data access is enhanced, and visualization is facilitated.

The invention discloses a method for detecting single-variable atomic violation defects, and the method comprises the following steps: converting a source code of preset interrupt-driven software into an intermediate representation form LLVM IR, and constructing a program dependency graph according to the intermediate representation form; constructing an explosion hypergraph according to the program dependence graph and a preset IFDS framework, analyzing the main program data flow according to the explosion hypergraph to determine two accessible access sequences of each global variable serial, and analyzing the feasibility of the two access sequences to obtain a first analysis result; determining at least one shared global variable according to the first analysis result, determining a three-time access sequence corresponding to each shared global variable, analyzing the feasibility of the three-time access sequence to obtain a second analysis result, determining atomic violation defects according to the second analysis result, and generating a defect report. According to the invention, the technical problems of low accuracy and low efficiency of single-variable atomicity violation defect detection in the prior art are solved.

The invention aims to provide a method and device for realizing the atomicity of a multi-level intelligent contract stack, and the method comprises the steps: sequentially calling and executing at least one second intelligent contract, associated with a first intelligent contract, in a next layer according to a calling sequence in a process of executing the first intelligent contract of the previous layer of the multi-level intelligent contract stack; in each call execution process, creating a corresponding second transaction container for the second smart contract, and storing the address ofthe cache data area in the first transaction container corresponding to the first smart contract as the address of the submission data area in the second transaction container; calling and executing the intelligent contracts in each layer of the multi-level intelligent contract stack layer by layer according to the mode until all the intelligent contracts are successfully called and executed, so that the atomicity of the multi-level intelligent contract stack is realized, and the time and the resource overhead are greatly saved; and if a certain intelligent contract fails to be called and executed, discarding all the transaction containers corresponding to the successfully executed intelligent contracts.

One embodiment facilitates atomicity assurance for storing data and metadata in a data stream. The system receives a first stream of data to be written to a storage device, wherein the first stream includes a plurality of I/O requests associated with data and corresponding metadata. In response to determining that residual data associated with a preceding I/O request of the first stream exists in a data buffer: the system appends, to the residual data, a first portion of data from a current I/O request to obtain a first page of data; the system writes a remainder portion of the current I/O request to the data buffer to obtain current residual data; and the system writes the first page of data to the storage device. Thus, the system thereby facilitates atomicity assurance for storing the data and corresponding metadata of each I/O request of the first data stream.

The invention discloses a cross-chain implementation method, device and equipment for associated transaction requests, and a medium, and relates to the technical field of blockchain. According to thespecific implementation scheme, the method comprises the steps: acquiring a first transaction request initiated by a user; if it is determined that the first transaction request has the association mark, executing the first transaction request to generate corresponding first transaction data for uplink storage; updating a local write data set according to the first transaction data, taking the local write data set updated by the first transaction data as a pre-valid write data set, and setting the pre-valid write data set to be in a locked state; obtaining an uplink certificate of the second transaction request on other blockchains; verifying the relevance between the first transaction request and the second transaction request according to the riddle character string in the uplink certificate, and verifying the uplink validity of the second transaction request according to the uplink information in the uplink certificate; if the verification is passed, unlocking the locking state of the pre-valid write data set of the first transaction data. And the atomicity of transaction processing is ensured by adopting a deneutralized mode.

The invention provides a block chain dynamic fragmentation method and system, supports different fragmentation strategies, provides a flow of an address slice changing operation, guarantees the atomicity of the slice changing operation through mechanism design, and belongs to the technical field of block chain expansibility research. Through address slice changing, the cross-slice transaction proportion between slices is greatly reduced, and the optimal state of the slice system is kept for a long time, so that the performance loss of cross-slice operation is reduced, and the transaction processing performance of the slice system is improved.

The invention discloses a distributed transaction data synchronization method, which comprises the following steps of: after detecting that a distributed transaction starts, analyzing a distributed transaction event in an upstream first distributed database log according to a log writing rule of the distributed transaction, extracting specified information in the distributed transaction event and performing structured processing to generate a structured variable; and storing the structured variable to support subsequent synchronization operations such as data filtering, routing and grammar conversion, and performing data change unified operation on the structured variable after receiving a submission or rollback notification. According to the method, the distributed transaction data change of a data source is stored, and whether the distributed transaction data change is sent to the downstream or not is judged according to a data source distributed transaction control statement, so that the atomicity problem of writing of a data change target end in the same distributed transaction during distributed transaction data synchronization is solved. The invention further discloses a distributed transaction data synchronization device and equipment and a readable storage medium, which have corresponding technical effects.