773results about How to "Improve concurrency" patented technology

A data storage methodology wherein a hashing algorithm is applied to break a directory object experiencing frequent concurrent accesses from a number of client or manager applications into a predetermined number of hash component objects and a hash master object that manages the component objects. The hash master object and the hash components, together, constitute a hash directory, which replaces the original non-hashed directory object. Each hash component object contains a portion of the entries contained in the original directory object. Each hash component is managed by only one file manager. The entries in the original directory object are distributed among the hash component objects using a predefined hashing algorithm. The creation of hash components and the hash master allows more than one client application or file manager to concurrently write corresponding hash components without the need for access coordination on each access.

The invention discloses a fingerprint identifying system which comprises three large parts of a fingerprint database, a central server and a client terminal; the fingerprint database is mainly used for memorizing the fingerprint characteristic information after digital coding; the central server is mainly responsible for validating the validity of the client terminal, receiving the fingerprint characteristic data, comparing the characteristics and returning the fingerprint identifying result; the client terminal is mainly responsible for collecting the fingerprint, extracting and uploading the fingerprint characteristic data. The system overcomes the defects of the prior art, can provide an online/offline fingerprint identifying system the basic algorithm library of which can be seamlessly expanded and the functions of which can be selected and matched. The fingerprint identifying system can lead a user to obtain the ID identification and authentication services with high quality under the situation of not needing a great amount of capital investment.

The invention discloses a matrix calculation method of distributed large-scale matrix multiplication based on Spark. The method comprises the following steps of adopting a system framework based on a distributed computation execution engine Spark and single-machine BLAS (Basic Linear Algebra Subprograms); defining an operation interface related to a packaging matrix in a distributed system, reading a matrix file from a distributed file system, and selecting a proper scheme to execute the distributed multiplication for the quantity of resource of a distributed computing environment and the scale of a to-be-processed matrix; if the scales of the two matrixes are small, gathering to the locality to carry out single-machine multiplication; if the scale of one matrix is smaller, broadcasting the matrix execution multiplication; and if the scales of the two matrixes are large, adopting block-based distributed matrix multiplication. As for the latter two conditions, the invention respectively provides two efficient solutions, so that the problems of low performance and the poor expansibility of the existing big data processing platform about the distributed matrix operation are solved.

The invention discloses a cross-database distributed transaction implementation method. The method comprises the first step of receiving distributed transaction activation requests and distributing transaction identifiers to distributed transactions, the second step of receiving operation requests or an operation request collection of the distributed transactions which the transaction identifiers are distributed to for database operations, the third step of acquiring information of a target database of the database operations according to all the operation requests and sending the database operations to the target database for execution in accordance with the ACID principle, and the fourth step of clearing the distributed transactions after all the database operations are executed. The invention further provides a cross-database distributed transaction implementation device. By means of the method, the cross-database distributed transactions which are lightweight and easy to maintain and meet the ACID principle can be realized.

The invention provides a distributed monitor system and method based on streaming media service clusters. The system comprises a Hadoop-based data distributed processing framework, a distributed internal memory caching module Memcached, a relation data management module, a non-relation data management module, a streaming media service cluster module, and a load balancing module. The Hadoop-based data distributed processing framework extracts and analyzes data from a data source and performs preprocessing and distributed calculation on analyzed data. The distributed internal memory caching module Memcached caches commonly-used and temporary data in the internal memory of a server. The relation data management module achieves query, storage, management, and computation of information of an access device achieved by a monitoring system platform. The non-relation data management module achieves distributed disposition in combination with a fragment calculating method of a non-relation No-SQL data storage system. The streaming media service cluster module achieves distributed cluster processing of streaming media information transmission. The load balancing module performs balancing procession on the load of the monitoring system platform and expands WEB container level. In combination with a load balancing mechanism and database fragment calculation, the distributed monitor system improves a level expansion capability, decreases platform configuration and management workload, and maintains stability.

The invention discloses a mobile terminal cloud resource scheduling method based on a Hadoop framework, and belongs to the field of cloud computing platform data resource access. The mobile terminal cloud resource scheduling method is characterized in that a task queue is defined by nodes in a cloud computing platform based on the Hadoop framework, tasks are distributed into the task queue, where a data copy is located, of the working nodes, and when the length of the task queue, where the copy is located, of the nodes is larger than the waiting length threshold value, the tasks are removed from the task queue of the copy and added into the task queue of the shortest node in the task queue inside the framework where the copy is located to wait for being scheduled. According to the mobile terminal cloud resource scheduling method, the characteristics of being small in requested calculated amount, high in concurrency and high in user real-time requirement, of a mobile terminal are combined, the localized executing probability of the operation is greatly improved, and under the situation of a large amount of concurrent requests and the generation of hotspot data, load balancing of all the nodes in a cluster can be kept.

