213results about How to "Guaranteed execution efficiency" patented technology

A system-level management unit generates a system processing and makes a processing request to a task allocation unit of a user-level management unit. The task allocation unit schedules the system processing according to a procedure of an introduced user-level scheduling. A processing unit assigned to execute the system processing sends a notification of acceptability of the system processing to a main processing unit, by halts an application task in appropriate timing or when the processing of the current task is completed. When the notification is received within the time limit for execution, the system-level management unit has the processing unit start the system processing.

The invention relates to the technical field of big data, block chains and smart contracts, and in particular to a block chain smart contract-based data transaction method. According to the block chain smart contract-based data transaction method, purchase and sale behaviors of purchasers and sellers of transactions are recorded through block chains, automatic execution of the transactions is realized by utilizing smart contracts, and big data for the transactions is not recorded in the block chains and is encrypted and stored in an external data memory, so that the purchasers only can obtain the data after the smart contracts are successfully transacted; and moreover, the purchasers can publish transactions through a supervisory block chain consensus network, so that third-party witness is realized and the security guarantee of data transactions is increased.

Database system query optimizers use several techniques such as histograms and sampling to estimate the result sizes of operators and sub-plans (operator trees) and the number of distinct values in their outputs. Instead of estimates, the invention uses the exact actual values of the result sizes and the number of distinct values in the outputs of sub-plans encountered by the optimizer. This is achieved by optimizing the query in phases. In each phase, newly encountered sub-plans are recorded for which result size and / or distinct value estimates are required. These sub-plans are executed at the end of the phase to determine their actual result sizes and the actual number of distinct values in their outputs. In subsequent phases, the optimizer uses these actual values when it encounters the same sub-plan again.

An approach for managing system capacity of a satellite communications system is disclosed. A satellite communications system provides communication services to a region. A terminal (101, 103) is located within the region and is configured to transmit and receive signals over a satellite (105) having a payload that processes the signals. The terminal (101, 103) has a predetermined profile that includes service class information and rate information. A hub (107) is configured to receive system capacity resource configuration data that reflect capacity requirements of a service provider and to determine partitioning of system capacity over the region based upon the system capacity resource configuration data. The hub (107) transmits configuration information to the payload of the satellite (105) according to the determined partitions. The terminal (101, 103) is configured to transmit a bandwidth request message to the payload. The payload selectively allocates bandwidth in response to the request message based upon the configuration information.

The present invention reduces overhead in a VLIW type microprocessor including a dynamic compiler or controls a memory capacity for storing an object code after scheduling. The present invention relates to a VLIW microprocessor including a dynamic compiler and improves operation performance of a microprocessor by executing instructions more efficiently. Specifically, one feature of the present invention is to reduce overhead accompanying execution of a dynamic compiler and to control a memory capacity for storing an object code after scheduling internal instructions by using genetic algorithm (GA) in an execution of instructions in a VLIW microprocessor including a dynamic compiler.

An object of the present invention is to enable appropriate switching among a plurality of modes including a cellular communication mode and an RFID information receiving function. A communication system is comprised of an RFID configured to transmit predetermined ID information of its own, a server capable of being connected to a cellular communication network, and an aggregation point for aggregating information from the RFID. In the communication system, the aggregation point, which is comprised of a mobile communication terminal or the like, is provided with an ID receiver for receiving ID information from an RFID, and a cellular communication part for performing cellular communication via the cellular communication network. Furthermore, the aggregation point is provided with a new mode controller for receiving a switching signal for switching among a plurality of modes including the cellular communication mode and the RFID information receiving function from the server, and for performing a mode switching control based on the received switching signal.

Database system query optimizers use several techniques such as histograms and sampling to estimate the result sizes of operators and sub-plans (operator trees) and the number of distinct values in their outputs. Instead of estimates, the invention uses the exact actual values of the result sizes and the number of distinct values in the outputs of sub-plans encountered by the optimizer. This is achieved by optimizing the query in phases. In each phase, newly encountered sub-plans are recorded for which result size and / or distinct value estimates are required. These sub-plans are executed at the end of the phase to determine their actual result sizes and the actual number of distinct values in their outputs. In subsequent phases, the optimizer uses these actual values when it encounters the same sub-plan again.

