Pre-Grant Publication Number: 20070226722
Collaborate on the process of community review for this application. Posting will not be forwarded to the USPTO. Flagging a post as an ACTION ITEM signals further research. Flagging SPAM and ABUSE helps to manage discussion. Placing double brackets around a reference to a claim or prior art will create a hyperlink to the original ex. [[claim 1]] and [[prior art 2]].

Please review the Community Code of Conduct prior to posting

Discussion (13)
  Facilitator's Comment     Action Item
  Show without Noise
CLAIM 00001

<claim-text> A method for selectively executing different versions of executable code for the same source code, wherein the different versions are optimized in different ways, the method comprising: <claim-text>receiving an executable code module which includes two or more versions of executable code for the same source code, wherein the two or more versions are optimized in different ways; and </claim-text><claim-text>executing the executable code module, wherein executing the executable code module involves, <claim-text>evaluating a test condition; and </claim-text><claim-text>executing a specific version of the executable code based on the outcome of the evaluation, whereby the executable is optimized for the test condition. </claim-text></claim-text></claim-text>

Comments
Steven Pearson (11 months ago)
Hmm, very interesting. Some info here: http://en.wikipedia.org/wiki/Universal_binary
The current application claims different bits of code for purposes of different optimizations (presumably multiple versions to choose among all for one platform), whereas the universal binary apparently provides multiple versions to choose from, all for different platforms. However, one wonders if the claims are worded carefully enough. Perhaps there is some relevant overlap with Claim 1. How better to "optimize" code according to a particular condition, where the condition is execution upon a particular platform, than to execute code specifically compiled for that platform, where the alternative may be to execute code compiled for some other platform, in emulation mode.
more...

CLAIM 00005

<claim-text> The method of <claim-ref idref='CLM-00004'>claim 4</claim-ref>, wherein the condition can be associated with: <claim-text>core utilization; </claim-text><claim-text>processor/core temperature; </claim-text><claim-text>memory bandwidth; and </claim-text><claim-text>other system performance criteria. </claim-text></claim-text>

Comments
Rob Cameron (about 1 year ago)
This patent application is dealing with dynamic code selection, a particular type of run-time performance optimization that fits within the general framework of dynamic code generation. Dynamic code selection is identified as one of the basic methods in the article "A Framework for Remote Dynamic Program Optimization" by Michael J. Voss and Rudolf Eigenmann, Proceedings of the ACM SIGPLAN Workshop on Dynamic and Adaptive Compilation and Optimization, 2000, pp. 32-40. This should address most of the claims, although it might be nice to find prior art that addresses the specific conditions of Claim 5, as well.
more...