48 results about "Sequential consistency" patented technology

Selectively emulating sequential consistency in software improves efficiency in a multiprocessing computing environment. A writing CPU uses a high priority inter-processor interrupt to force each CPU in the system to execute a memory barrier. This step invalidates old data in the system. Each CPU that has executed a memory barrier instruction registers completion and sends an indicator to a memory location to indicate completion of the memory barrier instruction. Prior to updating the data, the writing CPU must check the register to ensure completion of the memory barrier execution by each CPU. The register may be in the form of an array, a bitmask, or a combining tree, or a comparable structure. This step ensures that all invalidates are removed from the system and that deadlock between two competing CPUs is avoided. Following validation that each CPU has executed the memory barrier instruction, the writing CPU may update the pointer to the data structure.

In a distributed file system the distributed storage management is made useful to a variety of applications. Multiple quality of service options are provided through locking. Three locking systems are provided. The system offers a locking system designed for sequential consistency with write-back caching, typical of distributed file systems. A second locking system is provided for sequential consistency with no caching for applications that manage their own caches. Finally, a locking system that implements a weaker consistency model with write-back caching, designed for efficient replication and distribution of data is included. Locks for replication are suitable for serving dynamic data on the Internet and other highly-concurrent applications. The selection of the appropriate lock protocol for each file is set using the file metadata. Further, a novel locking system is provided for the lock system implementing a weak consistency model with write back caching. This system is implemented utilizing two whole file locks: a producer lock P and a consumer lock C. Any client can hold a consumer lock and when holding a consumer lock can read data and cache data for read. The producer lock is only held by a single writer and a writer holding a producer lock can write data, allocate and cache data for writing. When a writer performs a write, the write is performed as an out-of-place write. An out-of-place write writes the data to a different physical storage location than from which it was read. By performing an out-of-place write the old data still exists and is available to clients. Once the writer completes the write and releases the producer lock the previous data is invalidated and the clients are informed of the new location of the data. Clients can then read the new data from storage when needed and the server reclaims the old data blocks.

Techniques are provided for a linearizable primary-secondary database system that replicates database data with eventual consistency. The techniques include obtaining a logical clock value of a logical clock that orders transactions committed at a primary database system that includes a primary database. The logical clock value is obtained after a write transaction is committed at the primary database system and while processing a read request. The logical clock value is used to determine whether a secondary database is in a consistent replication state corresponding to the logical clock value with respect to the primary database. The read request is maintained in a linger state while the secondary database is not yet in the consistent replication state. The read request exits the linger state and is allowed to be processed against the secondary database after the secondary database has reached the consistent replication state.

Disclosed is a swatch sparsity image inpainting method with directional factors combined. The swatch sparsity image inpainting method mainly comprises the steps of conducing preprocessing on an image to be inpainted by the utilization of an existing image inpainting algorithm, extracting directional factors in four directions from the preprocessed image through non-subsampled contourlet transform, determining a new structural sparseness function and a new matching criterion according to the color-directional factor weighting distance, determining a filling-in order by means of the structure sparseness function and searching for a plurality of matching blocks according to the new matching criterion, establishing a constraint equation with color space local sequential consistency and directional factor local sequential consistency, optimizing and solving the constraint equation to obtain sparse representation information of the matching blocks, conducting filling, and updating filled-in regions until damaged areas are completely filled in. By means of the swatch sparsity image inpainting method, the consistency of the structure part, the clearness of the texture part and the sequential consistency of neighborhood information can be effectively kept, and the swatch sparsity image inpainting method is particularly applicable to inpainting of real pictures or composite images with complex textures and complex structural characteristics.

The invention discloses a video global motion estimation method with a sequential consistency constraint, and belongs to the field of a digital media technology. A locus-based method is employed, and by use of video interframe corresponding characteristic point data, the motion parameters of a camera are solved. According to the invention, the scheme is put forward for solving the limitation that a conventional model can only be solved when background characteristic points, i.e., inner points are greater than foreground characteristic points, i.e., outer points in terms of quantity, video multi-frame sequential consistency is taken as a constraint, the defects in the prior art are solved, and the method can be used for effectively processing a situation when the number of the inner points is smaller than the number of the outer points and can also be applied to a situation when the number of the inner points are greater than the number of the outer points.