Hardware resolution of data conflicts in critical sections of programs executed in shared memory computer architectures are resolved using a hardware-based ordering system and without acquisition of the lock variable.

Techniques and structures relating to virtual graphics processing units (VGPUs) are disclosed. A VGPU may appear to software as an independent hardware GPU. However, two or more VGPUs can be implemented on the same GPU through the use of control structures and by duplicating some (but not all) hardware elements of the GPU. For example, additional registers and storage space may be added in a GPU supporting multiple VGPUs. Different execution priorities may be set for tasks and threads that correspond to the different supported VGPUs. Memory address space for the VGPUs may also be managed, including use of virtual address space for different VGPUs. Halting and resuming execution of different VGPUs may allow for finer-grained execution control, and for better GPU efficiency.

The invention provides an edge-cloud heterogeneity-oriented multi-level transaction scheduling allocation strategy, which comprises the following implementation steps that firstly, information of alltransactions generated at all data sources is collected, and the information of the transactions comprises the data size of the transactions, the size of transaction calculation amount, the size of received data, the data sources, the size of sent data, the data direction and the like; Secondly, arranging the transaction information to form a complete transaction dependency graph, and representingthe complete transaction dependency graph with a directed acyclic graph; And then, whether the transaction is processed at a cloud end or an edge server is judged, the priority of the transaction isjudged by utilizing a reasonable transaction priority heuristic algorithm, and a transaction queue with the priority from high to low is formed. And finally, determining the resource node for executing the transaction according to the load balance, the transaction waiting time, the transaction emergency degree and the resource node power consumption among the resource nodes, and finding out an optimal resource allocation scheme, thereby achieving the purpose of improving the system efficiency.

A method and system is provided for computing an approximation of the number of distinct results of a query over a relational data source. The approximation uses information about dependencies between fields of relations, in particular the number of distinct values of a field for each possible value of another field. This information can be obtained by analysis of the data stored in the relational data source, or may be specified as annotations to a database schema. An approximation of the number of results is and the dependencies between fields of each part of the query are computed. The approximation can be used to reorder parts of a query, by using the estimated size of parts to guide reordering. The approximation can further be used to determine which parts of a query are relevant to the evaluation of a subquery, which can be used to guide the magic sets transformation.

The invention discloses a weighted decision and random scheduling method based on physical heterogeneous redundancy. Different unicast, multicast routing protocols are executed in each routing protocol processing unit, and a calculation result is output to a multi-mode decision unit; the multi-mode decision unit decides the calculation result of each routing protocol processing unit, and deliversand outputs a final decision result to a data forwarding plane; a redundancy scheduling unit builds a routing protocol pool, performs protocol setting on each routing protocol processing unit, recordsand calculates each decision result, and then dynamically and randomly schedules the routing processing unit according to the calculation result. Due to design of the routing mechanism with the heterogeneous redundant decision function, the invention provides a weighted multi-mode decision method to compare output results of multiple heterogeneous routing function execution bodies, so as to perform multi-mode decision on final routing selection, dynamic random scheduling selection is performed on the execution bodies through a trust degree weight, then a simulation defense capability of a switch routing control plane is realized.

The invention discloses a set-top box-based secure information transmission system and a set-top box-based secure information transmission method. The secure information transmission system comprises a secure algorithms library, a key management component, an authentication component, an encryption / decryption component and a verification component; the secure algorithms library is used for providing transmission encryption and decryption algorithm supports; the key management component is used for managing a public key and a private key of a user and generating a dynamic key; the authentication component is used for determining the identities of double data transmission parties; the encryption / decryption component is used for implementing encryption and decryption of data; and the verification component is used for verifying validity and integrity of the received decrypted data. According to the technical scheme, the transmission of the sensitive data on a set-top box is safer and more efficient by combining a symmetric encryption algorithm and an asymmetric encryption algorithm.

