90 results about "Atomicity" patented technology

A multi-user, elastic, on-demand, distributed relational database management system. The database is fragmented into distributed objects called atoms. Any change to a copy of an atom at one location is replicated to all other locations containing a copy of that atom. Transactional managers operate to satisfy the properties of atomicity, consistency, isolation and durability.

The present invention is a method, system and apparatus for maintaining transactional integrity within an adaptive value chain involving cross enterprise interactions. In the present invention, transactional integrity can be maintained in a cross-enterprise business process management system by managing business transformation operations among cross-enterprise interactions to produce an adaptive value chain. At the same time, atomicity can be enforced among the business transformation operations and the cross-enterprise interactions.

A ruggedized file system, which provides ruggedness to non-volatile storage media at the device driver level. The ruggedized block device driver implementation provides ruggedness at the device driver level, thereby allowing atomic sequences of operations by the file system. Accordingly, the device driver is told that the current data state is a “fall-back” consistent state, into which the system should wake up if interrupted prior to completion of the sequence, following which operations are executed as required by the file system, including erasing, writing or overwriting blocks. The device driver is further told when the atomic sequence is complete, such that a new consistent state is thereby defined. It is, accordingly, the responsibility of the device driver to ensure that either the sequence completes and the file system reaches the target consistent state, or if power is lost or any other failure occurs in the middle, the file system will wake up in the initial fall-back state. Except for activating this “atomicity” feature as described above, the file system does not have to be aware of any implementation detail of the ruggedness solution.

An entangled links mechanism to establish and maintain bipartite temporal intimacy between pairs of computers, using an idempotent, reversible token method which presents no observable external “change” until a communication of information needs to occur between the computers, and which maintains the potential for “bounded (or unbounded) reversibility” in case the intended information dispatched by a source computational entity is not captured or properly accepted by a destination computational entity. The mechanism enables distributed computers in a network to remain continuously aware of each other's presence; to communicate on a logically nearest neighbor basis in a secure and reliable manner in which packets passed over these links do not conflict with normal traffic or cause the available resources of the link to be exceeded; and that atomicity, consistency, isolation, and “reversible durability” may be maintained for transactions when perturbations occur.

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.

This innovation provides a method for a networked and replicated database management system (DBMS) using only one-sided remote direct memory access (RDMA). Replicated databases retain some access to the stored data in the face of server failure. In the prior state of the art, after the software in the DBMS on one of the servers acted on a client's request to update the database, it would contact the other replicas of the database and ensure that they had recorded the change, before responding to the client that the transaction was complete. This innovation describes a method whereby the database client directly interacts with each DBMS replica over the network using only RDMA to directly modify the stored data while maintaining the properties of database atomicity and consistency. This method reduces transactional latency by removing any need for the server DBMS software to respond to or forward requests for service.

The invention discloses a block chain data indexing method, which comprises the following steps of: firstly persisting a block to a block file, persisting a layer of index data to an index database, then obtaining a conforming transaction position according to a query condition, and finally obtaining a complete transaction from the block file. According to the invention, Tthe processing process ofblock chain data storage is expanded; the block chain index data is stored in the independent index database, and the multi-database transaction atomicity is ensured; a data index mechanism for customizing business information in a transaction annotation field, associating a transaction with the business information by customizing a transaction annotation index field, and finally obtaining a complete transaction based on transaction key information is established. The specific transaction can be quickly indexed without re-traversing and analyzing the blocks on the block chain, so that the transaction backtracking efficiency of the block chain is greatly improved, the data reliability is ensured, and a foundation is laid for transaction data backtracking.

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.

An approach is provided in which a microservice fabric controller initiates a call flow that includes a set of transactions through a microservices chain that includes a set of microservices. The microservice fabric controller detects a transaction failure at one of the microservices that is positioned in the microservices chain subsequent to at least one successful microservice. In turn, the microservice fabric controller retries the transaction on the failed microservice without disrupting the previously successful microservice.

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.

