Skip to content
New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Figure out why Fixed-Size SHARDS is faster than Evicting Map in some cases #83

Open
thedavidchu opened this issue Aug 29, 2024 · 1 comment
Assignees

Comments

@thedavidchu
Copy link
Owner

2024 August 29

  • Change size of evicting hash table to make it HW cache friendly
  • Look at gprof to figure out which functions are being spent time in
  • Find latency of both (a) fast path and (b) slow path for both algorithms
    • You can write a microbenchmark for this!
    • Figure out the ratio of misses vs hits (keep track of this for the real traces)
    • Split off hashes from hash table
@thedavidchu thedavidchu self-assigned this Aug 29, 2024
@thedavidchu
Copy link
Owner Author

According to 4de70ea, it is because Evicting Map's slow path is MUCH slower

Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment
Labels
None yet
Projects
None yet
Development

No branches or pull requests

1 participant