Packet scheduling is a classic problem in networking. In recent years, however, the focus on packet scheduling has somewhat shifted from designing new scheduling algorithms to designing generalized frameworks that can be programmed to approximate a variety of scheduling disciplines. Push-In-First-Out (PIFO) from SIGCOMM 2016 is such a framework that has been shown … Continue Reading ››
Tag Archives: Programmable Networks
Presented Keynote Talk at CloudNet’2020
Earlier this week, I presented a keynote talk on the state of network-informed data systems design at the CloudNet'2020 conference, with a specific focus on our recent works on memory disaggregation (Infiniswap, Leap, and NetLock), and discussed the many open challenges toward making memory … Continue Reading ››
NetLock Accepted to Appear at SIGCOMM’2020
High-throughput, low-latency lock managers are useful for building a variety of distributed applications. Traditionally, a key tradeoff in this context had been expressed in terms of the amount of knowledge available to the lock manager. On the one hand, a decentralized lock manager can increase throughput by parallelization, but it can starve certain … Continue Reading ››