2 ms·
"run time is the only time (really) that the order of operations can be determined" For perfect optimization, yes. Its possible that accepting 50% performance
by VLM 13y ago
"run time is the only time (really) that the order of operations can be determined"
For perfect optimization, yes. Its possible that accepting 50% performance of the OO sked by changing to a precalculation at compile time or the OS doing some kind of pseudo-JIT compilation might save so much latency, thermal budget, and power that you can stuff in more cache or more "whatever" resulting in overall higher system thruput. Its not just the traditional tradeoffs, because you're making a major architectural change.
A FPGA might be unable to model the complete systemic tradeoffs or more specifically the designer might not model the tradeoff correctly. The point of the arch might be that real silicon might have space for twice the cache memory (or whatever) with the new arch, but a lazy comparison implementation might have a meg of cache for each to keep the implementation simple, which would miss the point.
Its an interesting idea to think about, regardless if it turns out to be correct or not.