Placement of explicit preemption points into compiled code
AssigneeInternational Business Machines Corporation
InventorKELVIN D. NILSEN
Life of this patent
Estimating the term…
Loading patent…
AssigneeInternational Business Machines Corporation
InventorKELVIN D. NILSEN
Estimating the term…
Improvements in the placement of explicit preemption points into compiled code are disclosed. A control flow graph is created, from executable code, that includes every control path in a function. From the control flow graph, an estimated execution time for each control path is determined. For each control path, it is determined whether an estimated execution time of a control path exceeds a preemption latency parameter, wherein the preemption latency parameter is a maximum allowable time between preemption points. When it is determined that the estimated execution time of a particular control path violates the preemption latency parameter, an explicit preemption point is placed into the executable code that satisfies the preemption latency parameter.
A method for the placement of explicit preemption points into compiled code, comprising:
An apparatus for placement of explicit preemption points into compiled code, the apparatus comprising a computer processor, a computer memory operatively coupled to the computer processor, the computer memory having disposed within it computer program instructions that, when executed by the computer processor, cause the apparatus to carry out the steps of:
A computer program product for placement of explicit preemption points into compiled code, the computer program product comprising a non-transitory computer readable medium having computer program instructions embodied therewith that, when executed, cause a computer to carry out the steps of:
Dependencies are inferred from the claim text.