Many concurrent dictionary implementations are designed and optimized for read-mostly
workloads with uniformly distributed keys, and often perform poorly on update-heavy …

Fast navigation through graphs with O (1) cost relies on compact storage of graphs in dense
arrays, but is not efficiently updatable. In this paper we propose storage of updatable graphs …

Parallel batched data structures are designed to process synchronized batches of
operations in a parallel computing model. In this paper, we propose parallel combining, a …

To use the computational power of modern computing machines, we have to deal with
concurrent programs. Writing efficient concurrent programs is notoriously difficult, primarily …

Abstract An HTM-assisted Combining Framework (HCF) may enable multiple (combiner and
non-combiner) threads to access a shared data structure concurrently using hardware …

Frameworks optimised for graph analysis tend to rely on data structures that are write
unfriendly, often assuming that the examined graph is static and immutable. Traditionally …

Operations of concurrent objects often employ optimistic concurrency-control schemes that
consist of a traversal followed by a validation step. The validation checks if concurrent …

Flat combining (FC) and transactional lock elision (TLE) are two techniques that facilitate
efficient multi-thread access to a sequentially implemented data structure protected by a …

[0024] Optimistic synchronization techniques, as used herein, may be considered
synchronization techniques that allow multiple threads to execute their critical sections (CS) …

Frameworks optimised for graph analysis tend to rely on data structures that are write
unfriendly, often assuming that the examined graph is static and immutable. Traditionally …