The invention relates to a blockchain network, an object transaction method, a device and node equipment, wherein the object transaction method comprises the steps of transmitting a transaction request of a preset object to authorized nodes in a blockchain to which a preset object transaction is related; respectively receiving transaction verification information which is obtained by each authorized node according to the received transaction request; acquiring a verification result according to the transaction verification information; and transmitting the verification result to each authorized node, wherein the verification result is used for confirming or canceling transaction of the preset object by each authorized node. According to the blockchain network, different objects correspond with different blockchains; and in a transaction confirmation process, through co-verification of the nodes in multiple blockchains, the verification result is obtained, thereby ensuring high transaction safety, reducing the length of a single blockchain, reducing data volume of each node, improving searching efficiency of the blockchain, improving gathering efficiency and statistics efficiency of single kind of objects and improving concurrence.

A system for implementing synchronized objects for software transactional memory comprises one or more processors and a memory comprising program instructions executable by the processor to implement a transactional-memory manager configured to coordinate memory access requests directed at the memory from a plurality of transactions. The transactional-memory manager records, within a collaborator record for a shared data object in the memory, identifications of a set of two or more transactions that have requested synchronization on the object. In response to a commit request from a given transaction of the set, the transactional-memory manager determines whether to commit or abort the given transaction based at least in part on the transactional states of other transactions in the set, examining the collaborator record to identify the other transactions.

The invention provides a block chain privacy protection system and method based on homomorphic encryption. The privacy protection system comprises an authentication center which is used for carrying out identity verification, issuing a certificate and periodically checking an account book; The block chain nodes are used for collecting transactions, verifying the transactions, sorting the transactions and generating blocks; Wherein the block chain nodes comprise a preprocessing node, a confirmation node and a sorting node; And a user: one user corresponds to one confirmation node. According tothe block chain privacy protection system and method based on homomorphic encryption provided by the invention, the block chain privacy protection scheme can realize transaction information confidentiality; The blockchain privacy protection scheme can ensure that the transaction information cannot be tampered; The blockchain privacy protection scheme can ensure transaction legality; The re-encryption function in the blockchain privacy protection scheme is secure.

A method for creating a workflow including at least one structured process with interdependent tasks, and a composite object involved in the process is provided. The method includes defining a model of the object, describing the composite object as an aggregate of constituent elements, wherein each element is an instance of an element type; creating a general workflow by modelling the process as a structured graph comprising tasks with an associated element type, connected according to their dependencies; and associating tasks with elements according to their type to create a specific workflow. The method comprises rearranging the tasks on the basis of the associated element type to increase the number of parallel task-element combinations in the specific workflow. A programmable processing device comprises a mechanism for automatically generating a workflow and a mechanism for operation by one or more users. The device uses the above-described method. A computer program product can be run on a computer to execute the method and automatically create a workflow.

The invention discloses a dispatching method and a system of a distributed system. The method comprises the following steps: a dispatching request comprising data reading operation is received by a data dispatcher, and data is stored in at least one entity providing data service in the distributed system; status of each data service corresponding to the dispatching request is determined by the data dispatcher, dispatching response consenting to conduct reading operation on each data service is sent by the data dispatcher when each data service is in an idle/reading status; and each data service is at least one same data service. The invention can effectively solve the defects of resource waste, low task processing efficiency and the like in the distributed dispatching method in the prior art, realizes reasonable resource utilization, and improves task processing efficiency.

The invention discloses a spatial data double cache method and a mechanism based on a key value structure, and belongs to the technical field of spatial data storage and management. A double cache mechanism of memory caching and file caching is disclosed by the spatial data double cache method and the mechanism based on the key value structure, the memory caching is first level caching, uses B+tree organizing data, and is written in the file caching by adopting a caching write-back mechanism in an asynchronous mode; the file caching is second level caching, uses large files to be built, and builds caching index based on the B+tree so as to accelerate the speed of searching; and a free space of the file caching uses free space management based on the B+tree to manage. The spatial data double cache method and the mechanism based on the key value structure have the advantages of being free in key value storage mode, fast in searching speed, high in concurrency performance and the like. Storage and visiting efficiency of spatial data caching in network environment are improved, and the spatial data double cache method and the mechanism based on the key value structure can be used for caching of generic spatial data such as remote-sensing images, vector data and dynamic effect model (DEM) in a network geographic information system (GIS).

A system and method of designing digital system. One aspect of the invention includes a method for designing an essentially digital system, wherein Pareto-based task concurrency optimization is performed. The method uses a system-level description of the functionality and timing of the digital system. The system-level description comprises a plurality of tasks. Task concurrency optimization is performed on said system-level description, thereby obtaining a task concurrency optimized system-level description, including Pareto-like task optimization information. The essentially digital system is designed based on said task concurrency optimized system-level description. In one embodiment of the invention, the description is includes a “grey-box” description of the essentially digital system.

