Concurrent Data Structures over RDMA
This project aims to build a collection of commonly used concurrent data structures, such as hashtable, linked list, and search tree, that will utilize 1-sided RDMA primitives to enable scalable sharing over the network. The approach is to utilize lock-less paradigms, such as RCU (read-copy-update) for improved robustness and concurrency.
- Gregory Chockler, Royal Holloway, University of London, UK
- Alexey Gotsman, IMDEA, Spain
- Noam Rinetzky, Tel Aviv University, Israel
- Yuri Meshman, IMDEA, Spain