Optimizing an openCL calculation with bitwise operations
<p>Let me commence by stating my objective: I am attempting to compare two 13-bit integers: >, &lt;, and =; I have to do this calculation trillions of times, so it is imperative that I optimize it as much as possible.</p>

<p>My program currently utilizes Python 2.7 and pyopencl to achieve this calculation. I am averaging about 800 GFlops out of my ATI Radeon 6870 which is fine for now.</p>

<p>So here is my question: If instead of caring out the &lt;, >, and = operators on 4 byte floats (as I am doing now), I wrote bitwise functions to handle the &lt;, >, and =, and I was able to process 2 - 13 bits objects at a time, would this increase my speed? Or does C already have the most efficient way of finding &lt;, and >, and = (obviously) for floats?</p>