Patents
Literature
Patsnap Eureka AI that helps you search prior art, draft patents, and assess FTO risks, powered by patent and scientific literature data.

115 results about "Register assignment" patented technology

GPU-based RISC-V instruction set optimization method, system and device, and medium

PendingCN119127308AImprove performanceReduce steps to load into general purpose registersCode compilationMachine execution arrangementsRegister allocationComputer architecture
The invention relates to the technical field of processors of RISC-V architecture, and relates to a GPU-based RISC-V instruction set optimization method and device, and a medium. The method comprises the steps that an RISC-V instruction set is expanded, and a calculation instruction capable of accessing a memory is added; in an assembly programming stage, directly loading data from a memory in a calculation instruction; in a high-level programming language programming stage, through an inline assembly mode, an optimization instruction is packaged into an inline function, and a high-level language interface is provided for high-level language programming; and performing register allocation strategy optimization in the compiler, balancing the use frequency of the general register, and supporting and optimizing the inline function. According to the method, the performance of the RISC-V architecture GPU in processing complex computing tasks is remarkably improved. According to the optimization, the step of loading unnecessary data into the general register is reduced, so that the register competition is reduced, and the parallel processing efficiency is improved.
Owner:SHANDONG INSPUR SCI RES INST CO LTD

Register overflow optimization method and device, storage medium and program product

The embodiment of the invention provides a register overflow optimization method and device, a storage medium and a program product, and relates to the technical field of chips, and the method comprises the step of performing register allocation on a target thread for executing an operator in an operator compiling process. And if the register overflows in the process of executing the register allocation, writing the overflowed virtual register to a target stack space corresponding to the target thread in the on-chip cache. According to the method and the device, the corresponding target stack space is set for the target thread in the on-chip cache, and the access speed of the on-chip cache is higher compared with the access speed of a video memory, so that when register overflow occurs in register allocation for the target thread, the access speed of the on-chip cache is improved. According to the method, the overflowed virtual register is written into the target stack space corresponding to the target thread in the on-chip cache, so that the access speed to the stack space is higher, the delay caused by register overflow is reduced, and the operator performance is improved.
Owner:SHANGHAI BIREN TECH CO LTD

Dynamic accumulator allocation

The invention relates to dynamic accumulator allocation. A system includes a graphics processing unit (GPU) including at least one processor and a plurality of registers. In some examples, based on execution of an instruction by at least one in at least one processor, a particular number of registers is allocated to a thread, and the number of registers is assigned to the thread. In some examples, a compiler is to account for register requirements of a code segment and the number of registers available in determining the number of registers for allocation to the code segment.
Owner:INTEL CORP

Register allocation method and device, electronic equipment and computer readable storage medium

The invention provides a register allocation method and device, electronic equipment and a computer readable storage medium, and the method comprises the steps: in a program compiling process, determining a target register allocation algorithm corresponding to a target execution body in a program; wherein the target executive body is an executive body which carries out register allocation at present in the program; the executive is a function in the program or a variable distribution area in the function; the target register allocation algorithm is a register allocation algorithm with an optimal algorithm evaluation index value in preset register allocation algorithms; the algorithm evaluation index value represents the distribution level of variables in the target execution body under a register distribution algorithm; and storing a register allocation result of performing register allocation on the target execution body by using the target register allocation algorithm. According to the application, the register distribution of the program can be more reasonable, and the execution speed of the compiled program can be improved.
Owner:PHYTIUM TECH CO LTD

Compiler optimization method and device and storage medium

The invention discloses a compiler optimization method and device and a storage medium, and belongs to the technical field of computers. The method comprises the steps of obtaining a vector length corresponding to an access operation in a compiling language; the vector length is related to the number of elements included in the memory address to be accessed; under the condition that the vector length is not the power of the preset numerical value and the vector length is greater than a preset threshold value, splitting the access operation according to the vector length to obtain a plurality of sub-access operations; and according to the plurality of sub-access operations, optimizing repeated operations in the compilation language to obtain a compilation optimization result. By standardizing the access operation in the intermediate language of the compiler and splitting the access operation into a plurality of sub-access operations, the repeated sub-access operations in the intermediate language can be eliminated; moreover, in the instruction scheduling process after register allocation, based on the instructions corresponding to the multiple sub-access operations, access conflicts specific to hardware can be eliminated, and the accuracy of compiler optimization results is improved.
Owner:SHENZHEN INTELLIFUSION TECHNOLOGIES CO LTD

Register overflow optimization method and device and storage medium

