2 ms·
Chances are only a small portion of the lookup table is used. It's conceivable that this is almost entirely L1 access. But I'm also very skeptical that this is
by wongarsu 2y ago
Chances are only a small portion of the lookup table is used. It's conceivable that this is almost entirely L1 access.
But I'm also very skeptical that this is actually faster. Would have been nice to see some numbers
- Palomides 2y agoI think an l2 cache hit is about the same number of cycles as a single byte divide, might as well save the cache for something else but yeah, this is just my speculation