Welcome to the Berkeley NetSys Lab

Active Projects

view all

Programmable RDMA

We propose extensions to RDMA called Remote Memory Calls (RMCs) that allows applications to install a customized set of 1-sided RDMA operations. We are exploring how can RMCs be implemented on the forthcoming generation of SmartNICs, and we will compare its performance to pure 1-sided and 2-sided RDMA operations.


The introduction of computational resources at the network edge allows application designers to offload computation from clients and/or servers. We propose a design called the Client-Edge-Server for Stateful Network Applications (CESSNA) for client-edge-server systems so they can tolerate edge failures and client mobility.


We propose CellBricks, a novel cellular architecture that lowers the barrier to entry for new operators by enabling users to consume access on-demand from any available cellular operator — small or large, trusted or untrusted.

Efficient Work Stealing

Existing techniques such as work stealing perform well for long tasks, but can be inefficient for short tasks that take only a couple of microseconds. We explore techniques to perform load balancing more efficiently, so that requests are handled faster and cores waste fewer cycles looking for work.


Several recent laws (e.g., GDPR and CCPA) constrain how applications collect and utilize user data, and ensuring compliance to these constraints is challenging. Blockaid is a system that enforces data access policies for web applications using a proxy that interposes on the connection between the application and the database.


The conventional wisdom requires that all congestion control algorithms deployed on the public Internet be TCP-friendly. We propose an alternative to the TCP-friendly paradigm that can accommodate innovation, is consistent with the Internet’s current economic model, and is feasible to deploy given current usage trends.


Distributed in-memory storage systems lose all state on failure, so recovery is expensive and data loss is always a risk. The Persimmon system leverages persistent memory (PM) to convert existing in-memory storage systems into persistent, crash-consistent versions with low overhead and minimal code changes.

Routing Resilience

A project in this area attempts to deliver a routing resiliency mechanism that is easily implementable, easily deployable, and easily manageable while offering packet delivery rates that rival those of the most sophisticated resiliency mechanisms.

Smarter Prefetching

We propose a smart memory prefetcher to exploit the predictability of memory access patterns in data oblivious algorithms to reduce their memory footprint, while limiting their performance degradation. It can use information garnered from one execution to accurately prefetch on subsequent executions of an application.

Recent Publications

view all

Blockaid: Data Access Policy Enforcement for Web Applications

Wen Zhang, Eric Sheng, Michael Chang, Aurojit Panda, Mooly Sagiv, Scott Shenker, NSDI '22

Read the Paper

Efficient Scheduling Policies for Microsecond-Scale Tasks

Sarah McClure and Amy Ousterhout, Scott Shenker, Sylvia Ratnasamy, NSDI '22

Read the Paper

dSpace: Composable Abstractions for Smart Spaces

Silvery Fu, Sylvia Ratnasamy, SOSP '21

Read the Paper

Democratizing Cellular Access with CellBricks

Zhihong Luo, Silvery Fu, Mark Theis, Shaddi Hasan, Sylvia Ratnasamy, Scott Shenker, SIGCOMM '21

Read the Paper

Rethinking networking abstractions for cloud tenants

Sarah McClure, Sylvia Ratnasamy, Deepak Bansal, and Jitendra Padhye, HotOS'21

Read the Paper

Recent News

view all

Efficient Scheduling Policies for Microsecond-scale Tasks is accepted to NSDI!

Congratulations to Sarah and Amy!

Read more

Scott Shenker wins SIGOPS Hall of Fame Award for Onix

Congratulations to Scott on the award!

Read more

dSpace is accepted to SOSP!

Congratulations to Silvery!

Read more

Welcome Emily and Tenzin

Emily Marx and Tenzin Ukyab join NetSys. Welcome!

Read more