초록 ▼

An apparatus and method reorder portions of a computer program in a way that achieves both enhanced performance and maintainability of the computer program. A global call graph is initially constructed that includes profile data. From the information in the global call graph, an intramodular call gr

An apparatus and method reorder portions of a computer program in a way that achieves both enhanced performance and maintainability of the computer program. A global call graph is initially constructed that includes profile data. From the information in the global call graph, an intramodular call graph is generated for each module. Reordering techniques are used to reorder the procedures in each module according to the profile data in each intramodular call graph. An intermodular call graph is generated from the information in the global call graph. Reordering techniques are used to reorder the modules in the computer program. By reordering procedures within modules, then reordering the modules, enhanced performance is achieved without reordering procedures across module boundaries. Respecting module boundaries enhances the maintainability of the computer program by allowing a module to be replaced without adversely affecting the other modules while still providing many of the advantages of global procedure reordering.

대표청구항 ▼

[ We claim:] [1.] An apparatus comprising:at least one processor;a memory coupled to the at least one processor;a computer program residing in the memory, the computer program including at least one procedure within each of a plurality of modules;profile data residing in the memory that represents t

[ We claim:] [1.] An apparatus comprising:at least one processor;a memory coupled to the at least one processor;a computer program residing in the memory, the computer program including at least one procedure within each of a plurality of modules;profile data residing in the memory that represents the execution frequency of at least one procedure within at least one of the plurality of modules in the computer program;a reordering mechanism residing in the memory and executed by the at least one processor, the reordering mechanism reordering a plurality of procedures within at least one of the plurality of modules based on a portion of the profile data corresponding to the plurality of procedures and reordering the plurality of modules based on a portion of the profile data corresponding to procedures within the plurality of modules.