Methods and systems for concurrent program verification. A concurrent program is summarized into a symbolic interference skeleton (IS) using data flow analysis. Sequential consistency constraints are enforced on read and write events in the IS. Error conditions are checked together with the IS using a processor.

The invention relates to a semantic consistency verification method of a semantic Web service combination, which belongs to the field of semantic nets and Web services. The invention is characterized in that the method is realized in a way that: establishing a storage unit of a semantic Web service coloring Petri net model, a parameter semantic consistency verification submodule, a QoS (Quality of Services) attribute consistency verification submodule and a consistency analytic result storage submodule on a computer; and analyzing the semantic consistency of the semantic Web service combination by using a coloring Petri net formalized verification method, wherein the semantic consistency comprises parameter semantic consistency and QoS attribute consistency. The invention can verify whether the semantic Web service combination is consistent in semantics and satisfies the demands of users for service non-function attributes.

An apparatus for reconciling data inconsistencies between indexes may include a processor and memory storing executable computer code causing the apparatus to at least perform operations including retrieving first metadata from a key value store in response to receipt of a request for data associated with a user. The computer program code may further cause the apparatus to retrieve second metadata from a text index in response to querying the text index for the second metadata. The second metadata may correspond to the first metadata of the key value store. The computer program code may further cause the apparatus to evaluate the first metadata of the key value store and the second metadata of the text index to determine whether there are any differences between the first metadata and the second metadata. Corresponding methods and computer program products are also provided.

The invention discloses a coal-miner posture detection system and method based on binocular vision and inertial navigation. The coal-miner posture detection system comprises a strap-down inertial navigation system, a laser target, a camera and a laser orientation instrument, wherein the laser orientation instrument is positioned on a coal-mining working face. The coal-miner posture detection method comprises the following steps: by utilizing the laser orientation instrument, transmitting cross laser onto the laser target; utilizing the two cameras to carry out real-time shooting on the laser target, and based on the binocular vision principle, tracking a cross laser point on the laser target; adopting an epipolar constraint algorithm based on sequential consistency to carry out three-dimensional matching on a mark point and carrying out real-time calculation on the posture of a coal miner; then by the strap-down inertial navigation system, obtaining real-time angular velocity and acceleration of a body of the coal miner, calculating a real-time posture angle of the coal miner, utilizing Kalman filtering to realize fusion of inertial navigation and vision information so as to obtainthe accurate posture angle of the coal miner. The coal-miner posture detection system and method disclosed by the invention have the beneficial effects that the measurement error of the posture angleof the coal miner can be effectively reduced and the correction effect for the positioning error of the posture of the coal miner can be improved.

Computer-implemented methods for synchronizing data between a server and a client are provided. In one aspect, a method includes receiving a request from a client to synchronize data. The request includes a synchronization token that includes client recent synchronization signatures, each client recent synchronization signature representing a state of data synchronization on the client for a certain time period. The method also includes comparing each client recent synchronization signature with a corresponding server recent synchronization signature representing data on a server for the same time period. When the comparison indicates that the data on the client for the time period represented by the client recent synchronization signature is not synchronized with corresponding data on the server for the time period, then the method includes sending the data on the server for the time period to the client. Systems and machine-readable media are also provided.