The embodiment of the invention provides a register overflow optimization method and device and a storage medium, and is applied to the technical field of chips. In the method, for each virtual register in a target program, based on a physical register type supported by an instruction operand where the virtual register is located, the virtual register is optimized; selecting a corresponding target register class from N candidate register classes, wherein N is greater than 1; allocating a first physical register in the target register class to the virtual register; when register overflow occurs, a target register is selected from the allocated first physical registers, the instruction operand stored in the target register overflows to the second physical registers in the other N-1 candidate register classes, and compared with the mode that the instruction operand overflows to the memory to generate read-write operation on the memory, the instruction operand stored in the target register overflows to the second physical registers in the other N-1 candidate register classes; according to the method, different types of physical registers are overflowed, read-write operation aiming at the physical registers is generated, the pressure of the registers is relieved, the performance overhead of the overflowed memories is reduced, and the register distribution efficiency is improved.
Owner:SHANGHAI BIREN TECH CO LTD

Register management method and device, electronic equipment and storage medium

The invention relates to a register management method and device, electronic equipment and a storage medium. The method comprises the following steps: allocating a shared on-chip storage space for registers of a plurality of processing units in processing equipment; setting a write-in mark corresponding to the register of each processing unit in an array of the processing equipment; in response to execution of the first command, reading register data of the target register from the off-chip storage space, storing the register data in the on-chip storage space, and setting a write-in mark corresponding to the target register in the array to be valid; and in response to execution of the second command, determining an effective target write-in mark from the array, reading register data corresponding to the target write-in mark from the on-chip storage space, and writing the register data into a target register of the processing unit indicated by the target write-in mark. The embodiment of the invention can improve the operation efficiency of the processing equipment.
Owner:MOORE THREADS TECH CO LTD

Register allocation for multi-phase task

A method of rendering in a graphics processing system comprising compiling a program for a dual phase fragment task by a compiler, the first phase of the program being executed at a fragment rate and the second phase or the program being executed at a sample rate with the compiler being configured to determine data comprising the number of registers required per fragment in the first phase, the number of registers common between the first and second phase per fragment and the number of registers required per sample for the second phase to a processor. The compiled program and data are provided to a processor comprising the number of registers required per fragment in the first phase, the number of registers common between the first and second phase per fragment and the number of registers required per sample for the second phase. The processor obtains a fragment shading rate value and uses this together with least the number of registers required in the compiled program to compute the number of registers needed per fragment.
Owner:IMAGINATION TECH LTD

Allocation of Resources to Tasks

A method of managing resources in a graphics processing pipeline includes, in response to selecting a task for execution within a texture / shading unit, allocating to the task both a static allocation of temporary registers for the entire task and a dynamic allocation of temporary registers. The dynamic allocation comprises temporary registers used by a first phase of the task only and the static allocation of temporary registers comprises any temporary registers that are used by the program and are live at a boundary between two phases. When the task subsequently reaches a boundary between two phases, the dynamic allocation of temporary registers are freed and a new dynamic allocation of temporary registers for a next phase of the task is allocated to the task.
Owner:IMAGINATION TECH LTD

Register allocation for multi-stage tasks

The invention discloses register allocation of multi-stage tasks. Within a graphics processing system, a plurality of different shading programs may be executed by a single processor on multiple threads. For each shading program, a plurality of registers are used to store data for the respective shading program. Accordingly, for a plurality of shading programs executing on a plurality of threads, a plurality of registers are allocated to each program or thread being executed. However, there is a limited number of registers available, so efficient allocation of the registers optimizes performance. Generally, an unnecessary number of registers is assigned to each shading program, but the present invention provides a method of assigning a correct number of registers based on the size of a segment being shaded.
Owner:IMAGINATION TECH LTD

Memory aware register allocator for graphics processing units

Aspects presented herein relate to methods and devices for graphics processing units including an apparatus. The apparatus may load a set of values from a plurality of memories to a set of registers, where the plurality of memories includes at least one first memory and at least one second memory. Further, the apparatus may determine whether (1) a storage level for the at least one second memory is less than a maximum storage level, or (2) at least one first value in the set of values is selected for a register spill operation and will be utilized for an instruction that is after an instruction threshold. The apparatus may also store (1) the at least one first value in the at least one second memory or (2) at least one second value in the set of values in the at least one second memory.
Owner:QUALCOMM INC

Register Allocation of Uniformized Multi-Core Programs

