|
|
|
|
|
by jwise0
4420 days ago
|
|
This is not so far from reality. Ben Zorn has done some work on this -- in particular, his work on "Flikker" might be interesting to you. The paper (http://research.microsoft.com/en-us/um/people/moscitho/publi...) was published at ASPLOS'11. In general, this concept is called "good enough computing"; periodically, people think about it, and then brush it by the wayside. But it is a neat thought experiment, even if nothing else! |
|
We already do this with SP, DP, EP, bignum, arbitrary precision and algorithms that are precision tolerant so I am not sure how much of an advantage it would have.
One idea I had would be to decompile a high performance benchmark and then synthesize microbenchmarks for groups of basic blocks to get instruction packet timing for various FP operations and then model the distribution in speedups from use lower precision math.
These papers look interesting
http://isl.korea.ac.kr/paper/TVLSI_May2004.pdf
http://passat.crhc.illinois.edu/rakeshk/dsn_13_cam.pdf