17930795. INTERLEAVED MACHINE INSTRUCTION PLACEMENT IN MEMORY simplified abstract (MICROSOFT TECHNOLOGY LICENSING, LLC)
Contents
- 1 INTERLEAVED MACHINE INSTRUCTION PLACEMENT IN MEMORY
- 1.1 Organization Name
- 1.2 Inventor(s)
- 1.3 INTERLEAVED MACHINE INSTRUCTION PLACEMENT IN MEMORY - A simplified explanation of the abstract
- 1.4 Simplified Explanation
- 1.5 Potential Applications
- 1.6 Problems Solved
- 1.7 Benefits
- 1.8 Potential Commercial Applications
- 1.9 Possible Prior Art
- 1.10 Original Abstract Submitted
INTERLEAVED MACHINE INSTRUCTION PLACEMENT IN MEMORY
Organization Name
MICROSOFT TECHNOLOGY LICENSING, LLC
Inventor(s)
Roman Snytsar of Sammamish WA (US)
INTERLEAVED MACHINE INSTRUCTION PLACEMENT IN MEMORY - A simplified explanation of the abstract
This abstract first appeared for US patent application 17930795 titled 'INTERLEAVED MACHINE INSTRUCTION PLACEMENT IN MEMORY
Simplified Explanation
The abstract of the patent application describes a solution for improving the parallelization of computer programs by interleave machine instruction placement in memory. The compiler decomposes a software loop in stages to interleave instructions in such a way that contiguous sets of instructions have no dependencies on prior instructions within the set, allowing for better parallelization.
- Instructions are interleaved in memory to eliminate dependencies within sets of instructions.
- Compiler decomposes software loops to interleave instructions in stages.
- Contiguous sets of instructions have no dependencies on prior instructions within the set.
Potential Applications
This technology could be applied in:
- High-performance computing
- Scientific simulations
- Data processing applications
Problems Solved
This technology solves the following problems:
- Improving the parallelization of computer programs
- Optimizing the execution of instructions in a program
Benefits
The benefits of this technology include:
- Increased performance of computer programs
- Enhanced efficiency in executing instructions
- Better utilization of hardware resources
Potential Commercial Applications
This technology could be commercially applied in:
- Supercomputing
- Cloud computing services
- High-frequency trading systems
Possible Prior Art
One possible prior art for this technology could be the use of loop unrolling techniques to improve program performance.
What are the specific stages in which the compiler decomposes a software loop to interleave instructions?
The specific stages in which the compiler decomposes a software loop to interleave instructions are not detailed in the abstract. Further information on the exact process would be beneficial.
How does the technology handle dependencies between sets of instructions that are not contiguous?
The abstract does not mention how the technology handles dependencies between sets of instructions that are not contiguous. Understanding how this aspect is addressed would provide a more comprehensive view of the innovation.
Original Abstract Submitted
Solutions for improving parallelization of computer programs interleave machine instruction placement in memory. A compiler decomposes a software loop in stages to interleave instructions such that, for contiguous sets of instructions having some minimum length (e.g., each set has at least two to four instructions), instructions within a set have no dependency on prior instructions within that set. This enables the compiled program to be more fully parallelized—for example, either by a superscalar processor executing the compiled program, or by the compiler turning each set of instructions into a very long instruction word (VLIW)—to automatically benefit from the disclosed interleaving of instructions that eliminates dependencies.