A computer-implemented method for allocating registers for multi-core programs. The method includes generating core-specific programs for execution units of cores, wherein each program contains core-specific configurations. The method includes analyzing the core-specific programs to identify core-specific differences. The method includes creating a uniformized program that consolidates semantics of all programs for the execution units while retaining operations to account for core-specific differences. The method includes performing live range analysis of the uniformized program to identify active intervals for variables and creating segmented live ranges to partition the intervals into global and core-specific segments. The method includes allocating registers to the execution units using the segmented live ranges and multi-casting the uniformized program to the execution units of the cores.
Owner:INTERNATIONAL BUSINESS MACHINE CORPORATION

Multiple register allocation sizes for threads

Provision of multiple register allocation sizes for threads is described. An example of a system includes one or more processors including a graphics processor, the graphics processor including at least a first local thread dispatcher (TDL) and multiple processing resources, each processing resource including a plurality of registers; and memory for storage of data for processing, wherein the one or more processors are to determine a register size for a first thread; identify one or more processing resources having sufficient register space for the first thread; select a processing resource of the one or more processing resources having sufficient register space to assign the first thread; select an available thread slot of the selected processing resource for the first thread; and allocate registers of the selected processing resource for the first thread.
Owner:INTEL CORP

Register resource allocation method, computer equipment, readable storage medium and program product

The invention relates to a register resource allocation method, computer equipment, a readable storage medium and a program product. The method comprises the following steps: constructing a function group through a calling relationship between functions, wherein the function group comprises a coroutine kernel function and at least one coroutine subfunction; creating a resource record table corresponding to the function group, wherein the resource record table is used for recording register resources allocated to coroutine kernel functions and / or coroutine sub-functions in the function group; and carrying out register allocation on the coroutine kernel function and the coroutine sub-function in the function group based on the resource record table. By adopting the method, the requirements of local variable register resource isolation and shared variable register resource consistency in a collaborative mode can be met, so that the parallel computing efficiency is improved.
Owner:SHANGHAI BIREN TECH CO LTD

Staged multi-policy instruction scheduling method and system for VLIW architecture

This invention discloses a staged multi-policy instruction scheduling method and system for VLIW architecture. The method includes: basic step S1. Receiving the symbolic assembly structure (SAS); S2. Configuring three types of scheduling vision interfaces and registering corresponding scheduling policies, including a global vision interface, a loop vision interface, and a linear vision interface; S3. Executing loop vision scheduling, traversing all loop blocks, and concurrently calling the loop vision interface to generate candidate scheduling schemes; S4. Executing linear vision scheduling, after all loop blocks have been scheduled, traversing the remaining unscheduled basic blocks, and concurrently calling the linear vision interface to generate candidate schemes; S5. Performing competitive selection and register allocation on the candidate scheduling schemes generated in each stage; S6. Outputting the optimized SAS. This invention can efficiently adapt to various VLIW processor architectures, improving instruction-level parallelism and code execution efficiency.
Owner:NAT UNIV OF DEFENSE TECH

Apparatus and Method for Elimination of Load Execution by Combining Loads Directed to the Same Cache Line

PendingUS20260099330A1Concurrent instruction executionLoad instructionTrace table
An apparatus and method for eliminating load instruction execution. For example, one embodiment includes: circuitry to track execution of a plurality of load instructions and responsively update tracking tables; allocation circuitry to allocate a first source register to an instance of the first load instruction and to identify locations of the corresponding data elements in the cache line based on the tracking tables; execution circuitry to load data corresponding to the instance of the first load instruction from the cache line and to load the data elements corresponding to instances of the subsequent load instructions to the same source register; the allocation circuitry to indicate the first source register to the instances of the subsequent load instructions and respective locations of the data elements in the first source register, the instances of the subsequent load instructions to move the respective data elements from the first source register to destination registers.
Owner:RANGANATHAN ADITHYA +6

Coalescing operand register file for graphical processing units

A system and method for register coalescing is described. The system comprises a CORF, a coalescing-aware register file design for GPUs that simultaneously reduces the leakage and dynamic access power, while improving the overall performance of the GPU. CORF achieves these properties by enabling the reads to multiple operands that are packed together to be coalesced, reducing the number of reads to the RF, and improving dynamic energy and performance. CORF combines compiler-assisted register allocation with a reorganized register file (CORF++) in order to maximize operand coalescing opportunities.
Owner:RGT UNIV OF CALIFORNIA

Random instruction sequence generation method, generator and verification system

