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

More efficient buffering algorithms #14

Open
ljwoods2 opened this issue May 5, 2024 · 0 comments
Open

More efficient buffering algorithms #14

ljwoods2 opened this issue May 5, 2024 · 0 comments

Comments

@ljwoods2
Copy link
Collaborator

ljwoods2 commented May 5, 2024

  1. Setup ASV benchmarks to get a baseline of performance in current solution
  2. Experiment to find the fastest on-average fixed chunk size
  3. In reader, use trajectory slicing to pull the next needed chunks rather than allowing LRU cache to handle it
  4. In writer, experiment with parallelizing writes across different datasets (IE step, time, etc) to see if engaging more cores improves performance in IO operations
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