7 Publications

Mark all

[7]
2020 | Conference Paper | IST-REx-ID: 7272 | OA
Arbel-Raviv, Maya, Trevor A Brown, and Adam Morrison. “Getting to the Root of Concurrent Binary Search Tree Performance.” In Proceedings of the 2018 USENIX Annual Technical Conference, USENIX ATC 2018, 295–306. USENIX Association, 2020.
View | Download Published Version (ext.)
 
[6]
2020 | Conference Paper | IST-REx-ID: 7636
Brown, Trevor A, Aleksandar Prokopec, and Dan-Adrian Alistarh. “Non-Blocking Interpolation Search Trees with Doubly-Logarithmic Running Time.” In Proceedings of the ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming, PPOPP, 276–91. ACM, 2020. https://doi.org/10.1145/3332466.3374542.
View | DOI
 
[5]
2020 | Conference Paper | IST-REx-ID: 8191
Alistarh, Dan-Adrian, Trevor A Brown, and Nandini Singhal. “Memory Tagging: Minimalist Synchronization for Scalable Concurrent Data Structures.” In Annual ACM Symposium on Parallelism in Algorithms and Architectures, 37–49. ACM, 2020. https://doi.org/10.1145/3350755.3400213.
View | DOI
 
[4]
2018 | Conference Paper | IST-REx-ID: 5963 | OA
Alistarh, Dan-Adrian, Trevor A Brown, Justin Kopinsky, and Giorgi Nadiradze. “Relaxed Schedulers Can Efficiently Parallelize Iterative Algorithms.” In Proceedings of the 2018 ACM Symposium on Principles of Distributed Computing  - PODC ’18, 377–86. ACM Press, 2018. https://doi.org/10.1145/3212734.3212756.
View | DOI | Download Preprint (ext.) | arXiv
 
[3]
2018 | Conference Paper | IST-REx-ID: 5965 | OA
Alistarh, Dan-Adrian, Trevor A Brown, Justin Kopinsky, Jerry Z. Li, and Giorgi Nadiradze. “Distributionally Linearizable Data Structures.” In Proceedings of the 30th on Symposium on Parallelism in Algorithms and Architectures  - SPAA ’18, 133–42. ACM Press, 2018. https://doi.org/10.1145/3210377.3210411.
View | DOI | Download Preprint (ext.) | arXiv
 
[2]
2018 | Conference Paper | IST-REx-ID: 397
Arbel Raviv, Maya, and Trevor A Brown. “Harnessing Epoch-Based Reclamation for Efficient Range Queries,” 53:14–27. ACM, 2018. https://doi.org/10.1145/3178487.3178489.
View | DOI
 
[1]
2018 | Conference Paper | IST-REx-ID: 85 | OA
Gilad, Eran, Trevor A Brown, Mark Oskin, and Yoav Etsion. “Snapshot Based Synchronization: A Fast Replacement for Hand-over-Hand Locking,” 11014:465–79. Springer, 2018. https://doi.org/10.1007/978-3-319-96983-1_33.
View | Files available | DOI
 

Search

Filter Publications

7 Publications

Mark all

[7]
2020 | Conference Paper | IST-REx-ID: 7272 | OA
Arbel-Raviv, Maya, Trevor A Brown, and Adam Morrison. “Getting to the Root of Concurrent Binary Search Tree Performance.” In Proceedings of the 2018 USENIX Annual Technical Conference, USENIX ATC 2018, 295–306. USENIX Association, 2020.
View | Download Published Version (ext.)
 
[6]
2020 | Conference Paper | IST-REx-ID: 7636
Brown, Trevor A, Aleksandar Prokopec, and Dan-Adrian Alistarh. “Non-Blocking Interpolation Search Trees with Doubly-Logarithmic Running Time.” In Proceedings of the ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming, PPOPP, 276–91. ACM, 2020. https://doi.org/10.1145/3332466.3374542.
View | DOI
 
[5]
2020 | Conference Paper | IST-REx-ID: 8191
Alistarh, Dan-Adrian, Trevor A Brown, and Nandini Singhal. “Memory Tagging: Minimalist Synchronization for Scalable Concurrent Data Structures.” In Annual ACM Symposium on Parallelism in Algorithms and Architectures, 37–49. ACM, 2020. https://doi.org/10.1145/3350755.3400213.
View | DOI
 
[4]
2018 | Conference Paper | IST-REx-ID: 5963 | OA
Alistarh, Dan-Adrian, Trevor A Brown, Justin Kopinsky, and Giorgi Nadiradze. “Relaxed Schedulers Can Efficiently Parallelize Iterative Algorithms.” In Proceedings of the 2018 ACM Symposium on Principles of Distributed Computing  - PODC ’18, 377–86. ACM Press, 2018. https://doi.org/10.1145/3212734.3212756.
View | DOI | Download Preprint (ext.) | arXiv
 
[3]
2018 | Conference Paper | IST-REx-ID: 5965 | OA
Alistarh, Dan-Adrian, Trevor A Brown, Justin Kopinsky, Jerry Z. Li, and Giorgi Nadiradze. “Distributionally Linearizable Data Structures.” In Proceedings of the 30th on Symposium on Parallelism in Algorithms and Architectures  - SPAA ’18, 133–42. ACM Press, 2018. https://doi.org/10.1145/3210377.3210411.
View | DOI | Download Preprint (ext.) | arXiv
 
[2]
2018 | Conference Paper | IST-REx-ID: 397
Arbel Raviv, Maya, and Trevor A Brown. “Harnessing Epoch-Based Reclamation for Efficient Range Queries,” 53:14–27. ACM, 2018. https://doi.org/10.1145/3178487.3178489.
View | DOI
 
[1]
2018 | Conference Paper | IST-REx-ID: 85 | OA
Gilad, Eran, Trevor A Brown, Mark Oskin, and Yoav Etsion. “Snapshot Based Synchronization: A Fast Replacement for Hand-over-Hand Locking,” 11014:465–79. Springer, 2018. https://doi.org/10.1007/978-3-319-96983-1_33.
View | Files available | DOI
 

Search

Filter Publications