Abstract: Systems and methods are discussed that allow profile information to be reused by various versions of a program. One illustrative aspect includes a method for comparing versions of a program in binary format. The method includes finding equivalent contents in portions of two versions of the program, finding equivalent structure in the portions of the two versions, and forming a match when a portion of one of the two versions is an equivalence of a portion of the other of the two versions.

Abstract: The present invention is directed to a system and method for improved collection of application profile data for performance optimization. The invention provides a mechanism for storing usage bits within the hardware cache of a computing device. These usage bits provide profile data by tracking the memory usage data. In one embodiment, the present invention also provides usage bits for each level of a multi-stage hardware cache to provide multi-stage usage tracking.

Abstract: In one embodiment, the present invention includes an apparatus having a prediction unit to predict a direction to be taken at a branch and a memory coupled to the prediction unit to store prediction data to be accessed by the prediction unit. In this way, great amounts of prediction data may be stored in the memory while keeping the prediction unit of relatively small size. Other embodiments are described and claimed.

Abstract: In one aspect, in response to each of plural page faults, a copy of a requested virtual memory page is written to a sorted set of pages in the read order of the sorted pages. A copy of a modified or new data page also can be written to the sorted set. Sorting can be limited to certain kinds of pages (e.g., data pages). Temporary data pages can be deleted from a sorted set to improve efficiency. If a previously sorted page is requested, writing the page back to the sorted set can be omitted. A sorted set of pages also can be sorted based on retirement order. In another aspect, copies of pages that are accessed or not accessed in memory within certain time windows are written in a sorted order based on phase groups.

Abstract: Systems and methods are discussed that allow profile information to be reused by various versions of a program. One illustrative aspect includes a method for comparing versions of a program in binary format. The method includes finding equivalent contents in portions of two versions of the program, finding equivalent structure in the portions of the two versions, and forming a match when a portion of one of the two versions is an equivalence of a portion of the other of the two versions.

Abstract: The present invention is directed to a system and method for improved collection of application profile data for performance optimization. The invention provides a mechanism for storing usage bits within the hardware cache of a computing device. These usage bits provide profile data by tracking the memory usage data. In one embodiment, the present invention also provides usage bits for each level of a multi-stage hardware cache to provide multi-stage usage tracking.

Abstract: Systems and methods are discussed that allow profile information to be reused by various versions of a program. One illustrative aspect includes a method for comparing versions of a program in binary format. The method includes finding equivalent contents in portions of two versions of the program, finding equivalent structure in the portions of the two versions, and forming a match when a portion of one of the two versions is an equivalence of a portion of the other of the two versions.

Abstract: Systems and methods are discussed that allow profile information to be reused by various versions of a program. One illustrative aspect includes a method for comparing versions of a program in binary format. The method includes finding equivalent contents in portions of two versions of the program, finding equivalent structure in the portions of the two versions, and forming a match when a portion of one of the two versions is an equivalence of a portion of the other of the two versions.

Abstract: The present invention provides a method for optimizing software by using scenario data along with user data collected from real use of the software by a number of real users. The instrumented version of software is distributed to a number of real users such that user data can be collected that reflects a more complete coverage of the program than traditional scenario data. Due to the time necessary to collect user data from real users, the user data from a previous build of the program can be propagated so that it will accurately predict the behavior of the current build of a program. Additionally, a method of limiting the amount of user data collected from the real users is provided such that the amount of user data can be limited without decreasing either the amount of coverage of the user data or its accuracy.

Abstract: System for accurately predicting the outcome of conditional branch instructions subject to execution in a pipelined processor digital computer. The system comprises a series of predictor stages utilizing different prediction algorithms. The stages are linked to successively refine branch predictions only where prediction accuracy from a previous stage is likely to be improved by a subsequent stage. Improvements to each stage and techniques for stage linkage are described.

Abstract: System for accurately predicting the outcome of conditional branch instructions subject to execution in a pipelined processor digital computer. The system comprises a series of predictor stages utilizing different prediction algorithms. The stages are linked to successively refine branch predictions only where prediction accuracy from a previous stage is likely to be improved by a subsequent stage. Improvements to each stage and techniques for stage linkage are described.

Abstract: A predictor which chooses between two or more predictors is described. The predictor includes a first component predictor which operates according to a first algorithm to produce a prediction of an action and a second component predictor which operates according to a second algorithm to produce a prediction of said action. The predictor also includes means, coupled to each of said first and second predictors, for choosing between predictions provided from said predictors to provide a prediction of the action from the predictor. The predictor can be used to predict outcomes of branches, cache hits, prefetched instruction sequences, and so forth.