For the MLD algorithm we can partition the NodeID range into boundary and non-boundary nodes. Since there are only we boundary nodes we can use the ArrayStorage for those yielding much faster query times. |
||
|---|---|---|
| .. | ||
| algorithm_datafacade.hpp | ||
| contiguous_block_allocator.hpp | ||
| contiguous_internalmem_datafacade.hpp | ||
| datafacade_base.hpp | ||
| mmap_memory_allocator.hpp | ||
| process_memory_allocator.hpp | ||
| shared_memory_allocator.hpp | ||