Patents
Literature
Hiro is an intelligent assistant for R&D personnel, combined with Patent DNA, to facilitate innovative research.
Hiro

915results about How to "Reduced execution time" patented technology

Method and system for allocation of special purpose computing resources in a multiprocessor system

A method and system for allocating special-purpose computing resources in a multiprocessor system capable of executing a plurality of threads in a parallel manner is disclosed. A thread requesting the execution of a specific program is allocated a special-purpose processor with the requested program loaded on its local program store. The programs in the local stores of the special-purpose processors can be evicted and replaced by the requested programs, if no compatible processor is available to complete a request. The thread relinquishes the control of the allocated processor once the requested process is executed. When no free processors are available, the pending threads are blocked and added to a request-queue. As soon as a processor becomes free, it is allocated to one of the pending threads in a first-in-first-out manner, with special priority given to a thread requesting a program already loaded on the processor.
Owner:CODITO TECH

Massively computational parallizable optimization management system and method

A distributed processing system, program product and method of executing a computer program distributed across a plurality of computers. First, interested participants register and provide a commitment for available excess computer capacity. Participants may enter a number of available hours and machine characteristics. A normalized capacity may be derived from the machine characteristics and a normalized excess capacity may be derived from the number of hours committed for the participant. New registrants may be assigned benchmark tasks to indicate likely performance. Parties may purchase capacity for executing large computer programs and searches. The computer program is partitioned into multiple independent tasks of approximately equal size and the tasks are distributed to participants according to available excess capacity. A determination is made whether each distributed task will execute within a selected range of other distributed tasks and, if not, tasks may be reassigned. The likelihood that a task will complete may be based on the participant's past performance. As each task is completed, the completing participant is checked to determine if the task is on schedule. Any task assigned to computers that are found to be behind schedule may be reassigned to other participants. A check is made to determined whether each task is assigned to at least one participant and several tasks may be assigned to multiple participants. Once all tasks are complete, the best result is selected for each task. Each participant may be compensated for normalized excess capacity and that compensation and charges to requesting parties may be based on total available normalized capacity.
Owner:TWITTER INC

Multiple inspection robot cooperative operation method for substation sequence control system

ActiveCN102566576AShort driving routeIn place detection time is fastPosition/course control in two dimensionsSequence controlLoop control
The invention discloses a multiple inspection robot cooperative operation method for a substation sequence control system. When the closed-loop control and the state visualization of the intelligent substation sequence control system are implemented, the executing and checking time of the sequence control system can be effectively saved by adopting the method. The invention provides the multiple inspection robot cooperative operation method which comprises the following steps: modeling by adopting a topological method on the basis of the substation environment, forming a topological network chart and a communication relation matrix according to walking routes of inspection robots, and carrying out search and traversal of paths to output a discharge matrix and a shortest path matrix; in the single-step sequence control process, determining a shortest communication path sequence of each inspection robot from a current position to a target point according to the distance matrix and the shortest path matrix; carrying out excellence selection of single-step sequence control, i.e. selecting the inspection robot with the optimal performance under the condition of considering comprehensive indexes of journey, time, safety and maneuverability; determining an operation path sequence of each inspection robot and a corresponding activation event; and carrying out on-line monitoring, wherein if the environment is changed, the on-line monitoring takes charge of debugging and recovering operation.
Owner:STATE GRID INTELLIGENCE TECH CO LTD

Copy planning in a concurrent garbage collector

A garbage collector is disclosed that permits extensive separation of mutators and the garbage collector from a synchronization perspective. This relative decoupling of mutator and collector operation allows the garbage collector to perform relatively time-intensive operations during garbage collection without substantially slowing down mutators. The present invention makes use of this flexibility by first conservatively determining which objects in a set of regions of interest are live, then planning where to copy the objects (preferably including clustering), and finally performing the actual copying.
Owner:CLAUSAL COMPUTING

Authentication system executing an elliptic curve digital signature cryptographic process

An authentication system and a method for signing data are disclosed. The system uses a hardware software partitioned approach. In its implementation the system of the invention compares favourably with performance and other parameters with a complete hardware or full software implementation. Particularly, advantageously there is a reduced gate count. Also as disclosed in the invention the system makes it difficult for hackers to attack the system using simple power analysis.
Owner:TATA CONSULTANCY SERVICES LTD

Dimension context propagation techniques for optimizing SQL query plans

Techniques for efficient execution of queries. A query plan generated for the query is optimized and rewritten as an enhanced query plan, which when executed, uses fewer CPU cycles and thus executes faster than the original query plan. The query for which the enhanced query plan is generated thus executes faster without compromising the results obtained or the data being queried. Optimization includes identifying a set of one or more fact scan operations in the original query plan and then, in the rewritten enhanced query plan, associating one or more dimension context predicate conditions with one or more of the set of fact scan operations. This reduces the overall cost of scanning and / or processing fact records in the enhanced query plan compared to the original query plan and makes the enhanced query plan execute faster than the original query plan.
Owner:ORACLE INT CORP
Who we serve
  • R&D Engineer
  • R&D Manager
  • IP Professional
Why Eureka
  • Industry Leading Data Capabilities
  • Powerful AI technology
  • Patent DNA Extraction
Social media
Try Eureka
PatSnap group products