The invention provides a random instruction sequence generation method, a random instruction sequence generator and a random instruction sequence verification system. N instances are created according to microinstruction quantity parameters in a target test case; determining an instruction slot identifier and a target instruction library corresponding to each instance according to the number of instruction slots; determining a matching instruction of the instance according to the target instruction library; performing register allocation according to the matching instruction of each instance, and determining information of each register in the microinstruction corresponding to the instance to obtain a corresponding assembly instruction; and generating an assembly instruction file according to the sorting number corresponding to each instance and all the assembly instructions, wherein the assembly instruction file comprises a random instruction sequence formed by the assembly instructions according to the sorting numbers corresponding to the instances and an instruction slot identifier corresponding to each assembly instruction. A random instruction sequence matched with the processor of the ultra-long instruction word framework can be generated, various test scenes can be simulated and completed, and the method is used for verifying the processor of the ultra-long instruction word framework.
Owner:CIX TECH (SUZHOU) CO LTD

A DSP-oriented VLIW scheduling and packing method

The application discloses a DSP-oriented VLIW scheduling and packing method, which comprises the following steps: step 1, performing an LLVM IR optimization PASS sequence; step 2, constructing an instruction dependency graph (IDG); step 3, scheduling and packing before register allocation according to the global IDG; and step 4, reconstructing the IDG according to a register allocation result, and then scheduling and packing after the register allocation according to the reconstructed IDG. The application discloses a detailed IDG based on an SSA format, reveals potential parallelism between instructions, allows a compiler to identify opportunities for parallel execution at an earlier stage, avoids the parallelism loss problem introduced by the traditional method in the post-register allocation packing, and significantly improves the execution efficiency of a program on a DSP platform.
Owner:NORTHWEST UNIV

Processor structure based on odd-even scheduling and distribution, chip and electronic equipment

The invention relates to the technical field of processors, and provides a processor structure based on odd-even scheduling and allocation, a chip and an electronic device.According to the processor structure based on odd-even scheduling and allocation, an idle physical register file is divided into an odd part and an even part in the renaming stage; according to the embodiment provided by the invention, the writing ports of the register file can be reduced by half, and physical register allocation and instruction scheduling are effectively carried out in cooperation with a register allocation equalization algorithm.
Owner:BEIJING VCORE TECH CO LTD

Register allocation

The invention relates to register allocation. The shader program can include a condition portion that executes only in response to a particular condition being satisfied. The use of the condition portion may require different numbers of registers. Thus, this use of the condition portion potentially causes overallocation of registers. Accordingly, there is provided a method of rendering in a graphics processing system using a shader program having a condition segment applied only in response to satisfaction of a condition, the method comprising: compiling, by a compiler, the program, the compiling comprising identifying the condition segment; reading, by the resource allocator, constants that determine a result of the condition; determining, by the resource allocator, whether the condition is satisfied; and allocating, by the resource allocator, a number of registers.
Owner:IMAGINATION TECH LTD

Register allocation and instruction transmission method and device, and electronic equipment

The invention provides a register allocation method and device, an instruction transmitting method and device and electronic equipment, and relates to the technical field of computer processors, the method comprises the steps that N allocated register groups are acquired, and each register group comprises at least one physical register; selecting a target physical register group from the N register groups according to a register distribution rule when responding to the existence of the target logic register for register distribution; and allocating the target physical register group to the target logical register. By selecting the corresponding physical register group according to the operation type of the target instruction, resource isolation and special path allocation of different function instructions are realized, register resource competition is effectively avoided, a data path is optimized, access delay and power consumption are reduced, and the parallel execution efficiency, the function module utilization rate and the overall performance of a processor are improved.
Owner:BEIJING VCORE TECH CO LTD

Register allocation method

The invention relates to the field of compiler optimization, and provides a register allocation method, which comprises the following steps of: firstly, reversely scanning a control flow diagram, and constructing an active range table for all variables so as to accurately record a dead interval of each variable; secondly, carrying out dead interval matching and multiplexing operation in a register allocation process; and finally, carrying out weight calculation by combining variable active range and dead interval features, and optimizing an overflow decision. The invention aims to realize register multiplexing by identifying and utilizing the dead interval in the variable active range, thereby improving the utilization rate of the register, reducing the overflow of the register and improving the execution performance of the program.
Owner:WUHAN LINGJIU MICROELECTRONICS CO LTD

Register allocation decision

An apparatus comprises execution circuitry configured to execute a given instruction to produce a given data value. Value analysis circuitry is configured to perform an analysis of the given data value produced by the execution circuitry to determine at least one property of the given data value, and register allocation circuitry is configured to make a register allocation decision regarding storage of the given data value in a physical register file in dependence on the analysis of the given data value.
Owner:ARM LTD

A register overflow optimization method, device and storage medium

