At Brown, I am involved in a few of projects; studying microservices and the networking model.
In my undergraduate, I built concurrent data structures using one-sided RDMA. In total, I implemented three novel designs of a B+Tree, skiplist, and an IHT (Inter-locked hashtable). I also designed a software-cache for one-sided RDMA that enabled a high-performance design by optimizing the read-heavy traversals of the tree-like indexes in the B+Tree, skiplist, and IHT.