Cornell Systems Lunch
CS 7490 Spring 2019
The Systems Lunch is a seminar for discussing recent, interesting papers in the systems area, broadly defined to span operating systems, distributed systems, networking, architecture, databases, and programming languages. The goal is to foster technical discussions among the Cornell systems research community. We meet once a week on Fridays at noon in Gates 114.
The systems lunch is open to all Cornell Ph.D. students interested in systems. First-year graduate students are especially welcome. Non-Ph.D. students have to obtain permission from the instructor. Student participants are expected to sign up for CS 7490, Systems Research Seminar, for one credit.
Links to papers and abstracts below are unlikely to work outside the Cornell CS firewall. If you have trouble viewing them, this is the likely cause.
|January 25||Trustworthy and Private Computation in Adversarial Environments
Note: this talk will take place at 3pm in Gates 122
|Charalampos Papamanthou (UMD)|
|February 1||Three steps is all you need: fast, accurate, automatic scaling decisions for distributed streaming dataflows
Vasiliki Kalavri, John Liagouris, Moritz Hoffmann, and Desislava Dimitrova, ETH Zurich; Matthew Forshaw, Newcastle University; Timothy Roscoe, ETH Zurich
|February 8||The Case for Learned Index Structures
Tim Kraska (MIT), Alex Beutel, Ed H. Chi, Jeffrey Dean, Neoklis Polyzotis (Google)
|February 15||Shoal: A Network Architecture for Disaggregated Racks
Vishal Shrivastav, Cornell University; Asaf Valadarsky, Hebrew University of Jerusalem; Hitesh Ballani and Paolo Costa, Microsoft Research; Ki Suh Lee, Waltz Networks; Han Wang, Barefoot Networks; Rachit Agarwal and Hakim Weatherspoon, Cornell University
|February 22||Coordinating Hundreds of Cooperative, Autonomous Vehicles in Warehouses
Peter R. Wurman, Raffaello D'Andrea, and Mick Mountz (Kiva Systems)
|March 1||Exploiting Commutativity For Practical Fast Replication
Seo Jin Park and John Ousterhout, Stanford University
|March 8||R U Free? Low-Latency, Throughput-Optimal Datacenter Transport Protocol
Qizhe Cai and Rachit Agarwal
|March 15||LoCo: Localizing Congestion
Saksham Agarwal and Rachit Agarwal
|March 22||Spanner: past, present, and (some of) the open problems
Spanner is a globally distributed transactional data management system that backs hundreds of mission-critical services at Google and operates on a massive scale: 10s of millions operations per second, 100s of petabytes, 1000s of databases. This talk will provide an overview of the system (NSDI 2012, SIGMOD 2017), zoom in on several current projects, and describe selected open problems.
Alex Khesin is a Principal Engineer at Google. During his 15 years at Google he has worked on databases, distributed file systems, and search engines. His core area of expertise is large distributed systems; his current focus is Spanner where he is leading a team developing Full Text Search subsystem.
He graduated from Cornell College of Engineering in 1994 with BS in Computer Science and received MS from New York University in 1998.
|Alex Khesin (Google)|
Cancelled (to accommodate a colloquium that was rescheduled)
|April 5||Spring Break, no meeting.|
|April 12||ACSU Luncheon no systems lunch, no meeting.|
|April 19||System isolation by software/hardware co-design
Isolation is an effective approach to building reliable systems from unreliable components. It is hard, if possible, to entirely eliminate bugs from software components; a more practical way is to assume the existence of bugs/vulnerabilities and live with them. This talk will present different ways to do system isolation, including software solutions like hypervisor, nested virtualization and same-level isolation, as well as hardware solutions like Intel SGX, AMD SEV and ARM TrustZone. It will also discuss the tradeoff between isolation and performance, and propose software/hardware co-designed systems to optimize the interaction between isolated domains.
Yubin Xia is an associate professor of IPADS group, Shanghai Jiao Tong University. His research areas include operating system, hypervisor, TEE (trusted execution environment), and computer architecture. He leads his team to implement T6, a TEE OS running on ARM TrustZone platform, which has been deployed on hundreds of millions of mobile phones over the world. His current main research interests lie in practical design and implementation for better system isolation as well as performance optimization.
|Yubin Xia (SJTU)|
|April 26||Fantastic Logs and Where To Find Them
Abstract: Transparency logs allow users to audit a potentially malicious service, paving the way towards a more accountable Internet. For example, in HTTPS, transparency logs are used to map each website to the history of its public keys, allowing websites to check if they have been impersonated. Yet, to achieve their full potential, transparency logs must be bandwidth-efficient when queried by users. Specifically, everyone should be able to (1) efficiently look up log entries by their key and (2) efficiently verify that the log remains append-only. Unfortunately, without additional trust assumptions, current transparency logs cannot provide both small-sized lookup proofs and small-sized append-only proofs. In fact, one of the proofs always requires bandwidth linear in the size of the log, making it expensive for everyone to query the log. In this paper, we address this gap with a new primitive called an append-only authenticated dictionary (AAD). We present efficient AADs from bilinear and RSA accumulators. Our construction is the first to achieve logarithmic sizes for both proof types.
Bio: Alin is a PhD candidate at MIT focusing on public-key distribution for HTTPS and secure messaging. His interests lie at the intersection of theory and practice: he enjoys applied cryptography and building systems. Recently, Alin worked on Catena, a system that leverages the Bitcoin blockchain to prevent equivocation attacks on public-key directories. In the past, Alin has worked on privacy-preserving file systems, private social networking and secure email. Alin's other interests include cryptocurrencies, anonymous networks and distributed systems in general.
|Alin Tomescu (MIT)|
|May 3||The Quest for Low Latency
Abstract: As data-driven applications continue to push the limits of data center infrastructure, achieving consistently low communication latency has emerged as a long-term challenge. Data-driven computations rely heavily on synchronous remote procedure calls (RPCs) to conduct computations close to data. As data center networks approach microsecond forwarding delays, existing hardware and software techniques become inadequate to hide these latencies. Traditionally, hardware has been used to hide nanoseconds, while operating systems can hide milliseconds, with no solution adequate for microsecond-scale latencies. Solutions to the communication latency challenge will require a combination of hardware, software, and networking techniques, laying out a research direction for years to come.
This talk focuses on software solutions to the communication latency problem. I will describe how communication latency became so significant, why existing hardware and software approaches cannot fully solve the latency problem, and why a future solution is unlikely to come from hardware or software alone. I then survey the progress to date in software solutions to the problem. If time permits, I will give an outlook on proposed hardware techniques and how they might combine with software solutions.
Bio: Simon is an assistant professor at the University of Texas at Austin, where he conducts research in operating systems and networks. He received a Ph.D. in Computer Science from ETH Zurich in 2012 and an MSc in Computer Science from the Carl-von-Ossietzky University Oldenburg, Germany in 2006. Before joining UT Austin in 2016, he was a research associate at the University of Washington from 2012-2016. His work is supported by VMware, Microsoft Research, Huawei, Google, Citadel Securities, and ARM. He was twice awarded the Jay Lepreau Best Paper Award, in 2014 and 2016. He received an NSF CAREER Award and he is a Sloan research fellow. Simon is the director of the Texas Systems Research Consortium, where he collaborates closely with industry to shape the future of cloud computing.
Simon is currently co-designing operating system networking and storage stacks with new hardware technologies to push server I/O efficiency an order of magnitude beyond today's capabilities. He is also working on networking issues that arise when pushing performance far beyond current capabilities. His group open-sources all built research systems.
|Simon Peter (UT Austin)|