PAM library

<p>PAM (Parallel Augmented Maps) is an open-source parallel C++ library implementing the interface for sequence, <a href="/facts/Ordered_set/qb4a3FAX">ordered sets</a>, ordered <a href="/facts/Associative_array/IFGd2xcP">maps</a>, and <a href="/facts/Augmented_map/usxe25Kp">augmented maps</a>. The library is available on GitHub. It uses the underlying <a href="/facts/Self-balancing_binary_search_tree/W7WAsES0">balanced binary tree structure</a> using <a href="/facts/Join-based_tree_algorithms/ceN2nU0C">join-based algorithms</a>. PAM supports four balancing schemes, including <a href="/facts/AVL_tree/DfexIbS6">AVL trees</a>, <a href="/facts/Red-black_trees/ckgWTV7G">red-black trees</a>, <a href="/facts/Treap/sNDcxCpE">treaps</a> and <a href="/facts/Weight-balanced_tree/Per0DBtr">weight-balanced trees</a>.
</p><p>PAM is a parallel library and is also safe for concurrency. Its parallelism can be supported by <a href="/facts/Cilk/nIftzSWW">cilk</a>, <a href="/facts/OpenMP/69IpI80o">OpenMP</a> or the scheduler in PBBS. Theoretically, all algorithms in PAM are work-efficient and have polylogarithmic depth. PAM uses underlying <a href="/facts/Persistent_data_structure/K7IpHlkR">persistent</a> tree structure such that multi-versioning is allowed. PAM also supports efficient GC.
</p>

PAM library open-in-new

PAM library