7 Publications

Mark all

[7]
2020 | Conference Paper | IST-REx-ID: 8191
Alistarh D-A, Brown TA, Singhal N. Memory tagging: Minimalist synchronization for scalable concurrent data structures. In: Annual ACM Symposium on Parallelism in Algorithms and Architectures. ACM; 2020:37-49. doi:10.1145/3350755.3400213
View | DOI
 
[6]
2020 | Conference Paper | IST-REx-ID: 7272 | OA
Arbel-Raviv M, Brown TA, Morrison A. Getting to the root of concurrent binary search tree performance. In: Proceedings of the 2018 USENIX Annual Technical Conference. USENIX Association; 2020:295-306.
View | Download Published Version (ext.)
 
[5]
2020 | Conference Paper | IST-REx-ID: 7636
Brown TA, Prokopec A, Alistarh D-A. Non-blocking interpolation search trees with doubly-logarithmic running time. In: Proceedings of the ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming. ACM; 2020:276-291. doi:10.1145/3332466.3374542
View | DOI
 
[4]
2018 | Conference Paper | IST-REx-ID: 85 | OA
Gilad E, Brown TA, Oskin M, Etsion Y. Snapshot based synchronization: A fast replacement for Hand-over-Hand locking. In: Vol 11014. Springer; 2018:465-479. doi:10.1007/978-3-319-96983-1_33
View | Files available | DOI
 
[3]
2018 | Conference Paper | IST-REx-ID: 5963 | OA
Alistarh D-A, Brown TA, Kopinsky J, Nadiradze G. Relaxed schedulers can efficiently parallelize iterative algorithms. In: Proceedings of the 2018 ACM Symposium on Principles of Distributed Computing  - PODC ’18. ACM Press; 2018:377-386. doi:10.1145/3212734.3212756
View | DOI | Download Preprint (ext.) | arXiv
 
[2]
2018 | Conference Paper | IST-REx-ID: 5965 | OA
Alistarh D-A, Brown TA, Kopinsky J, Li JZ, Nadiradze G. Distributionally linearizable data structures. In: Proceedings of the 30th on Symposium on Parallelism in Algorithms and Architectures  - SPAA ’18. ACM Press; 2018:133-142. doi:10.1145/3210377.3210411
View | DOI | Download Preprint (ext.) | arXiv
 
[1]
2018 | Conference Paper | IST-REx-ID: 397
Arbel Raviv M, Brown TA. Harnessing epoch-based reclamation for efficient range queries. In: Vol 53. ACM; 2018:14-27. doi:10.1145/3178487.3178489
View | DOI
 

Search

Filter Publications

7 Publications

Mark all

[7]
2020 | Conference Paper | IST-REx-ID: 8191
Alistarh D-A, Brown TA, Singhal N. Memory tagging: Minimalist synchronization for scalable concurrent data structures. In: Annual ACM Symposium on Parallelism in Algorithms and Architectures. ACM; 2020:37-49. doi:10.1145/3350755.3400213
View | DOI
 
[6]
2020 | Conference Paper | IST-REx-ID: 7272 | OA
Arbel-Raviv M, Brown TA, Morrison A. Getting to the root of concurrent binary search tree performance. In: Proceedings of the 2018 USENIX Annual Technical Conference. USENIX Association; 2020:295-306.
View | Download Published Version (ext.)
 
[5]
2020 | Conference Paper | IST-REx-ID: 7636
Brown TA, Prokopec A, Alistarh D-A. Non-blocking interpolation search trees with doubly-logarithmic running time. In: Proceedings of the ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming. ACM; 2020:276-291. doi:10.1145/3332466.3374542
View | DOI
 
[4]
2018 | Conference Paper | IST-REx-ID: 85 | OA
Gilad E, Brown TA, Oskin M, Etsion Y. Snapshot based synchronization: A fast replacement for Hand-over-Hand locking. In: Vol 11014. Springer; 2018:465-479. doi:10.1007/978-3-319-96983-1_33
View | Files available | DOI
 
[3]
2018 | Conference Paper | IST-REx-ID: 5963 | OA
Alistarh D-A, Brown TA, Kopinsky J, Nadiradze G. Relaxed schedulers can efficiently parallelize iterative algorithms. In: Proceedings of the 2018 ACM Symposium on Principles of Distributed Computing  - PODC ’18. ACM Press; 2018:377-386. doi:10.1145/3212734.3212756
View | DOI | Download Preprint (ext.) | arXiv
 
[2]
2018 | Conference Paper | IST-REx-ID: 5965 | OA
Alistarh D-A, Brown TA, Kopinsky J, Li JZ, Nadiradze G. Distributionally linearizable data structures. In: Proceedings of the 30th on Symposium on Parallelism in Algorithms and Architectures  - SPAA ’18. ACM Press; 2018:133-142. doi:10.1145/3210377.3210411
View | DOI | Download Preprint (ext.) | arXiv
 
[1]
2018 | Conference Paper | IST-REx-ID: 397
Arbel Raviv M, Brown TA. Harnessing epoch-based reclamation for efficient range queries. In: Vol 53. ACM; 2018:14-27. doi:10.1145/3178487.3178489
View | DOI
 

Search

Filter Publications