| Concurrent updates with rcu: Search tree as an example M Arbel, H Attiya Proceedings of the 2014 ACM symposium on Principles of distributed computing …, 2014 | 108 | 2014 |
| Harnessing epoch-based reclamation for efficient range queries M Arbel-Raviv, T Brown ACM SIGPLAN Notices 53 (1), 14-27, 2018 | 39 | 2018 |
| Predicate rcu: An rcu for scalable concurrent updates M Arbel, A Morrison ACM SIGPLAN Notices 50 (8), 21-30, 2015 | 38 | 2015 |
| Getting to the root of concurrent binary search tree performance M Arbel-Raviv, T Brown, A Morrison 2018 USENIX Annual Technical Conference (USENIX ATC 18), 295-306, 2018 | 31 | 2018 |
| Reuse, don't recycle: Transforming lock-free algorithms that throw away descriptors M Arbel-Raviv, T Brown arXiv preprint arXiv:1708.01797, 2017 | 19 | 2017 |
| Towards automatic lock removal for scalable synchronization M Arbel, G Golan-Gueta, E Hillel, I Keidar International Symposium on Distributed Computing, 170-184, 2015 | 6 | 2015 |
| Automatic lock removal method for scalable synchronization in dynamic data structures E Hillel, M Arbel, G Gueta, I Keidar US Patent 10,078,653, 2018 | 5 | 2018 |
| POSTER: Reuse, don't Recycle: Transforming Algorithms that Throw Away Descriptors M Arbel-Raviv, T Brown ACM SIGPLAN Notices 52 (8), 429-430, 2017 | 4 | 2017 |
| Automatic lock removal method for scalable synchronization in dynamic data structures E Hillel, M Arbel, G Gueta, I Keidar US Patent 10,963,447, 2021 | | 2021 |
Trevor BrownUniversity of WaterlooVerified email at tbrown.pro