The invention provides a column-based storage and research method and equipment based on a hard disk and the internal storage. A data sheet structure on data source is created in the internal storage through creating metainformation of the data sheet corresponding to the data source, and a column-based data block is generated on the current data according to the metainformation and is stored into the hard disk; the internal storage can be used more effectively, the following query data performance in the hard disk reaching the similar performance with the query data in the internal storage is realized, and the strong data analysis ability based on high-speed query efficiency can be further supported in following; moreover, when the column is an index column, the following data query efficiency can be improved by establishing a reverse index for each index column and storing the index column to the document at corresponding position in a solid state disk with the adoption of RadixTree structure.

The invention provides a test platform for large energy storage converters, comprising an energy storage converter connected with an upper computer monitoring system. The input end and the output end of the energy storage converter are respectively connected with a power grid through a battery simulation system and an anti-islanding detection device. An energy storage converter detection device is connected across the two ends of the energy storage converter. The battery simulation system includes an energy management device. Compared with the prior art, the test platform for large energy storage converters, provided by the invention, is strong in applicability and stable in performance and can effectively improve the test accuracy of electric performance and grid connection performance of large energy storage converters.

The invention provides a quantum key-based authentication method and authentication device. The method comprises the steps of receiving a first authentication request sent by a first device, wherein the first authentication request comprises identity of the first device, identity of a second device, first key identity, and a first authentication ciphertext encrypted by using a first quantum key corresponding to the first key identity; determining the first quantum key according to a pre-stored correspondence relationship between the first key identity and the first quantum key; decrypting thefirst authentication ciphertext by using the first quantum key, and authenticating the decrypted first authentication ciphertext; when an authentication success result is received, encrypting the identity of the first device by using a second quantum key, and generating a second authentication request, wherein the second quantum key is a shared key between an authentication server and the second device; and sending the second authentication request to the second device. In the prior art, the authentication efficiency is low due to use of a public key algorithm. The authentication method and authentication device solve the problem in the prior art.

An integrated simulation system, for integrally simulating a simulation target having a plural number of elements therein, comprises: simulators, each being provided, independently, for each of the elements, for simulating those elements, respectively; and a corporation means having a common data area for connecting the plural number of simulators accessible thereto. The corporation means has a time management means for managing simulation time, when a synchronization request is issued from anyone of those simulators.

The invention discloses an IO (Input Output) double-buffer interactive multicore processing method for a remote sensing image. The method comprises the following steps of determining the quantity of multicore computing threads according to the quantity of CPU (Central Processing Unit) cores of a processing system; determining various data segmentation strategies according to various remote sensing image processing algorithms; starting each remote sensing image processing computing thread, starting to execute the remote sensing image processing algorithms and sending a data access request and an output request during the period; reading or writing in a data request according to the computing threads, starting a reading-writing data thread, reading image data into buffer memories R1 and R2 in order according to a predetermined reading segmentation strategy, and writing processed result data into writing buffers W2 and W1 in order; and destructing the reading-writing double-buffer and ending the reading-writing thread and each computing thread till the completion of the computing process according to the processing algorithms and the stopping of data reading-writing visit. With the adoption of the IO double-buffer interactive multicore processing method for the remote sensing image, the resource utilization rate of a multicore CPU and the efficiency of disk IO visit are improved, and a contradiction between limited memory space and mass remote sensing data processing is solved.

The invention provides a web page element positioning method, apparatus and system. The method includes the steps of obtaining at least two positioning information of one or more web page elements of a web page to be tested, determining the optimal positioning information in the at least two positioning information, and using other positioning information for updating the optimal positioning information when the optimal positioning information cannot be used for positioning the web page elements and at least one other positioning information capable of being used for positioning the web page elements. The web page element positioning method, apparatus and system is used for quickly positioning the web page elements, improves the execution efficiency of the positioning of the web page elements, can automatically repair the positioning information of the web page elements, ensures the self-adaptability of the positioning information of the web page elements to the maximum extent and effectively reduces the maintenance cost of the positioning information of the web page elements.