Embodiments of the present application provide a register overflow optimization method and device and a storage medium, applied to the chip technical field, in the method, for each virtual register in a target program, based on the physical register type supported by the instruction operand where the virtual register is located, a corresponding target register class is selected from N candidate register classes, N is greater than 1; a first physical register in the target register class is allocated to the virtual register; when a register overflow occurs, a target register is selected from the allocated multiple first physical registers, and the instruction operand saved in the target register is overflowed to a second physical register in the other N-1 candidate register classes. Compared with overflowing the instruction operand to the memory to generate read and write operations on the memory, the present application overflows to different types of physical registers, generates read and write operations on the physical registers, relieves the pressure of the registers, reduces the performance overhead of overflowing to the memory, and improves the register allocation efficiency.
Owner:SHANGHAI BIREN TECH CO LTD

A register selection method based on bit vectors and configurable mappings

The application relates to the field of register allocation of a compiler, in particular to a register selection method based on a bit vector and a configurable mapping. The method comprises the following steps: obtaining a category mask corresponding to a target constraint and an availability bit vector; each bit in the availability bit vector corresponds to a register; if 0 in the availability bit vector represents an idle corresponding register and 1 represents an occupied corresponding register, then performing a NOT operation on the availability bit vector, performing a bitwise AND operation on the vector obtained after the NOT operation and the category mask corresponding to the target constraint, and obtaining a vector obtained after the bitwise AND operation; and performing a first position bit detection on the vector obtained after the bitwise AND operation, and determining a register corresponding to a first value 1 bit number obtained after the detection as a selected idle register satisfying the target constraint. The application can improve register category filtering efficiency and reduce the determination cost of register availability.
Owner:成都融见软件科技有限公司 +1

Bytecode optimization method and device of executable file and electronic equipment

ActiveCN119088396ARealize optimization and transformationOptimize and transform to reduceEnergy efficient computingSoftware simulation/interpretation/emulationParallel computingBranch
The invention relates to the technical field of computers, and discloses a byte code optimization method and device of an executable file and electronic equipment. The method comprises the following steps: partitioning byte codes of a function of an executable file to obtain a plurality of program blocks; when the register assignment constant instruction is searched in the program block, judging whether a register in a subsequent instruction of the register assignment constant instruction is replaced by a preset assignment constant or not; if the first register is replaced, judging whether an instruction taking the first register as a source register or a target register exists after the register assignment constant instruction in the program block, and obtaining a preliminary deletion optimization judgment result; judging whether an instruction of jumping out of the program block by a branch exists after the register assignment constant instruction in the program block; if yes, judging whether an instruction taking the first register as a source register exists in the skipped program block or not; if the instruction taking the first register as the source register exists in the skipped program block, marking the register assignment constant instruction as an undeleted optimization instruction, otherwise, marking the register assignment constant instruction as a target deleted optimization instruction; and traversing each program block until each register assignment constant instruction is judged and the register assignment constant instruction marked as the target deletion optimization instruction is deleted. The register assignment constant instruction is deleted and optimized for the byte code of each function, and the compiled byte code is directly optimized, so that the size of an executable file is reduced, and the execution speed is increased.
Owner:WUHAN TIANYU INFORMATION IND

A method of dynamically allocating caller-saved register save space

This application relates to the field of compilers, and in particular to a method for dynamically allocating caller-saved register storage space. Applied to the register allocation stage, it includes the following steps: obtaining the set of caller-saved registers that need to be saved at the current call point; obtaining the required storage space size N for the current call point based on the set of caller-saved registers; allocating a contiguous storage space of size N for this call by adjusting the stack pointer before generating the save instruction; writing the values ​​of the caller-saved registers that need to be saved at the current call point into the contiguous storage space of size N; executing the function call instruction; after the function call returns, restoring the values ​​of each caller-saved register written in the contiguous storage space of size N to the corresponding caller-saved register; and restoring the stack pointer to release the contiguous storage space of size N. This invention can solve the problems of stack space waste, high complexity, and susceptibility to errors.
Owner:成都融见软件科技有限公司 +1

Reducing range of activity to enhance register allocation for structured control flow programs

Reducing the range of activity of variables of register allocation for a structured control flow program is provided. The method includes defining an affine expression for each static single assignment SSA variable contained in an input program of a computer compiler. The affine expression of the SSA variable in the input program is derived by replacing the affine expression of the input operand involved in the calculation of the SSA variable. The method defines dependency edges between nodes representing SSA variables in the dependency graph, where sources and destinations of the dependency edges represent definitions and uses of the SSA variables. The method identifies, among the dependent edges, one or more overlapping dependent edges having the same source, and eliminates longer ones of the overlapping dependent edges according to the derived affine expression.
Owner:INTERNATIONAL BUSINESS MACHINE CORPORATION