The embodiment of the invention provides a cross-chain transaction method and device, and the method comprises the steps that a first node determines that the transaction state of a first transactionis a first state, wherein the first state represents that the transaction passes the consensus verification; the first node acquires a transaction state of the second transaction; and when the transaction state of the second transaction is the first state, the first node modifies target data according to the transaction data of the first transaction, and the target data is data related to the first transaction in a state machine of the first node. According to the method and device, whether the cross-chain sub-transaction is executed or not is not only dependent on the consensus verification result of the first transaction, and consensus verification results of other associated cross-chain transactions need to be considered, so that the situation that only one part of the associated cross-chain transactions is successfully executed and the other part of the associated cross-chain transactions is not successfully executed is avoided; atomic execution of the cross-chain transaction on aplurality of block chains is achieved.

The invention provides a multi-thread data processing method and device, electronic equipment and a readable storage medium, and the method comprises the steps: firstly determining whether the numberof bytes of to-be-processed data is smaller than or equal to the width of a register or not, and generating an instruction sequence corresponding to a current thread when the number of bytes of the to-be-processed data is smaller than or equal to the width of the register; wherein the instruction sequence comprises to-be-processed data and an atomic operation instruction, and the atomic operationinstruction is used for processing the to-be-processed data; and executing an instruction sequence corresponding to the current thread, the to-be-processed data being data shared by a plurality of threads. According to the embodiment of the invention, when the byte number of the to-be-processed data is smaller than or equal to the width of the register, the to-be-processed data can be written intothe instruction sequence, and the reading or writing operation of the to-be-processed data can be completed through the atomic operation instruction, so that the synchronization of multi-thread datacan be ensured without adopting a thread lock; and the performance overhead of the processor in the multi-thread data synchronization process is reduced.

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 discloses a metadata module which comprises a metadata object module used for managing metadata objects including LUN information and a root Node of a B + tree, and achieving initialization, updating and recovery of a ROOT area data structure; a transaction module which is used for ensuring the atomicity of the request; a write cache module whichis used for caching the request of theI / O service in a memory; a B + tree module which is used for realizing a B + tree operation algorithm of the metadata module; a read cache module which is used for improving the read performance of the metadata module; and aquery module is used for performing query operation. The invention further discloses a metadata module processing method for processing the offline condition of the lower layer of the storage system, the atomicity of metadata requests during offline of the lower layer is ensured, the integrity and consistency of data are ensured, and the reliability of metadata module development 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 embodiment of the invention discloses a distributed database transaction atomicity implementation method and device. According to the technical scheme provided by the embodiment of the invention,the transaction object is created, the data version number and the data value of the data object pointed by the transaction object are determined, the transaction object and the data object are associated through the transaction identifier based on the comparison exchange operation, and the data operation is executed on the data object according to the write operation instruction. The data value obtained after executing data operation is assigned to an expected value of the data object, and data version number is updated. When the transaction object is successfully submitted and the data version number is not modified by other processes, the data value of the data object is modified into the expected value, the data version number is updated, and the writing operation on the data object iscompleted. The atomicity of distributed database transactions is realized, the concurrency of the transactions is effectively improved, the waiting time for executing the transactions is reduced, andthe throughput of the distributed NoSQL database transactions is improved.

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.

A method for achieving atomicity while inspecting a running computer process using a copy-on-write process in a supervisor to generate a copy of a target's memory page being written to, prior to executing the write, the copy along with any unwritten to memory pages in the target being mapped to a measurement agent (MA) and used to reflect the state of the target at a particular moment in time which state when observed by the MA provides an atomic runtime inspection.

The invention particularly relates to a distributed transaction implementation method and system. According to the distributed transaction implementation method and system, the distributed lock of the resident memory is adopted to store data in the distributed transaction processing process, and isolation of the distributed transaction is achieved; the distributed lock is stored in a lock table of a resident memory for searching and modifying; the synchronization of data and locks is realized among a plurality of server nodes through a consensus algorithm, so that the consistency of distributed transactions is ensured; the integrity and durability of the distributed transactions are ensured through the transaction logs; in addition, in order to reduce the IO frequency, the disk is not read and written except for new value reading and final submission. According to the distributed transaction implementation method and system, the performance advantages of the memory are fully utilized, the read-write operation of the disk is reduced, the execution efficiency of the distributed transaction is improved, meanwhile, the safety of the distributed transaction is guaranteed, and the requirements for atomicity, consistency, isolation and durability of the distributed transaction are met.

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.