One embodiment of the present invention provides a system for estimating parasitic capacitance for an integrated circuit. During operation, the system reads a technology file, which describes the composition of a vertical cross-section of the integrated circuit. Next, the system reads a design file, which specifies the layout of the integrated circuit. The system then identifies a set of dielectric configurations based on information contained in the technology file. It then computes Green's function for each of these configurations. Next, the system estimates a parasitic capacitance using information contained in the design file and using the set of Green's functions.

The present invention provides method, data transfer controller and system for asynchronously transferring data. The method allows to provide a buffer device. The method further allows to define in the buffer device a plurality of buffer segments. Respective ones of the buffer segments are filled with data from at least one data source device operating in a respective clock domain. Upon any respective buffer segment being filled up, the method allows to generate an indication of availability of the contents of the respective buffer segment to at least one data destination device operating in a respective clock domain. The clock domain of the at least one source device is distinct than the clock domain of the at least one destination device.

The invention provides a permanent magnet synchronous motor servo driver based on a double-core MCU (Micro-programmed Control Unit) and a control method, which are used for carrying out high-precision position servo control on a permanent magnet synchronous motor. A hardware part mainly comprises a double-core MCU circuit, a position sensor interface circuit, a power amplification circuit, a peripheral interface circuit and a communication interface circuit. On one hand, the driver is used for processing a motor control algorithm and a communication control protocol by adopting independent microcontroller inner cores respectively, so that the timeliness of communication is guaranteed and influences, caused by the communication, on a control algorithm performance are eliminated. On the other hand, the driver can be used for controlling a motor through a position senor and can also operate a position-free sensor control algorithm; software is switched in real time under two working modes so that the reliability of a system is improved.

A relational database management system having an XML storage implementation to reduce overhead associated with consuming data from multiple data providers, where each having proprietary database schemas. The XML storage solution allows data from any arbitrary relational database schema to be loaded, rearranged and retrieved. The present invention is directed to an implementation of an edge table such that large volumes of XML data of any structure can be stored effectively. The edge table may be designed as one large XML document where the schema information is stored separately from the instances, and relationships and constraints are expressed using foreign keys. The edge table further provides for full type support and validation. Indices and clustering provide efficient data access and query execution.

The invention discloses a circular target real-time tracking method based on images, wherein the method is used to solve the problem of poor tracking stability with a circular target when moved from a far position to a near position. The method comprises the following steps: at first, a Kalman filter is constructed according to a state equation and an observation equation of the circular target, the circle center coordinate and the radius obtained in the target capturing process are taken as the initial state of the filter, prediction information of the target in the current frame is established, and the search range is reduced; then, a tracking frame is constructed according to the prediction information, and images in the tracking frame are extracted through the fast Hoff gradient method to perform circular target detection to acquire the position information of the target in the current monment; and finally, the new position is taken as the observation value of the Kalman filtering process to update filtering parameters and updata target state estimation and error covariance matrix. The above steps are performed repeatedly to realize fast and effective circular target tracking in illumination variable and background confused scenes.

In a multitasking computer system, data is preloaded into cache memory upon the occurrence of a context switch. To this end, processing circuitry stops executing a computer program during a first context switch in response to a first context switch command. Later, the processing circuitry resumes executing the computer program during a second context switch in response to a second context switch command. The memory control circuitry, in response to the second context switch command, identifies an address of computer memory that is storing a data value previously used to execute an instruction of the computer program prior to the first context switch. The memory control circuitry then retrieves the data value from the computer memory and stores the retrieved data value in the cache memory. Accordingly, the retrieved data value is available to the processing circuitry for use in executing instructions of the computer program after the second context switch without the processing circuitry having to request retrieval of the foregoing data value.

The invention discloses a distributed computing method and device. The method comprises the steps of generating an input vector Vector according to input data; acquiring a preset operator and the dependency of the preset operator on the Vector; carrying out multiple map computations by means of a mapping module Map till the end condition of the preset operator is met, wherein during each map computation, data are acquired from the Vector according to the dependency so that computation can be carried out according to the preset operator and corresponding data in the Vector can be updated according to computing results. The distributed computing method and device are widely used in distributed computation of various machine learning and can guarantee executing efficiency with lower cost.