초록 ▼

An apparatus and several methods provide for a more optimized computer program that will have a faster execution time than was possible using the prior art reordering technique that adds to a trace until it finds no more predecessors or successors to add. The apparatus and methods disclosed herein u

An apparatus and several methods provide for a more optimized computer program that will have a faster execution time than was possible using the prior art reordering technique that adds to a trace until it finds no more predecessors or successors to add. The apparatus and methods disclosed herein use a variety of methods to reorder the program portions in a more intelligent manner that will improve its run-time performance. Each of these methods involves constructing traces in the control flow graph of the computer program. In a first embodiment, a basic block is only added to a trace if it is not negligible within predetermined limits. This negligibility test results in traces that are not extended for infrequently executed basic blocks. In a second embodiment, a basic block is only added to a trace if it is a perfect partner with the last basic block added to the trace. The concept of a "perfect partner" helps to match basic blocks together in a trace that have the greatest affinity for each other. In a third embodiment, a basic block is only added to a trace if it satisfies "should follow" flags and predetermined negligibility criteria. The "should follow" flags and negligibility criteria provide a complex criteria for adding basic blocks to a trace, criteria that create more efficient code in some specific circumstances.

대표청구항 ▼

[ We claim:] [4.] A method for improving execution speed of a computer program on a computer apparatus by reordering a plurality of program portions in a computer program, the method comprising the step of:constructing a plurality of traces, each trace comprising at least one of the plurality of por

[ We claim:] [4.] A method for improving execution speed of a computer program on a computer apparatus by reordering a plurality of program portions in a computer program, the method comprising the step of:constructing a plurality of traces, each trace comprising at least one of the plurality of portions, the step of constructing each trace comprising the steps of:adding a portion to the trace in an order determined by:(1) profile data; and(2) at least one reordering method that does not necessarily add to the trace any predecessor portion to the at least one portion in the trace when at least one predecessor portion exists, and that does not necessarily add to the trace any successor portion to the at least one portion in the trace when at least one successor portion exists;ordering the plurality of traces according to their order of creation; andreordering the plurality of portions of the computer program from the order of the plurality of traces and the order of the plurality of portions within the plurality of traces.