3 ms·
> Using these techniques we can automatically infer an approximate upper bound of the energy consumed when running a function under different platforms, using d
by VikingCoder 12y ago
> Using these techniques we can automatically infer an approximate upper bound of the energy consumed when running a function under different platforms, using different compilers - without the need of actually running it.
Wouldn't a necessary first step be to solve the Halting Problem?
Sorry, I haven't read the actual paper.
- adrianN 12y agoDetermining the runtime bounds of a function is also undecidable.[1] That doesn't mean that we can't do it in practice for the things we're interested in. [1] https://cstheory.stackexchange.com/questions/5004/are-runtime-bounds-in-p-decidable-answer-no https://cstheory.stackexchange.com/questions/5004/are-runtim...
- mvzink 12y agoThey seem to approximate with recurrence relations; they cite a bunch of literature about the technique, referring to "cost relations".