19 citations · 77 across the 20 of their papers we have counts for
20 papers
Probabilistic Fair Ordering of Events
Muhammad Haseeb, Jinkun Geng, Aurojit Panda +4
A growing class of applications depends on fair ordering, where events that occur earlier should be processed before later ones. Providing such guarantees is difficult in practice…
Aspen: Making Leaderless BFT Fast Paths Practical with Synchronized Clocks
Daniel Qian, Xiyu Hao, Jinkun Geng +4
No Byzantine Fault Tolerant (BFT) protocol can commit a request in less than the single round trip it takes for clients to reach the replicas and hear back. Some protocols approach…
Beyond Lamport, Towards Probabilistic Fair Ordering
Muhammad Haseeb, Jinkun Geng, Radhika Mittal +3
A growing class of applications demands \emph{fair ordering} of events, which ensures that events generated earlier are processed before later events. However, achieving such seque…
Tiga: Accelerating Geo-Distributed Transactions with Synchronized Clocks [Technical Report]
Jinkun Geng, Shuai Mu, Anirudh Sivaraman +1
This paper presents Tiga, a new design for geo-replicated and scalable transactional databases such as Google Spanner. Tiga aims to commit transactions within 1 wide-area roundtrip…
GPUs, CPUs, and... NICs: Rethinking the Network's Role in Serving Complex AI Pipelines
Mike Wong, Ulysses Butler, Emma Farkash +3
The increasing prominence of AI necessitates the deployment of inference platforms for efficient and effective management of AI pipelines and compute resources. As these pipelines…
Design and Implementation of a Scalable Financial Exchange in the Public Cloud
Muhammad Haseeb, Jinkun Geng, Daniel Duclos-Cavalcanti +5
Financial exchanges are migrating to the cloud, but the best-effort nature of the public cloud is at odds with the stringent latency requirements of exchanges. We present Jasper, a…
Application-Defined Receive Side Dispatching on the NIC
Tao Wang, Jinkun Lin, Gianni Antichi +2
Application layer (L7) processing is increasingly implemented in proxies (e.g., Envoy) to simplify administration and management. However, prior work has observed that this reduces…
State-Compute Replication: Parallelizing High-Speed Stateful Packet Processing
Qiongwen Xu, Sebastiano Miano, Xiangyu Gao +6
With the slowdown of Moore's law, CPU-oriented packet processing in software will be significantly outpaced by emerging line speeds of network interface cards (NICs). Single-core p…
High-Level Synthesis for Packet-Processing Pipelines
Xiangyu Gao, Divya Raghunathan, Ruijie Fang +5
Compiling high-level programs to target high-speed packet-processing pipelines is a challenging combinatorial optimization problem. The compiler must configure the pipeline's resou…
P4Testgen: An Extensible Test Oracle For P4
Fabian Ruffy, Jed Liu, Prathima Kotikalapudi +7
We present P4Testgen, a test oracle for the P4 language. P4Testgen supports automatic test generation for any P4 target and is designed to be extensible to many P4 targets.…
Nezha: Deployable and High-Performance Consensus Using Synchronized Clocks
Jinkun Geng, Anirudh Sivaraman, Balaji Prabhakar +1
This paper presents a high-performance consensus protocol, Nezha, which can be deployed by cloud tenants without any support from their cloud provider. Nezha bridges the gap betwee…
Collective Autoscaling for Cloud Microservices
Vighnesh Sachidananda, Anirudh Sivaraman
As cloud applications shift from monoliths to loosely coupled microservices, application developers must decide how many compute resources (e.g., number of replicated containers) t…
Revelio: ML-Generated Debugging Queries for Distributed Systems
Pradeep Dogga, Karthik Narasimhan, Anirudh Sivaraman +3
A major difficulty in debugging distributed systems lies in manually determining which of the many available debugging tools to use and how to query its logs. Our own study of a pr…
Synthesizing Safe and Efficient Kernel Extensions for Packet Processing
Qiongwen Xu, Michael D. Wong, Tanvi Wagle +2
Extended Berkeley Packet Filter (BPF) has emerged as a powerful method to extend packet-processing functionality in the Linux operating system. BPF allows users to write code in hi…
The case for model-driven interpretability of delay-based congestion control protocols
Muhammad Khan, Yasir Zaki, Shiva Iyer +5
Analyzing and interpreting the exact behavior of new delay-based congestion control protocols with complex non-linear control loops is exceptionally difficult in highly variable ne…
Isolation mechanisms for high-speed packet-processing pipelines
Tao Wang, Xiangrui Yang, Gianni Antichi +2
Data-plane programmability is now mainstream. As we find more use cases, deployments need to be able to run multiple packet-processing modules in a single device. These are likely…
Gauntlet: Finding Bugs in Compilers for Programmable Packet Processing
Fabian Ruffy, Tao Wang, Anirudh Sivaraman
Programmable packet-processing devices such as programmable switches and network interface cards are becoming mainstream. These devices are configured in a domain-specific language…
Testing Compilers for Programmable Switches Through Switch Hardware Simulation
Michael D. Wong, Aatish Kishan Varma, Anirudh Sivaraman
Programmable switches have emerged as powerful and flexible alternatives to fixed-function forwarding devices. But because of the unique hardware constraints of network switches, t…
Programmable Packet Scheduling
Anirudh Sivaraman, Suvinay Subramanian, Anurag Agrawal +7
Switches today provide a small set of scheduling algorithms. While we can tweak scheduling parameters, we cannot modify algorithmic logic, or add a completely new algorithm, after…
Packet Transactions: High-level Programming for Line-Rate Switches
Anirudh Sivaraman, Mihai Budiu, Alvin Cheung +6
Many algorithms for congestion control, scheduling, network measurement, active queue management, security, and load balancing require custom processing of packets as they traverse…