{"schema_version":"1.0","canonical_url":"https://patentable.app/patents/US-9600253","patent":{"patent_number":"US-9600253","title":"Arranging binary code based on call graph partitioning","assignee":null,"inventors":[],"filing_date":"2012-04-12T00:00:00.000Z","publication_date":"2017-03-21T00:00:00.000Z","cpc_codes":["G06F","G06F","G06F","G06F"],"num_claims":7,"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."},"analysis":{"summary":null,"layman_explanation":null,"technical_analysis":null,"business_analysis":null,"faqs":null,"topics":[],"tech_cluster":null},"seo":{"title":"Arranging binary code based on call graph partitioning","description":"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 weight","keywords":[]},"attribution":{"source":"Patentable","source_url":"https://patentable.app","canonical_url":"https://patentable.app/patents/US-9600253","license":"CC-BY-4.0-like","license_terms":"AI-generated analysis on this page (summary, layman_explanation, technical_analysis, business_analysis, faqs) may be reused with attribution and a visible link back to the canonical URL above. Patent abstracts, claims, and bibliographic data are USPTO public domain.","required_link":"https://patentable.app/patents/US-9600253","citation_suggestion":"Patentable. \"Arranging binary code based on call graph partitioning\" (US-9600253). https://patentable.app/patents/US-9600253","copyright_holder":"Nomic Interactive Technology LLC"},"links":{"html":"https://patentable.app/patents/US-9600253","json":"https://patentable.app/api/llm-context/US-9600253","site":"https://patentable.app","llms_txt":"https://patentable.app/llms.txt"},"generated_at":"2026-06-06T05:59:18.129Z"}