A real-time measurement method of pupil diameters based on the binocular stereo vision is provided. The method comprises: using Zhang Zhengyou's dual target method for camera calibration to obtain a rotation matrix, a translation matrix, a parameter matrix in the left industrial camera, and a parameter matrix in the right industrial camera; respectively processing images captured by the left industrial camera and the right industrial camera to obtain true ellipses corresponding to the pupil; drawing a straight line across the center of the true ellipse of the pupil obtained by the left industrial camera, wherein the straight line equation is intersected by the true ellipse of the left industrial camera to obtain a first intersection point and a second intersection point; according to the principle of polar line constraint and order consistency, by using the first intersection point and the second intersection point, respectively solving a first matching point and a second matching point corresponding to the two intersection points on the true ellipse obtained by the right industrial camera; and obtaining preliminary values of a plurality of pupil diameters corresponding to a plurality of straight lines with different slopes, and solving an average value to obtain a final result. The method provided by the present invention has high measurement precision, does not require the worker to fix the working distance, and has great application value.

A method, computer program product, and system is described that determines the correctness of using memory operations in a computing device with heterogeneous computer components. Embodiments include an optimizer based on the characteristics of a Sequential Consistency for Heterogeneous-Race-Free (SC for HRF) model that analyzes a program and determines the correctness of the ordering of events in the program. HRF models include combinations of the properties: scope order, scope inclusion, and scope transitivity. The optimizer can determine when a program is heterogeneous-race-free in accordance with an SC for HRF memory consistency model . For example, the optimizer can analyze a portion of program code, respect the properties of the SC for HRF model, and determine whether a value produced by a store memory event will be a candidate for a value observed by a load memory event. In addition, the optimizer can determine whether reordering of events is possible.

A computer implemented method for modeling and verifying concurrent systems which uses Satisfiability-Modulo Theory (SMT)-based Bounded Model Checking (BMC) to detect violations of safety properties such as data races. A particularly distinguishing aspect of our inventive method is that we do not introduce wait-cycles in our symbolic models for the individual threads, which are typically required for considering an interleaved execution of the threads. These wait-cycles are detrimental to the performance of BMC. Instead, we first create independent models for the different threads, and add inter-model constraints lazily, incrementally, and on-the-fly during BMC unrolling to capture the sequential consistency and synchronization semantics. We show that our constraints provide a sound and complete modeling with respect to the considered semantics. One benefit of our lazy modeling method is the reduction in the size of the BMC problem instances, thereby, improving the verification performance in both runtime and memory.

The invention discloses a cross-modal retrieval method and system based on pseudo label learning and semantic consistency, and the method comprises the steps: receiving an image data set and a text data set which comprise marked image text pairs and unmarked image data; Learning a projection matrix projected from the image space to the text space, and projecting the unmarked image data to the textspace; calculating the class center of the marked text; Distributing pseudo labels for the image data according to the similarity between the projection data of the unmarked image data and the classcenters of the text data, and taking the text data corresponding to the class center closest to the image data as a corresponding text mode; Taking the marked image data distributed with the pseudo tags and the corresponding text data as a training data set, and learning a projection matrix of images and texts projected to a public semantic space; Performing cross-modal retrieval. Unmarked data isintroduced into the training data set, and a more effective projection matrix can be obtained.

The invention discloses a system and a method for ensuring the eventual consistency of mass data caches. The system disclosed by the invention comprises a log monitoring module and a data cache eventual consistency batch-processing task module, wherein the log monitoring module is used for monitoring a binary data operation log of a practical data storage module and extracting change data records from the binary data operation log; the change data records comprise data records before and after changing; each data record is composed of a plurality of data columns; the data cache eventual consistency batch-processing task module is used for receiving the change data records, splitting the change data records into a plurality of change data columns according to columns, deleting unchanged data columns, only reserving changed data columns, combining the changed data columns by utilizing a reducer, and finally correcting the changed data columns; duplication of the change data records of the practical data storage module in a target data cache module is realized; and mass data cache consistency is realized. The system disclosed by the invention has high concurrency, batch-processing, high availability and the like; and the data cache consistency is realized by mapping, reducing and correcting batch-processing tasks.

The embodiment of the invention discloses a method, a port and a system for transmitting messages, which belong to the communication field, wherein the method comprises assigning a relevant serial number for each message in a plurality of messages, adding the serial number to relevant messages, sending the messages, wherein the serial number is used to receive the sequencing of the port to a plurality of messages. A sending port comprises a dispatching module and a sending module. A receiving port comprises a receiving module and a sequencing module. The system comprises a sending device and a receiving device. The invention enables a receiving end to sequence for a plurality of messages according to the serial number of each message through assigning a relevant serial number for each message in a plurality of messages, and guarantees the sequential consistency of a plurality of messages in end-to-end transmission.

