libgrape-lite
gtl
Our great sponsors
| libgrape-lite | gtl | |
|---|---|---|
| 3 | 5 | |
| 365 | 89 | |
| 1.1% | - | |
| 6.3 | 7.1 | |
| 28 days ago | 21 days ago | |
| C++ | C++ | |
| Apache License 2.0 | Apache License 2.0 |
Stars - the number of stars that a project has on GitHub. Growth - month over month growth in stars.
Activity is a relative number indicating how actively a project is being developed. Recent commits have higher weight than older ones.
For example, an activity of 9.0 indicates that a project is amongst the top 10% of the most actively developed projects that we are tracking.
libgrape-lite
-
libgrape-lite VS CXXGraph - a user suggested alternative
2 projects | 17 Mar 2022
-
GraphScope: A One-Stop Large-Scale Graph Computing System
We don't have a benchmark between the analytical engine in GraphScope (aka. GAE) with GraphX/Giraph. But we do have evaluated the performance of the underlying engine of GAE (libgrape-lite) with LDBC Graph Analytics Benchmark and it achieves higher performance comparably to the state-of-the-art systems [2].
[1]: https://github.com/alibaba/libgrape-lite
[2]: https://github.com/alibaba/libgrape-lite/blob/master/Perform...
gtl
-
Inside boost::concurrent_flat_map
gtl library author here. Very nice writeup! Reading it made me think, and I believe I know why gtl::parallel_flat_hash_map performs comparatively worse for high-skew scenarios (just pushed a fix in gtl).
-
Boost 1.81 will have boost::unordered_flat_map...
I do this as well in my phmap and gtl implementations. It makes the tables look worse in benchmarks like the above, but prevents really bad surprises occasionally.
-
Comprehensive C++ Hashmap Benchmarks 2022
Thanks a lot for the great benchmark, Martin. Glad you used different hash functions, because I do sacrifice some speed to make sure that the performance of my hash maps doesn't degrade drastically with poor hash functions. Happy to see that my phmap and gtl (the C++20 version) performed well.
-
It is now trivial to cache pure functions with highly efficient, concurrent cache.
This is very easy to do with the latest version of gtl. And it is extremely efficient, as the caching mechanism uses the parallel hashmap, which internally is divided into N submaps each with its own mutex, reducing mutex contention to a minimum.
-
Updating map_benchmarks: Send your hashmaps!
AFAIK sparsepp has been dropped entirely in favor of the containers in GTL: https://github.com/greg7mdp/gtl
What are some alternatives?
QuickQanava - :link: C++17 network / graph visualization library - Qt6 / QML node editor.
eytzinger - Cache-friendly associative STL-like container with an Eytzinger (BFS) layout for C++
GraphScope - 🔨 🍇 💻 🚀 GraphScope: A One-Stop Large-Scale Graph Computing System from Alibaba | 一站式图计算系统
fph-table - Flash Perfect Hash Table: an implementation of a dynamic perfect hash table, extremely fast for lookup
CXXGraph - Header-Only C++ Library for Graph Representation and Algorithms
Google Test - GoogleTest - Google Testing and Mocking Framework
euler - A distributed graph deep learning framework.
flat_hash_map - A very fast hashtable
libvineyard - vineyard (v6d): an in-memory immutable data manager. [Moved to: https://github.com/alibaba/v6d]
google-sparsehash - Clone of google-sparsehash
HPCInfo - Information about many aspects of high-performance computing. Wiki content moved to ~/docs.
libcudacxx - [ARCHIVED] The C++ Standard Library for your entire system. See https://github.com/NVIDIA/cccl