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

149results about How to "Reduce the number of calls" patented technology

Thread for high-performance computer NUMA perception and memory resource optimizing method and system

ActiveCN104375899ASolve the problem of excessive granularity of memory managementSolve fine-grained memory access requirementsResource allocationComputer architecturePerformance computing
The invention discloses a thread for high-performance computer NUMA perception and a memory resource optimizing method and system. The system comprises a runtime environment detection module used for detecting hardware resources and the number of parallel processes of a calculation node, a calculation resource distribution and management module used for distributing calculation resources for parallel processes and building the mapping between the parallel processes and the thread and a processor core and physical memory, a parallel programming interface, and a thread binding module which is used for providing the parallel programming interface, obtaining a binding position mask of the thread according to mapping relations and binding the executing thread to a corresponding CPU core. The invention further discloses a multi-thread memory manager for NUMA perception and a multi-thread memory management method of the multi-thread memory manager. The manager comprises a DSM memory management module and an SMP module memory pool which manage SMP modules which the MPI processes belong to and memory distributing and releasing in the single SMP module respectively, the system calling frequency of the memory operation can be reduced, the memory management performance is improved, remote site memory access behaviors of application programs are reduced, and the performance of the application programs is improved.
Owner:INST OF APPLIED PHYSICS & COMPUTATIONAL MATHEMATICS

JavaScript code optimization method based on front-end byte code technology

The invention discloses a JavaScript code optimization method based on a front-end byte code technology. According to the method, a conversion tool chain from JavaScript to WebAssembly is provided, acode segment merging strategy is designed, and then a JavaScript performance optimization scheme is provided; and variable type information of each execution path of the program is obtained through dynamic symbolic execution, and a code statement according with a conversion condition is obtained through a screening rule, a C code is generated from a JavaScript code by designing a JavaScript 2C conversion rule, and a WebAssembly code segment is generated through Exscript compiling. And finally, the performance and function consistency before and after optimization are compared through a unit test idea, and the optimization of the code segment is given up if the performance is reduced or the functions are inconsistent. On the other hand, a code segment merging strategy is designed, on the basis of the data dependence relation between the code segments, the code segment merging strategy is provided as the basis of user code reconstruction, the purpose of reducing data interaction performance losses is achieved, and the execution efficiency of the program is further improved.
Owner:NORTHWEST UNIV(CN)

An OPU instruction set definition method for CNN acceleration

ActiveCN110058882ASolve universalityAvoid unpredictable instruction orderingNeural architecturesEnergy efficient computingProcessor registerGranularity
The invention discloses an OPU instruction set defining method for CNN acceleration, and relates to the field of instructions of CNN acceleration processors, and the method comprises the steps of defining a conditional instruction, defining an unconditional instruction and setting the instruction granularity, wherein the unconditional instruction provides configuration parameters for the conditional instruction, the conditional instruction sets a trigger condition, the trigger condition is hard-written in hardware, the conditional instruction sets a trigger condition register corresponding tothe conditional instruction, the conditional instruction is executed after the trigger condition is met, the unconditional instruction is directly executed after being read, and the content of the parameter register is replaced. According to the CNN network and acceleration requirements, the calculation modes of the parallel input and output channels are selected, and the instruction granularity is set. The instruction set provided by the invention avoids the problem that the order of the instructions cannot be predicted due to large uncertainty of the operation period. The instruction set andthe corresponding processor OPU can be realized by an FPGA or an ASIC. The OPU can accelerate different target CNN networks, and hardware reconstruction is avoided.
Owner:深圳市比昂芯科技有限公司

Non-recursive SC decoding likelihood ratio determining method and device