Embodiments of the invention relate to synchronization of data in a shared pool of configurable computer resources. An image of the filesystem changes, including data and metadata, is captured in the form of a consistency point. Sequential consistency points are created, with changes to data and metadata in the filesystem between sequential consistency captured and placed in a queue for communication to a target filesystem at a target site. The changes are communicated as a filesystem operation, with the communication limited to the changes captured and reflected in the consistency point.

The invention discloses a word vector and context information-based short text topic model. A semantic relationship between words is extracted from word vectors; by explicitly obtaining the semantic relationship, the shortcoming of word co-occurrence deficiency of short text data is made up for; and through data of a training set, the semantic relationship between the words is further filtered, sothat the data set can be better trained. A background topic is added in a generation process; and through the background topic, noise words in a document are modeled. The model is solved by using a Gibbs sampling method in model inference, and the probability of the words with relatively high semantic correlation in related topics is increased by using a sampling strategy of a generalized Polya urn model in the sampling process; and in the way, the semantic consistency of the words in the topics is greatly improved. A series of experiments show that the method provided by the invention can improve the semantic consistency of the topics to a greater extent, and a new method is provided for short text topic modeling.

Embodiments of the invention provide a method of generating a UI visual presentation attribute scheme while preserving visual consistency of selected visual presentation attributes in the color scheme is provided. The method includes establishing a hierarchy of UI elements in a directed acyclic graph of nodes. The method yet further includes computing a visual presentation attribute for each child node of the hierarchy descending from a selected parent node according to an established transformation rule. Finally, the method includes exporting the hierarchy into a visual presentation attribute scheme. To the extent the visual presentation attribute is a color, the visual presentation attribute scheme can be a color scheme applicable to an application to define the color scheme of the application.

A method is disclosed for executing a load instruction. Address information of the load instruction is used to generate an address of needed data, and the address is used to search a cache memory for the needed data. If the needed data is found in the cache memory, a cache hit signal is generated. At least a portion of the address is used to search a queue for a previous load instruction specifying the same address. If a previous load instruction specifying the same address is found, the cache hit signal is ignored and the load instruction is stored in the queue. A load / store unit, and a processor implementing the method, are also described.

A computer implemented method for modeling and verifying concurrent systems which uses Satisfiability-Modulo Theory (SMT)-based Bounded Model Checking (BMC) to detect violations of safety properties such as data races. A particularly distinguishing aspect of our inventive method is that we do not introduce wait-cycles in our symbolic models for the individual threads, which are typically required for considering an interleaved execution of the threads. These wait-cycles are detrimental to the performance of BMC. Instead, we first create independent models for the different threads, and add inter-model constraints lazily, incrementally, and on-the-fly during BMC unrolling to capture the sequential consistency and synchronization semantics. We show that our constraints provide a sound and complete modeling with respect to the considered semantics. One benefit of our lazy modeling method is the reduction in the size of the BMC problem instances, thereby, improving the verification performance in both runtime and memory.

The present invention discloses semantic consistency maintaining method in synergistic pattern design in distributive environment. Through the detection on semantic conflict and compatibility in concurrent operations, semantic compatible group is created, user's negotiation mechanism is provided, the semantic compatible operation group on target is determined through negotiation, and semantic consistency maintenance in the site copies is finally realize. The present invention realizes the detection and solution of semantic conflict problem in multiuser synergistic pattern design to ensure the influent operation in synergistic design and to maintain the semantic consistency in the synergistic edition of different users.