The invention discloses a distributed small file storage system based on UDP (User Datagram Protocol) and a data processing method thereof. The system comprises a first server, a second server, a third server, a fourth server and a fifth server, wherein the first server comprises an external server and a service monitoring server; the second server comprises a global naming server and a service monitoring server; the third server comprises an information index library server and a service monitoring server; the fourth server comprises a task managing server and a service monitoring server; the fifth server comprises a storing server and a service monitoring server; and the first server, the second server, the third server, the fourth server and the fifth server mutually transfer and process data through a UDP refitting protocol. The system can enhance the concurrent ability and the high-speed I/O (Input/Output) ability of the whole platform, and solve the problems of high-capacity storage and load balance by utilizing the UDP refitting protocol as a communication protocol of an interior server, and is especially suitable for the online services taking files as carriers.

The invention discloses a parallel query method for a distributed database. In the method, due to the introduction of the design of proxy and qcs modules, a query system is able to support a high-concurrency distributed database and meets requirements of a large-sized application system. Meanwhile, based on a concept of 'dividing and ruling' query tasks, the qcs module initiates query concurrently, granularity data which can be queried quickly are fed back first, and thus, the overall query performance of the system is improved obviously and the needs for quick query of a majority of application systems are met.

The invention provides a concurrency control method, which comprises the following steps: judging whether locks conflicted with locks to be granted exist at a position of a transaction to be operated according to a lock relation table which is used for storing the relation of the transaction and the locks; granting the locks to the transaction according to a judgment result, and executing the transaction; and when the execution of the transaction is finished, releasing the locks held by the transaction, and granting the locks not needing continuously waiting in the released locks to other concurrency transactions. The invention also provides a concurrency control device, which comprises a judgment module, an execution module and a release module. The method solves the problems of low concurrency and poor system performance of transaction control by a concurrency method in related technology so as to improve the concurrency of the transaction control and concurrency control effect.

The invention discloses a millimeter wave imaging dangerous goods detection method based on FPGA and depth learning, which comprises the steps of obtaining the millimeter wave imaging pictures and identifying dangerous goods in the pictures; constructing the depth learning network model of hazardous materials detection, and using the labeled millimeter-wave imaging images to train the model to getthe trained detection model; locating the trained detection model into the detection system of FPGA platform; using the FPGA to detect the millimeter wave image to be measured; using the trained detection model to detect the collected millimeter-wave images; if the image to be measured contains hazardous materials, marking the hazardous materials category, alarming, and marking the coordinates ofthe irregular outline position of the hazardous materials at the same time. Based on the FPGA-based platform, using the depth neural network model trained by Mask R-CNN object detection framework forthe real-time foreign body detection, so that compared with ASIC chips, the method has better customizability.

The invention discloses a multi-level acceleration method of flow-based biological sequence database search, which is to accelerate the search speed of a biological sequence database on the premise of ensuring search accuracy and relatively low cost. The technical proposal is that a cluster system composed of a plurality of personal computers shall be created firstly, and a master control node machine is assigned; the master control node machine distributes the database sequence and stores into each node machine in the cluster system, so as to fill and rearrange an inquiry sequence, and distribute the inquiry sequence to all the node machines in the cluster system; each node machine executes the search task in parallel, so as to be responsible for the completion of search tasks of the inquiry sequence in a local database sequence; the master control node machine collects, summarizes and outputs the results of parallel search tasks on all the node machines. The invention makes the search tasks be executed in parallel between the n node machines of the cluster, each node machine distributes the comparative calculation task of two sequences to p hardware calculation clusters to be conducted in parallel, thereby realizing the multi-level acceleration objective in parallel of three layers including a cluster node layer, a flow-level calculation layer, as well as a flow inner core command layer.

Disclosed are “black-box leases” that protect information consistency and that allow for information sharing in a distributed file system while hiding from a client information about other clients' use of the file system. This information hiding also allows greater concurrency because changes to the file system are permitted as long as they do not affect the leases as observed by the clients. For each data field protected by a black-box lease, a client has a two-value data structure: SelfValue represents the client's intended use of the data field, and OtherValue is an aggregation of the other clients' intended uses of that data field. Knowing only this aggregate OtherValue, but without knowing any specifics of the other clients' usage patterns, the client knows how it may use the data field without adversely affecting the consistency of data in the distributed file system.

The invention provides run-time support for efficient simulation of digital hardware in a software development enviromnent, facilitating combined hardware/software co-simulation. The run-time support includes threads of execution that minimize stack storage requirements and reduce memory-related run-time processing requirements. The invention implements shared processor stack areas, including the sharing of a stack storage area among multiple threads, storing each thread's stack data in a designated area in compressed form while the thread is suspended. The thread's stack data is uncompressed and copied back onto a processor stack area when the thread is reactivated. A mapping of simulation model instances to stack storage is determined so as to minimize a cost function of memory and CPU run-time, to reduce the risk of stack overflow, and to reduce the impact of blocking system calls on simulation model execution. The invention also employs further memory compaction and a method for reducing CPU branch mis-prediction.