The invention relates to a non-recursive SC decoding likelihood ratio determining method and device, and aims at solving the defects that the number of times of calling a recursive function by the existing recursive SC decoding algorithm is too much, and the space complexity is relatively high. The non-recursive SC decoding likelihood ratio determining method provided by the invention comprises the following steps of sequentially computing f2, f4 to fN when (formula) is computed; and sequentially computing (formula) when (formula) is computed, wherein fj represents that a likelihood ratio of the jth layer is computed by using a formula f, and gj represents that the likelihood ratio of the jth layer is computed by using a formula g. The non-recursive SC decoding likelihood ratio determiningdevice comprises a first computing module and a second computing module, wherein the first computing module is used for sequentially computing f2, f4 to fN when i is equal to 1, namely (formula) needs to be computed; the second computing module is used for sequentially computing (formula) when i is not less than 2 and not greater than N, namely (formula) needs to be computed. According to the method and the device, an SC decoding algorithm is realized by adopting a non-recursive mode, the number of times of calling the recursive function is reduced to zero, and the coding rate is improved. Inaddition, by adopting a time division multiplexing storage mode for the likelihood ratio, the space complexity of the algorithm is reduced to 0(N).
Owner:HARBIN INST OF TECH

Government affair data synchronization method, device and system, computer equipment and storage medium

The invention relates to a government affair data synchronization method, device and system, computer equipment and a storage medium. The method comprises the steps of obtaining a synchronization task; wherein the synchronization task is created after it is detected that government affair data updating operation of the source platform is completed; determining target government affair data and a target synchronization mode according to the synchronization task; wherein the target government affair data is changed government affair data on the source platform corresponding to the updating operation; and synchronizing the target government affair data to the target platform according to the target synchronization mode. By adopting the method, the data volume to be synchronized can be reduced; the synchronization task is not easy to lose in the synchronization process, the creation of the synchronization task does not need the comparison operation of total data, the calling frequency of the synchronization interface is reduced, millisecond-level government affair data synchronization can be realized, the real-time accuracy of data synchronization is ensured, and the performance of a synchronization system and the use experience degree of a user are effectively improved.
Owner:数字广东网络建设有限公司

Automatic scheduling method and system for shipping space information, storage medium and electronic equipment

The invention provides an automatic scheduling method and system for shipping space information, a storage medium and electronic equipment. The scheduling method comprises the following steps that: classifying all air lines into popular air lines and unpopular air lines; carrying out statistics on the current-day full cabin rate of each popular air line; according to the average full cabin rate of each popular air line in previous several days, judging whether the current-day full cabin rate is abnormal or not; traversing each selected popular air line, and judging whether the current-day full cabin rate falls into a full cabin rate standard reaching range or not; carrying out up-regulation on the instruction calling frequency of the popular air line of which the current-day full cabin rate is greater than the maximum value of the full cabin rate standard reaching range according to a first ratio in a current day; and carrying out down-regulation on the instruction calling frequency of the popular air line of which the current-day full cabin rate is smaller than the minimum value of the full cabin rate standard reaching range according to a first ratio in the current day. According to air line characteristics and a time cycle, instruction calling frequency is automatically regulated, the instruction calling frequency of the unpopular air line can be properly reduced while the full cabin rate of the popular air line is reduced so as to realize a purpose that operation cost is saved while user booking experience is improved while an integral full cabin rate is lowered.
Owner:CTRIP TRAVEL NETWORK TECH SHANGHAI0

Non-recursive SC decoding partial sum determination method and device

The invention relates to a non-recursive SC decoding partial sum determination method and device. The method is proposed for solving the defect that the existing recursive SC decoding algorithm is frequent in recursive function calling and high in space complexity. The non-recursive SC decoding partial sum determination method comprises the following steps: outputting partial sum of a M0 node corresponding to the formula as shown in description, wherein the M0 node represents a leaf node of a sub-tree taking the formula as shown in description as a root node, and ki is the maximum recursive depth of the likelihood ratio computation when estimating the formula as shown in description; executing the following operations for 2k-1 times so as to compute the partial sum of the node Mk: formulaas shown in description, wherein i is not less than 0 and less than 2k-1; upwardly computing along the rightmost side until the node as shown in description finally outputs the value of the formula asshown in description. The SC decoding algorithm is realized by using the non-recursive way, the calling frequency of the recursive function is reduced to zero, and the decoding rate is improved. Furthermore, the algorithm space complexity is reduced to O(N) by adopting the time-division multiplexing storage way for the likelihood ratio and the partial sum.
Owner:HARBIN INST OF TECH
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