A cache is maintained with write order numbers that indicate orders of writes into the cache, so that periodic partial flushes of the cache can be executed while maintaining write order consistency. A method of storing data into the cache includes receiving a request to write data into the cache, identifying lines in the cache for storing the data, writing the data into the lines of the cache, storing a write order number, and associating the write order number with the lines of the cache. A method of flushing a cache having cache lines associated with write order numbers includes the steps of identifying lines in the cache that are associated with either a selected write order number or a write order number that is less than the selected write order number, and flushing data stored in the identified lines to a persistent storage.

The invention provides a method for maintaining spatial consistency for multi-person augmented reality interaction. Based on the principle of orientation and location in computer vision, the azimuth angles of a plurality of light sensors distributed on the header display with respect to each base station are obtained by using the Lighthouse base station and the azimuth angle of the base station relative to the head display is obtained by using the front camera of the head display, and the coordinates of each base station in the camera coordinate system of the front camera of the head display are calculated by combining the light sensors of the head display and the known positional relationship between the front camera and the front camera. Further, if three base stations are used to determine the model coordinate system of the virtual scene, the transformation relationship between the head display and the model coordinate system can be established, thereby maintaining the spatial consistency of the multi-person augmented reality interaction, enabling multiple head displays to be tracked with low computational load, and eliminating the need for calibration of multiple base stations.

The invention discloses a method applied to an AFDX (Avionics Full Duplex Switched Ethernet) exchanger for ensuring uniformity between a data frame forwarding sequence and a receiving sequence. The method comprises the steps that a request latch module latches and writes request states of all channels in an FIFO (First Input First Out) according to states of request signals of the request channels; a request processing module reads out data in the FIFO according to the states (namely non-blank) of the FIFO of a latch request, and generates a VL (Virtual Link) checking request signal according to sequences and the states of data bits; a VL checking module of the corresponding channel checks according to the VL checking request signal, and then writes checked frame information data into a VL checked frame information data queue FIFO; and a frame data transferring module transfers a data frame to be stored into a frame buffer storing zone according to information of the VL checked frame information data queue FIFO. The method adopts a request latch and queuing processing method, ensures the uniformity of the forwarding sequence of data frames, and is suitable for hardware realization.

A method is disclosed for executing a load instruction. Address information of the load instruction is used to generate an address of needed data, and the address is used to search a cache memory for the needed data. If the needed data is found in the cache memory, a cache hit signal is generated. At least a portion of the address is used to search a queue for a previous load instruction specifying the same address. If a previous load instruction specifying the same address is found, the cache hit signal is ignored and the load instruction is stored in the queue. A load / store unit, and a processor implementing the method, are also described.

A method is disclosed. The method comprises executing a transaction on a number of distributed objects. The distributed objects are maintained on a number of computing entities, and a distributed relationship exists between the objects. The executing the transaction includes performing a preparation operation, performing a processing operation, and performing a post-processing operation.

The invention provides a deep learning-based asymmetric text hashing method. According to the method, the semantic consistency of hash codes is maintained by using a difference value between binary hash code similarity and semantic similarity among minimized texts, so that the binary codes have similar information retention; a heterogeneous neural network is used for carrying out hash learning respectively on retrieving texts and retrieved texts, so that the efficiency of text hash learning is improved.

The invention provides a design method of a distributed virtual machine self-adaptive memory consistency protocol, which comprises the following steps of: intercepting synchronous operation: aiming atdifferent applications, flexibly switching a vCPU (Virtual Central Processing Unit) of a client in a sequential consistency mode and a TSO (Transport Storage and Offloading) mode; the state description of the synchronization protocol: on the basis of the original memory consistency protocol, adding Dirty and a corresponding atomic operation state, and realizing state transition. Meanwhile, the invention provides a distributed virtual machine self-adaptive memory consistency protocol obtained based on the design method and a terminal used for executing the design method. According to the method, on the basis of the distributed virtual machine, the distributed shared memory can obtain better performance. According to the method, the memory synchronization protocol of the distributed virtualmachine is flexibly switched in order consistency and x86-TSO; for different application scenarios and restrictions, the adaptive consistency protocol relaxes the original sequence consistency to x86-TSO, so that the performance of the distributed shared memory is improved.