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

Test on memory map approach using mmappickle.mmapdict on /dev/shm instead of PFS on Clusters #5

Closed
sshivam95 opened this issue Jun 11, 2024 · 4 comments

Comments

@sshivam95
Copy link
Collaborator

The memory map approach is taking a lot of time to process the index dictionary in the memory mapped file. It took $3$ days to process $41,602$ entities out of $5,037,674$ in a chunk of 10 million triples.

@sshivam95
Copy link
Collaborator Author

#4 runs on the parallel file system on Noctua clusters with uses lustre. After a discussion with them, it turns out that lustre has a very bad memory management when it comes to memory mapped file. Therefore, storing the memory mapped files in /dev/shm folder should do the trick

@sshivam95
Copy link
Collaborator Author

Update: the write on memory mapped pickle dictionary in /dev/shm is way faster than lustre but still comparatively very slow. It took $1$ day to process $146,893$ entities out of $5,037,674$.

Way faster than lustre but very slow overall.

@sshivam95
Copy link
Collaborator Author

Alternate solution, create a B+ tree implementation in C++

@sshivam95
Copy link
Collaborator Author

sshivam95 commented Jun 12, 2024

Update: Might not be needing this approach if using domain specific datasets under issue #9

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