Pre-Grant Publication Number: 20070130448
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 United States Patent and Trademark Office.
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 | Redundant instructions may be discarded during the final stage of compilation by using a simple optimizing technique called peephole optimization. The method is described and examples are given. |
Basic Information
| Type of Prior Art | Print Publication |
| Publication Title * | Communications of the ACM volume 8 , Issue 7 |
| Author | W. M. McKeeman |
| ISBN | |
| Page Range | 443 - 444 |
| Medium | Journal article |
| Publication Date * | July 1, 1965 |
| URL | http://doi.acm.org/10.1145/3649... |
Notes / To Do
| Notes | This is a peephole optimizer done in the CPU, rather than in the compiler. |
Excerpt
Excerpt |
Relevance
Claims
1
A method comprising:
monitoring an access to a stack pointer to update a stack tracker structure;
using information stored in the stack tracker structure to generate a distance value corresponding to a relative distance between a load instruction and a previous store instruction within a store buffer; and
using the distance value to provide source data for the load instruction.
Relevance
A peephole optimizer does exactly this -- looks for duplicate memory references and converts instructions to read from a register rather than from memory. The only difference here is that he is doing it in the CPU rather than in the compiler.
A peephole optimizer does exactly this -- looks for duplicate memory references and converts instructions to read from a register rather than from memory. The only difference here is that he is doing it in the CPU rather than in the compiler.
Claim Chart
All
0 days left
