4 ms·
- 3276800 entries (to match authors 200 MB of ascii) Sounds like you implicitly assumed the match will be aligned at a 64 byte boundary which makes the task mu
by danbruc 9y ago
- 3276800 entries (to match authors 200 MB of ascii)
Sounds like you implicitly assumed the match will be aligned at a 64 byte boundary which makes the task much easier and 4 GiB/s a pretty slow result.
- quickben 9y agoI asked the compiled to align what it can on 16 bytes and updated the results. Unsure why the previous result was way off, but I am lacking time for fun tonight :)
- vardump 9y agoYou have a vector of 64 char strings, while others have just 200 MB byte array. IOW, your code is not doing remotely same task as the blog post ones. Edit: "Typoed" 1 GB instead of 200 MB. Oops. The point holds.
- danbruc 9y agoI meant something different, your implementation is unable to find the pattern if it does not start at an index divisible by 64. You are effectively only searching through 3,125 MiB instead of 200 MiB.