7 Publications

Mark all

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

Search

Filter Publications

7 Publications

Mark all

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

Search

Filter Publications