7 Publications

Mark all

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

Search

Filter Publications

7 Publications

Mark all

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

Search

Filter Publications