Trevor A Brown

Alistarh Group

9 Publications

Mark all

[9]
2023 | Published | Conference Poster | IST-REx-ID: 12736 | OA
Aksenov V, Brown TA, Fedorov A, Kokorin I. 2023. Unexpected scaling in path copying trees, Association for Computing Machinery,p.
[Published Version] View | DOI | Download Published Version (ext.)
 
[8]
2022 | Published | Conference Paper | IST-REx-ID: 11181 | OA
Brown TA, Sigouin W, Alistarh D-A. 2022. PathCAS: An efficient middle ground for concurrent search data structures. Proceedings of the 27th ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming. PPoPP: Sympopsium on Principles and Practice of Parallel Programming, 385–399.
[Published Version] View | Files available | DOI | WoS
 
[7]
2020 | Published | 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 | WoS
 
[6]
2020 | Published | Conference Paper | IST-REx-ID: 7636 | OA
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: Principles and Practice of Parallel Programming, 276–291.
[Published Version] View | DOI | Download Published Version (ext.) | WoS
 
[5]
2020 | Published | 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: Annual Technical Conference, 295–306.
[Published Version] View | Download Published Version (ext.)
 
[4]
2018 | Published | 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 | WoS
 
[3]
2018 | Published | 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.
[Preprint] View | Files available | DOI | WoS
 
[2]
2018 | Published | 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.
[Preprint] View | DOI | Download Preprint (ext.) | WoS | arXiv
 
[1]
2018 | Published | 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.
[Preprint] View | Files available | DOI | Download Preprint (ext.) | WoS | arXiv
 
Marked Publication(s)

Search

Filter Publications

  • 7 OA Fulltext(s)

Display / Sort

Citation Style: ISTA Annual Report

Export / Embed

1 Grants


NSERC Postdoctoral fellowship

2017-10-15 – 2018-08-31
Natural Sciences and Engineering Research Council of Canada

9 Publications

Mark all

[9]
2023 | Published | Conference Poster | IST-REx-ID: 12736 | OA
Aksenov V, Brown TA, Fedorov A, Kokorin I. 2023. Unexpected scaling in path copying trees, Association for Computing Machinery,p.
[Published Version] View | DOI | Download Published Version (ext.)
 
[8]
2022 | Published | Conference Paper | IST-REx-ID: 11181 | OA
Brown TA, Sigouin W, Alistarh D-A. 2022. PathCAS: An efficient middle ground for concurrent search data structures. Proceedings of the 27th ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming. PPoPP: Sympopsium on Principles and Practice of Parallel Programming, 385–399.
[Published Version] View | Files available | DOI | WoS
 
[7]
2020 | Published | 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 | WoS
 
[6]
2020 | Published | Conference Paper | IST-REx-ID: 7636 | OA
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: Principles and Practice of Parallel Programming, 276–291.
[Published Version] View | DOI | Download Published Version (ext.) | WoS
 
[5]
2020 | Published | 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: Annual Technical Conference, 295–306.
[Published Version] View | Download Published Version (ext.)
 
[4]
2018 | Published | 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 | WoS
 
[3]
2018 | Published | 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.
[Preprint] View | Files available | DOI | WoS
 
[2]
2018 | Published | 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.
[Preprint] View | DOI | Download Preprint (ext.) | WoS | arXiv
 
[1]
2018 | Published | 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.
[Preprint] View | Files available | DOI | Download Preprint (ext.) | WoS | arXiv
 
Marked Publication(s)

Search

Filter Publications

  • 7 OA Fulltext(s)

Display / Sort

Citation Style: ISTA Annual Report

Export / Embed