The patent badge is an abbreviated version of the USPTO patent document. The patent badge does contain a link to the full patent document.
The patent badge is an abbreviated version of the USPTO patent document. The patent badge covers the following: Patent number, Date patent was issued, Date patent was filed, Title of the patent, Applicant, Inventor, Assignee, Attorney firm, Primary examiner, Assistant examiner, CPCs, and Abstract. The patent badge does contain a link to the full patent document (in Adobe Acrobat format, aka pdf). To download or print any patent click here.
Patent No.:
Date of Patent:
Jan. 04, 2005
Filed:
Oct. 10, 2000
DZ Ching Ju, Sunnyvale, CA (US);
Kalyan Muthukumar, Cupertino, CA (US);
Shankar Ramaswamy, Bethel Park, PA (US);
Barbara Bluestein Simons, Palo Alto, CA (US);
Dz Ching Ju, Sunnyvale, CA (US);
Kalyan Muthukumar, Cupertino, CA (US);
Shankar Ramaswamy, Bethel Park, PA (US);
Barbara Bluestein Simons, Palo Alto, CA (US);
International Business Machines Corporation, Armonk, NY (US);
Abstract
Code restructuring or reordering based on profiling information and memory hierarchy is provided by constructing a Program Execution Graph (PEG) corresponding to a level of the memory hierarchy, partitioning this PEG to reduce estimated memory overhead costs below an upper bound, and constructing a PEG for a next level of the memory hierarchy from the partitioned PEG. The PEG is constructed from control flow and frequency information from a profile of the program to be restructured. The PEG is a weighted undirected graph comprising nodes representing basic blocks and edges representing transfer of control between pairs of basic blocks. The weight of a node is the size of the basic block it represents and the weight of an edge is the frequency of transition between the pair of basic blocs it connects.