diff --git a/README.md b/README.md index 139fa73..9a066a7 100644 --- a/README.md +++ b/README.md @@ -1,7 +1,7 @@ # The Parallel Hashmap or Abseiling from the shoulders of giants - © Gregory Popovitch - March 3, 2019 -[tl;dr] built on top of Abseil's *flat_hash_map*, the parallel hashmap is more memory friendly, almost as fast as the underlying *flat_hash_map*, and can be used from multiple threads with high levels of concurrency. +[tl;dr] We present a novel hashmap design, the Parallel Hashmap. Built on top of Abseil's *flat_hash_map*, the Parallel Hashmap has lower space requirements, is nearly as fast as the underlying *flat_hash_map*, and can be used from multiple threads with high levels of concurrency. ### A quick look at the current state of the art diff --git a/pdf/parallel_hashmap.html b/pdf/parallel_hashmap.html index fe47e9e..b54ddc4 100644 --- a/pdf/parallel_hashmap.html +++ b/pdf/parallel_hashmap.html @@ -107,7 +107,7 @@

The Parallel Hashmap

or Abseiling from the shoulders of giants - © Gregory Popovitch - March 3, 2019

-

[tl;dr] built on top of Abseil's flat_hash_map, the parallel hashmap is more memory friendly, almost as fast as the underlying flat_hash_map, and can be used from multiple threads with high levels of concurrency.

+

[tl;dr] We present a novel hashmap design, the Parallel Hashmap. Built on top of Abseil's flat_hash_map, the Parallel Hashmap has lower space requirements, is nearly as fast as the underlying flat_hash_map, and can be used from multiple threads with high levels of concurrency.

A quick look at the current state of the art

If you haven't been living under a rock, you know that Google open sourced late last year their Abseil library, which includes a very efficient flat hash table implementation. The absl::flat_hash_map stores the values directly in a memory array, which avoids memory indirections (this is referred to as closed hashing).

closed_hashing