Patent · US Active

Arranging binary code based on call graph partitioning

US9600253B2 · kind B2 · utility

1Cited by

31References

7Claims

0Family size

Assignee

International Business Machines Corporation · US

Inventors

Tong Chen · Brookline, US
Brian Flachs · Austin, US
Brad W. Michael · Cedar Park, US
Mark Richard Nutter · Austin, US
John Kevin Patrick O'Brien · South Salem, US
Kathryn M. O'Brien · South Salem, US
Tao Zhang · Beijing, CN

Key dates

Filing date	Apr 12, 2012
Grant date	Mar 21, 2017
Priority date	—
Expiry date	Oct 9, 2034

Classification

Technology area (CPC G)Physics
CPC primaryG06F12/0875
WIPO fieldComputer technology
WIPO sectorElectrical engineering

Abstract

Mechanisms are provided for arranging binary code to reduce instruction cache conflict misses. These mechanisms generate a call graph of a portion of code. Nodes and edges in the call graph are weighted to generate a weighted call graph. The weighted call graph is then partitioned according to the weights, affinities between nodes of the call graph, and the size of cache lines in an instruction cache of the data processing system, so that binary code associated with one or more subsets of nodes in the call graph are combined into individual cache lines based on the partitioning. The binary code corresponding to the partitioned call graph is then output for execution in a computing device.

Source: USPTO / EPO open patent data. Objective bibliographic and citation counts.