The David R. Cheriton School of Computer Science invites you to attend the 2018 Cheriton Research Symposium, held on Friday, September 21, 2018 in the Davis Centre.
This year's symposium consists of presentations by David R. Cheriton himself along with presentations by David R. Cheriton Faculty Fellows Bernard Wong and Edward Lank.
Posters by David R. Cheriton Graduate Scholarship recipients will be on display in the Great Hall, Davis Centre from 10:00 am to 3:00 pm on September 21, 2018.
Friday, September 21, 2018
Daniel G. Brown, Director, David R. Cheriton School of Computer Science • DC 1302
Welcome and Opening Remarks
Refreshments will be served
|10:00 am – 10:45 am||
Bernard Wong, University of Waterloo • DC 1302
Consensus Protocols for Blockchains, Transactions, and Cloud Computing
Achieving consensus among a set of distributed entities is a fundamental problem at the heart of many distributed systems. Although there has been a significant amount of past work on building efficient general-purpose consensus protocols, most of these protocols still have performance and cost-related problems that make them unsuitable for many current and emerging applications. In this talk, I will describe our ongoing work on building application-specific consensus protocols. The goal of these protocols is to solve the most critical consensus-related problem for a specific class of applications by exploiting properties common to them or to the environment in which they are deployed, and by trading off features and performance attributes that are of minimal value to these applications.
Our work targets three main classes of applications: Blockchains, geo-distributed transaction processing systems, and fault-tolerant cloud applications. In a blockchain, a large number of participants share a replicated log or ledger. A consensus protocol for blockchains must therefore scale to hundreds of nodes spanning multiple datacenters. For geo-distributed transaction processing systems, consensus must be achieved on the critical path of each transaction to safely replicate the transaction’s state. A consensus protocol for transaction processing systems must provide low worst-case latency in the absence of failures.
Finally, cost is often the main concern for the many fault-tolerant applications that are deployed in the cloud. A consensus protocol for the cloud can be more cost efficient than a general-purpose consensus protocol by sharing resources between separate consensus groups operating in the same cloud datacenter. I will present our consensus protocols for these classes of applications, and show their effectiveness at meeting their application-specific performance goals.
|10:45 am – 11:30 am||
Edward Lank, University of Waterloo • DC 1302
WRiST: Wearables for Rich, Subtle, and Transient Interactions in Ubiquitous Environments
Modern personal computing devices — tablets, smartphones, smartwatches, fitness trackers, remote controls — represent an ever-more-pervasive component of everyday life. Alongside this trend toward an increase in computing that you bring with you, we also continually encounter devices that exist both in tangible spaces and in the electronic domain. While this computationally augmented reality exists around us, interaction with this embedded, encountered computation rarely achieves the fluidity that one would desire. As a simple example, consider connecting your laptop or smartphone to a data projector. It almost always works well … except when it does not.
|11:30 am – 12:00 pm||
David R. Cheriton, Stanford University • DC 1302
Rethinking Virtual Memory for a Multi-core Terabyte Memory Computing World
Virtual memory is now over 50 years old, and has changed relatively little in that time, yet the sizes of DRAM, performance CPUs, and sizes of application datasets have changed by orders of magnitude during that time. Fault-tolerance is now a requirement in many applications. This talk discusses a project at Stanford to rethink virtual memory, including some preliminary results.
|1:15 pm – 4:15 pm||
Poster Session — David R. Cheriton Graduate Scholarship recipients
|4:15 pm – 4:45 pm||
DC Fishbowl, Room 1301
Gelato will be served — everyone welcome!
Poster session winners
In total, 23 graduate students participated in the 2018 Cheriton Research Symposium poster competition.
Congratulations to the competition winners!
First-place winners (tie) — $300 prize
- Amine Mhedhbi and Sidhartha Sahu for “The Ubiquity of Large Graphs and Surprising Challenges of Graph Processing”
- Sajin Sasy for “ZeroTrace: Oblivious Memory Primitives from Intel SGX”
Second-place winners (tie) — $200 prize
- Nik Unger for “How to Authenticate a Message and also Deny Authorship”
Linguan Yang for “Carousel: Low-Latency Transaction Processing for Globally-Distributed Data”
Third-place winners (tie) — $100
- Thomas Lidbetter for “Additive Number Theory via Approximation by Regular Languages”
Xin Lian for “Fault-tolerant Multi-Label Hierarchical Classification with OT distance”