CODEWITHSUNDEEP
cmemory-managementdata-structures
thwd
thwd

Reputation: 24818

Keeping a tree/hashtable in RAM

I have to write a simple key-value store for a very specific use. This store will be running in the same memory space as the process that uses it.

One requirement for this store is that it is kept in RAM and it has to be as fast as possible. We haven't decided for a data structure but we might be using a LLRB-Tree.

How can I make sure that my data structure will always be kept in RAM? Not swapped, not paged, not cached somewhere else but exclusively in-memory.

Upvotes: 1

Views: 85

Answers (1)

SKi
SKi

Reputation: 8466

If you use Linux, then check mlock()

mlock() and mlockall() respectively lock part or all of the calling process's virtual address space into RAM, preventing that memory from being paged to the swap area. (man page)

Upvotes: 2

Related Questions