2018
DOI: 10.1109/tpds.2017.2729551
|View full text |Cite
|
Sign up to set email alerts
|

Eunomia: Scaling Concurrent Index Structures Under Contention Using HTM

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1

Citation Types

0
1
0

Year Published

2018
2018
2024
2024

Publication Types

Select...
2
2

Relationship

0
4

Authors

Journals

citations
Cited by 4 publications
(1 citation statement)
references
References 41 publications
0
1
0
Order By: Relevance
“…Concurrent data structures are fundamental building blocks for computer science. Data layout for better spatial locality and concurrency is becoming ever more crucial in the multiand many-core era [6,10,15,22,34,36,43,53,61,68,69]. Im and Yelick presented a register blocking method to improve the performance of SpMV [17].…”
Section: Related Workmentioning
confidence: 99%
“…Concurrent data structures are fundamental building blocks for computer science. Data layout for better spatial locality and concurrency is becoming ever more crucial in the multiand many-core era [6,10,15,22,34,36,43,53,61,68,69]. Im and Yelick presented a register blocking method to improve the performance of SpMV [17].…”
Section: Related Workmentioning
confidence: 99%