Invention Grant
- Patent Title: Arranging binary code based on call graph partitioning
- Patent Title (中): 基于调用图分区来排列二进制代码
-
Application No.: US12823244Application Date: 2010-06-25
-
Publication No.: US09459851B2Publication Date: 2016-10-04
- Inventor: Tong Chen , Brian Flachs , Brad W. Michael , Mark R. Nutter , John K. P. O'Brien , Kathryn M. O'Brien , Tao Zhang
- Applicant: Tong Chen , Brian Flachs , Brad W. Michael , Mark R. Nutter , John K. P. O'Brien , Kathryn M. O'Brien , Tao Zhang
- Applicant Address: US NY Armonk
- Assignee: International Business Machines Corporation
- Current Assignee: International Business Machines Corporation
- Current Assignee Address: US NY Armonk
- Agent Stephen J. Walder, Jr.; Thomas E. Tyson
- Main IPC: G06F9/45
- IPC: G06F9/45

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.
Public/Granted literature
- US20110321021A1 Arranging Binary Code Based on Call Graph Partitioning Public/Granted day:2011-12-29
Information query