4 ms·
https://stackoverflow.com/questions/45373679/why-is-it-faster-to-perform-float-by-float-matrix-multiplication-compared-to-int https://stackoverflow.com/question
by cyanydeez 3y ago
https://stackoverflow.com/questions/45373679/why-is-it-faster-to-perform-float-by-float-matrix-multiplication-compared-to-int https://stackoverflow.com/questions/45373679/why-is-it-faste...
- gpderetta 3y agoAs per answer, the reason float is faster than in is because a) hardware companies provide float ALUs than integer ALUs and b) float FMA is a thing, while integer FMA isn't. Both are because currently most HPC-like loads use floats instead of integers, not because of intrinsic hardware reasons.
- KeplerBoy 3y agoIf it's desired integer performance could far exceed float performance, since ALUs need less die area than FPUs. If this paper holds, I'd expect that's where custom accelerators will be heading.
- gpderetta 3y agoOh, I agree, I'm just saying that there is no reason in principle for floats performance to be better than integer. edit: also this might be implementable purely using bitwise vector operations. Would need to check the throughput of those.