Pre-Grant Publication Number: 20070226722
Please help the USPTO examine the application by evaluating the relevance of the publicly submitted prior art to the patent application.
Peer To Patent forwards the Top 10 most relevant prior art submissions and their annotations to the USPTO.
Review this prior art and click on the thumbs up (or down) to indicate whether this submission should be forwarded to the USPTO.
If you login then you can add an annotation by typing in the box at the bottom of the screen to comment on the relevance of the prior art to the claims of the patent application.
Review this prior art and click on the thumbs up (or down) to indicate whether this submission should be forwarded to the USPTO.
If you login then you can add an annotation by typing in the box at the bottom of the screen to comment on the relevance of the prior art to the claims of the patent application.
Prior Art Detail
Summary / Description
| Summary / Description | A generic framework for remote dynamic program optimization. |
Basic Information
| Type of Prior Art | Print Publication |
| Publication Title * | Proceedings of the ACM SIGPLAN workshop on Dynamic and adaptive compilation and optimization |
| Author | Michael J. Voss and Rudolf Eigenmann |
| ISBN | 1-58113-241-7 |
| Page Range | 32 - 40 |
| Medium | Book excerpt |
| Publication Date * | July 2000 |
| URL | http://doi.acm.org/10.1145/3513... |
Notes / To Do
| Notes | |
Excerpt
Excerpt Dynamic program optimization allows programs to be generated that are highly tuned for a given environment and input data set. Optimization techniques can be applied and re-applied as program and machine characteristics are discovered and change. In most dynamic optimization and compilation frameworks, the time spent in code generation and optimization must be minimized since it is directly reflected in the total program execution time. We propose a generic framework for remote dynamic program optimization that mitigates this need. A local optimizer thread monitors the program as it executes and selects program sections that should be optimized. An optimizer, running on a remote machine or a free processor of a multiprocessor, is then called to actually perform the optimization and generate a new code variant for the section. A dynamic selector is used to select the most appropriate code variant for each code interval based upon the current runtime environment. We describe this framework in detail and present an example of its use on a simple application. We show that our framework, when used with changing input, can outperform the best statically optimized version of the application.
|
Relevance
Claims
1
Relevance
Figure 1(a) clearly shows selection of alternative executable code modules
base on a test condition N>M and a branch.
Figure 1(a) clearly shows selection of alternative executable code modules
base on a test condition N>M and a branch.
Claim Chart
All
0 days left
