  Skiplists are used in a variety of applications for storing data subject to
order criteria. In this article we discuss the design, analysis and performance
of a concurrent deterministic skip list on many-core NUMA nodes. We also
evaluate the performance of a concurrent lock-free unbounded queue
implementation and three implementations of multi-writer, multi-reader~(MWMR)
hash tables and compare their performance with equivalent implementations from
Intel's Thread Building Blocks~(TBB) library. We focus on strategies for memory
management that reduce page faults and cache misses for the memory access
patterns in these data structures. This paper proposes hierarchical usage of
concurrent data structures in programs to improve memory latencies by reducing
memory accesses from remote NUMA nodes.
