6 citations · 20 across the 13 of their papers we have counts for
Showing 2013Show all
2 papers · 1 filter
cs.DC2013★ 3 cited
DeltaTree: A Practical Locality-aware Concurrent Search Tree
Ibrahim Umar, Otto Anshus, Phuong Ha
As other fundamental programming abstractions in energy-efficient computing, search trees are expected to support both high parallelism and data locality. However, existing highly-…
cs.DC2013★ 5 cited
Lock-free Concurrent Data Structures
Daniel Cederman, Anders Gidenstam, Phuong Ha +3
Concurrent data structures are the data sharing side of parallel programming. Data structures give the means to the program to store data, but also provide operations to the progra…