EuroSys 2021

Website: https://cheops-workshop.github.io/
Proceedings: https://dl.acm.org/citation.cfm?id=3439839
Slack: #workshop-cheops
YouTube: https://www.youtube.com/playlist?list=PLzDuHU-z7gNhSTeobFJYBJCz0RDCDcsOW
Organizers:  Michael Kuhn (Otto von Guericke University Magdeburg), Kira Duwe (Otto von Guericke University Magdeburg), Jean-Thomas Acquaviva (DDN), Konstantinos Chasapis (DDN), Jalil Boukhobza - National Institute of Advanced Technologies of Brittany (ENSTA Bretagne)

Schedule 
(all times are in British Summer Time)

• 8:00-8:05: Welcome
• 8:05-8:50: Keynote by Suren Byna (Lawrence Berkeley National Lab, USA): Parallel I/O at Exascale with HDF5 and Proactive Data Containers
• 8:50-9:20: A Unified Storage Layer for Supporting Distributed Workflows in Kubernetes - Antony Chazapis (Foundation for Research and Technology - Hellas), Christian Pinto (IBM Research Europe), Yiannis Gkoufas (IBM Research Europe), Christos Kozanitis (Foundation for Research and Technology - Hellas), Angelos Bilas (Foundation for Research and Technology - Hellas)
• 9:20-9:50: Predicting file lifetimes for data placement in multi-tiered storage systems for HPC - Luis Thomas (ENSTA Bretagne / Lab-STICC), Sebastien Gougeaud (CEA), Stéphane Rubini (Univ. Brest / Lab-STICC), Philippe Deniel (CEA), Jalil Boukhobza (ENSTA Bretagne / Lab-STICC)
• 9:50-10:15: Break
• 10:15-10:35: Using Ceph's BlueStore as Object Storage in HPC Storage Framework - Kira Duwe (Otto von Guericke University Magdeburg), Michael Kuhn (Otto von Guericke University Magdeburg)
• 10:35-10:55: Design for Computational Storage Simulation Platform - Peter Wilcox (University of California, Santa Cruz), Heiner Litz (University of California, Santa Cruz)
• 10:55-11:25: EZIOTracer: Unifying Kernel, User Space I/O Tracing for Data-Intensive Applications - Mohammed Islam Naas (University of Western Brittany), François Trahay (Telecom SudParis, Polytechnic Institute of Paris), Alexis Colin (Telecom SudParis, Polytechnic Institute of Paris), Pierre Olivier (The University of Manchester), Stéphane Rubini (The University of Manchester), Frank Singhoff (The University of Manchester), Jalil Boukhobza (ENSTA Bretagne / Lab-STICC)
• 11:25-11:55: Evaluation of Flash Storage Integration (SIONlib with IME) - Konstantinos Chasapis (DataDirect Networks Storage), Jean-Thomas Acquaviva (DataDirect Networks Storage), Sebastian Lührs (Jülich Supercomputing Centre)
• 11:55-12:00: Farewell

Website: https://edge-sys.github.io/2021/
Slack: #workshop-edgesys
YouTube: TBD
Organizers:  Aaron Ding (TU Delft, Netherlands), Richard Mortier (University of Cambridge, UK)

Schedule: https://edge-sys.github.io/2021/programme.html
(all times are in British Summer Time)

• 08:00–08:05: Opening
• 08:05–9:25: Session #1 Edge Applications
• 9:25–9:35: Break
• 9:35–10:20: Keynote #1: Volker Hilt, Nokia Bell Labs
• 10:20–10:30: Break
• 10:30–11:50: Session #2 Edge Platforms
• 11:50–12:00: Break
• 12:00–13:00: Lunch break and Q&A with Andrew Tannenbaum
• 13:00–13:10: Break
• 13:10–14:10: Session #3 Edge AI
• 14:10–14:20: Break
• 14:20–15:00: Session #4 Edge Management
• 15:00–15:10: Break
• 15:10–15:55: Keynote #2: Eyal de Lara, University of Toronto
• 15:55–16:00: Best Paper Award & Closing Remarks

More details: https://edge-sys.github.io/2021/programme.html

Website: https://concordia-h2020.eu/eurosec-2021/
Slack: #workshop-eurosec
YouTube: Workshop playlist
Organizers:  Dr. Andrea Lanzi (Universita` degli studi di Milano), Dr. Martina Lindorfer (Technische Universität Wien)

Schedule 
(all times are in British Summer Time)

• 08:00–08:15: Welcome message from the PC Chairs
• 08:15–9:15: Invited Keynote: Prof. Juan Caballero IMDEA Software, Madrid, Spain
• 9:15–9:30: Break
• 9:30–11:00: Session 1 - System Protection
  • SGXoMeter: Open and Modular Benchmarking for Intel SGX
    M. Mahhouk, R. Kapitza, N. Weichbrodt
  • Fine-grained Program Partitioning for Security 
    Z. Huang, T. Jaeger, G. Tan
  • SgxPecial: Specializing SGX-Interfaces against Code Reuse Attacks
    S. Mishra, M. Polychronakis
• 11:00–12:30: Lunch break
• 12:30–14:30: Session 2 - Program Analysis for Security
  • TagVet: Vetting Malware Tags using Explainable Machine Learning
    L. Pirch, A. Warnecke, C. Wressnegger, K. Rieck
  • Talking About My Generation: Targeted DOM-based XSS Exploit Generation using Dynamic Data Flow Analysis
    S. Bensalim, D. Klein, T. Barber, M. Johns
  • dMVX: Secure and Efficient Multi-Variant Execution in a Distributed Setting
    A. Voulimeneas, D. Song, P. Larsen, M. Franz, S. Volckaert
  • CollabFuzz: A Framework for Collaborative Fuzzing
    S. Österlund, E. Geretto, A. Jemmett, E. Güler, P. Görz, T. Holz, C. Giuffrida, H. Bos
• 14:30–15:00: Break
• 15:00–16:00: Session 3 - Microarchitectural Side-Channel Attacks
  • Reproducing Spectre Attack with gem5: How To Do It Right?
    P. AYOUB, C. Maurice
  • The Price of Meltdown and Spectre: Energy Overhead of Mitigations at Operating System Level
    B. Herzog, S. Reif, J. Preis, T. Hönig, W. Schröder-Preikschat
• 16:00–16:15: Concluding Remarks
  
  

Website: https://eurodw21.github.io/
Slack: #workshop-eurodw
YouTube: Playlist
Organizers:  Natacha Crooks (UC Berkeley), Pedro Fonseca (Purdue University), Baris Kasikci (University of Michigan), Irene Zhang (Microsoft Research)

Schedule 
(all times are in British Summer Time)

Session 1: 1:00 PM - 2.15 PM (BST)

• ByzML: A Byzantine Machine Learning Library
  Arsany Guirguis, EPFL
• BFT Replication with Network Ordered and Attested History: NOAH
  Mingliang Jiang, National University of Singapore
• Millenial: Modular Microservices Macrobenchmarks
  Vaastav Anand, Max Planck Institute for Software Systems
• Building Trustworthy Many-Core Systems
  Nathan Rutherford, Royal Holloway University of London
• Hydra: In-Network Ordering with Multiple Sequencers
  Inho Choi, National University of Singapore
• Towards Generation of Attack Trees using Machine Learning
  Kacper Sowka, Coventry University
• Extend Rubik for Fluently Programming Network Stacks
  Gungda Sun, National University of Singapore

Session 2: 2:30 PM - 3.45 PM (BST)

• Mega-RPCs: Hardware Assisted Efficient Memory Management for Processing Mega-sized RPCs
  Norwich Mungkalaton, University of Sidney
• An OS to Improve the Programming of Heterogeneous Systems in the Data Center
  Karim Manaouil, University Of Edinburgh
• Machine Learning Input Data Processing as a Service
  Dan Graur, ETH Zurich
• Adaptive and dynamic edge gateways deployment for mission-critical applications
  Nina Santi, Inria
• Mitigating Excessive Virtual CPU Spinning in VM-agnostic Hypervisors
  Kenta Ishiguro, Keio University
• Tardis: User-level System Design in the context of Network Processing
  Yihan Yang, National University of Singapore
• RDMA Support for Online Data Intensive Services
  Alireza Sanaee, Queen Mary University of London
• Implementing Data Structures for Network Function Virtualisation on FPGA
  Yunfan Li, National University of Singapore

Session 3: 4:00 PM - 5.30 PM (BST)

• Service Boosters: Library Operating Systems for the Data Center
  Henri Demoulin, University of Pennsylvania
• A Black-box Approach for Scaling OS Kernels
  Ankit Bhardwaj, University of Utah
• Towards Pushing the Performance and Cost Envelope For Next-Generation Cloud Platforms
  Jashwant Raj Gunasekaran, The Pennsylvania State University
• Toward Workload-Aware State Management in Streaming Systems
  Showan Asyabi, Boston University
• Simplifying heterogeneous migration between x86 and ARM machines
  Nikolaos Mavrogeorgis, University of Edinburgh
• Transparent and Low Overhead Tracing and Fault Injection
  Jun Zhang, UC Santa Cruz

Session 4: 5:45 PM - 7.15 PM (BST)

• Goldilocks Fault Tolerance for Actor
  Audrey Cheng, UC Berkeley
• Trusted Execution for High-Performance Computing
  Ayaz Akram, UC Davis
• Locality Optimizations for Data Center Applications
  Tanvir Ahmed Khan, University of Michigan
• Secure, Distributed Sparse Matrix Multiplication for Machine Learning
  Samyukta Yagati, UC Berkeley
• Architectural Implications of Graph Neural Networks for Recommendation
  Samuel Hsia, Harvard University
• Autoscaling consensus
  David Chu, UC Berkeley
• Finding Crash Consistency Bugs in Persistent Memory File Systems
  Hayley LeBanc, University of Texas at Austin
• Wendy the Good Little BFT
  Neil Giridharan, UC Berkeley
• Retrofitting Memory Safety to Low-level Software Incrementally
  Jie Zhou, University of Rochester

Website: https://papoc-workshop.github.io/2021/
Slack: #workshop-papoc
YouTube: https://www.youtube.com/playlist?list=PLzDuHU-z7gNgh7anHW2UO8Vrm_FhIoJ3F
Organizers: Heidi Howard (University of Cambridge, UK), Roberto Palmieri (Lehigh University, USA)

Schedule 
(all times are in British Summer Time)

Opening & Session 1: 1:30 PM - 2:30 PM

• Certified Mergeable Replicated Data Types
• Array CRDTs Using Delta-Mutations
• Access Control Conflict Resolution in Distributed File Systems using CRDTs
• Improving the Reactivity of Pure Operation-Based CRDTs

Session 2: 2:30 PM - 3:30 PM

• Towards the Synthesis of Coherence/Replication Protocols from Consistency Models via Real-Time Orderings
• Totally-Ordered Prefix Parallel Snapshot Isolation
• Advanced Domain-Driven Design for Consistency in Distributed Data-Intensive Systems
• SCEW: Programmable BFT-Consensus with Smart Contracts for Client-Centric P2P Web Applications

Session 3: 3:30 PM - 4:30 PM

• Convergent Causal Consistency for Social Media Posts
• Cambria: Schema Evolution in Distributed Systems with Edit Lenses
• Read-Write Quorum Systems Made Practical

Lightning Talks: 4:30 PM - 5:00 PM

Keynote by Peter Alvaro (Joint with LADIS): 5:00 PM - 6:00 PM

What not where: Sharing in a world of distributed, persistent memory

Abstract:

A world of distributed, persistent memory is on its way. Our programming models traditionally operate on short-lived data representations tied to ephemeral contexts such as processes or computers. In the limit, however, data lifetime is infinite compared to these transient actors. We discuss the implications for programming models raised by a world of large and potentially persistent distributed memories, including the need for explicit, context-free, invariant data references. We present a novel operating system that uses wisdom from both storage and distributed systems to center the programming model around data as the primary citizen, and reflect on the transformative potential of this change for infrastructure and applications of the future. We focus in particular on the landscape of data sharing and the consequences of globally-addressable persistent memory on existing consistency models and mechanisms.

Bio:

Peter Alvaro is an Assistant Professor of Computer Science at the University of California Santa Cruz, where he leads the Disorderly Labs research group disorderlylabs.github.io. His research focuses on using data-centric languages and analysis techniques to build and reason about data-intensive distributed systems, in order to make them scalable, predictable and robust to the failures and nondeterminism endemic to large-scale distribution. Peter earned his PhD at UC Berkeley, where he studied with Joseph M. Hellerstein. He is a recipient of the NSF CAREER Award, the Facebook Research Award, the USENIX ATC Best Presentation Award, and the UCSC Excellence in Teaching Award.

Website: https://www.euromlsys.eu/
Slack: #workshop-euromlsys
Organizers:  Eiko Yoneki (University of Cambridge), Paul Patras (University of Edinburgh)

Schedule: https://www.euromlsys.eu/#schedule 
(all times are in British Summer Time)

Note: Please submit your questions to EuroSys’21 Slack Channel #workshop-euromlsys!

15:00 - 15:10 Introduction
15:10 - 15:50 Keynotes1: Zhihao Jia (CMU & Facebook)

• Automated Discovery of Machine Learning Optimizations

15:50 - 16:55 Session 1: Systems, Compiler and PPL

• DISC: A Dynamic Shape Compiler for Machine Learning Workloads
• High-Dimensional Bayesian Optimization with Multi-Task Learning for RocksDB
• Vate: Runtime Adaptable Probabilistic Programming for Java
• DistIR: An Intermediate Representation for Optimizing Distributed Neural Network

16:55 - 17:05 Break
17:05 - 18:10 Session 2: Model Optimisation and NAS

• Optimizing Inference Performance of Transformers on CPUs
• Learned Low Precision Graph Neural Networks
• uNAS: Constrained Neural Architecture Search for Microcontrollers
• Towards Mitigating Device Heterogeneity in Federated Learning via Adaptive Model Quantization

18:10 - 18:20 Break
18:20 - 19:00 Keynotes 2:‪ Anna Goldie (Google Brain & Stanford University)

• Deep Reinforcement Learning for Graph Placement: Model Parallelism and Chip Floorplanning

19:00 - 19:05 Break
19:05 - 20:10 Session 3: Scheduling, Training and Prediction

• Are we there yet? Estimating Training Time for Recommendation Systems
• Interference-Aware Scheduling for Inference Serving
• Developing a Siamese Network for Intrusion Detection Systems
• Predicting CPU Usage for Proactive Autoscaling

20:10 - 20:15 Break
20:15 - 20:50 Poster Session

• Queen Jane Approximately: Enabling Efficient Neural Network Inference with Context-Adaptivity
• DPD-InfoGAN: Differentially Private Distributed InfoGAN
• Towards Optimal Configuration of Microservices
• AutoAblation: Automated Parallel Ablation Studies for Deep Learning
• Towards a General Framework for ML-based Self-tuning Databases
• Fast Optimisation of Convolutional Neural Network Inference using System Performance Models

20:50 - 21:00 Wrap-up

Website: https://haoc2021.cs.jhu.edu/
Slack: #workshop-haoc
YouTube: https://www.youtube.com/playlist?list=PLzDuHU-z7gNi_wZuMBGCIFXJssdydBihB
Proceedings: http://dl.acm.org/citation.cfm?id=3447851
Organizers: Rebecca Isaacs (Twitter), Ryan Huang (Johns Hopkins University)

Schedule 
(all times are in British Summer Time)

16:00 - 16:05: Welcome
16:05 - 17:05: Keynote: Haryadi Gunawi (University of Chicago)

• Too Many Tests, Too Little Time: How to Find Bugs Faster

17:05 - 17:30: Break
17:30 - 18:00: Paper Presentation Session I

• CARE: Infusing Causal Aware Thinking to Root Cause Analysis in Cloud System

Yong Xu and Xu Zhang (Microsoft Research, Beijing, China); Chuan Luo and Si Qin (Microsoft Research); Rohit Pandey (Microsoft, Redmond); Chao Du and Qingwei Lin (Microsoft Research, Beijing, China); Yingnong Dang (Microsoft, Redmond); Andrew Zhou (Microsoft)

• Frisbee: A Suite for Benchmarking Systems Recovery

Fotis Nikolaidis (FORTH, Greece); Angelos Bilas (Univ. of Crete and FORTH, Greece); Manolis Marazakis (FORTH-ICS); Antonis Chazapis (FORTH, Greece)

18:00 - 18:30: Invited Talk I: Samer Al-Kiswany (University of Waterloo)

• On the Art of Wielding a Double-Edged Sword (or Finessing Modern Networks)

18:30 - 18:40: Break
18:40 - 19:10: Paper Presentation Session II

• Examining Raft's behaviour during partial network failures

Chris Jensen, Heidi Howard, and Richard Mortier (University of Cambridge)

• Service mesh circuit breaker: From panic button to performance management tool

Mohammad Reza Saleh Sedghpour, Cristian Klein, and Johan Tordsson (Umeå University)

19:10 - 19:40: Invited Talk II: Kay Ousterhout (LightStep)

• Sampling Distributed Traces: Evolution from 2005 to Today

19:40 - 19:50: Break
19:50 - 20:50: Panel

• Chair: John Wilkes, Google
• Evangelia Kalyvianaki, University of Cambridge
• Jonathan Mace, Max Planck Institute for Software Systems (MPI-SWS)
• Noa Zilberman, University of Oxford
• Yonatan Zunger, Twitter

20:50 - 21:00: Wrap-up

===================================================
Details
===================================================

• 16:00 - 17:00: Keynote: Haryadi Gunawi (University of Chicago)

Too Many Tests, Too Little Time: How to Find Bugs Faster

As more data and computation move from local to cloud environments, datacenter distributed systems have become a dominant backbone for many modern applications. However, the complexity of cloud-scale hardware and software ecosystems has outpaced existing testing, debugging, and verification tools. I will describe a classical class of bugs that surface in large-scale datacenter distributed systems, distributed concurrency bugs, caused by non-deterministic timings of distributed events such as message arrivals as well as multiple crashes and reboots. The challenge is the too many tests to perform. I will describe our 7-year of experience in taming this problem, in particular how to systematically reduce the number of tests to perform when building software model checkers for distributed datacenter systems.

Bio: Haryadi S. Gunawi is an Associate Professor in the Department of Computer Science at the University of Chicago where he leads the UCARE research group (UChicago systems research on Availability, Reliability, and Efficiency). He received his Ph.D. in Computer Science from the University of Wisconsin, Madison in 2009. He was a postdoctoral fellow at the University of California, Berkeley from 2010 to 2012. His current research focuses on cloud computing reliability and new storage technology. He has won numerous awards including NSF CAREER award, NSF Computing Innovation Fellowship, Google Faculty Research Award, NetApp Faculty Fellowships, and Honorable Mention for the 2009 ACM Doctoral Dissertation Award.

• 18:00 - 18:30: Invited Talk I: Samer Al-Kiswany (University of Waterloo)

On the Art of Wielding a Double-Edged Sword (or Finessing Modern Networks)

Unprecedented advances in networking technology have introduced network configurability and programmability. However, this increase in network "softwarization" is a double-edged sword. On one hand, network softwarization facilitates the building of line-rate application-specific packet-processing logic. On the other hand, increased network softwarization (perhaps unsurprisingly) increases the frequency and complexity of network faults. In this talk, I will discuss a peculiar type of a network fault that my group identified: partial network partitioning. First, I will present a comprehensive study of system failures caused by this type of fault. Our study reveals that the studied failures are catastrophic (e.g., lead to data loss) and are easily manifested. Second, I will present an analysis of fault-tolerance techniques for eight popular systems and highlight their shortcomings. Finally, I will present Nifty, a transparent communication layer that masks partial network partitions. Nifty overcomes the shortcomings of current fault-tolerance approaches and effectively masks partial partitions while imposing negligible overhead.

Bio: Samer Al-Kiswany is an assistant professor at the David Cheriton School of Computer Science at the University of Waterloo, Canada. His research interests are in distributed systems, networking, and data management and processing engines. In particular, his work focuses on reconsidering systems design in light of recent changes in cloud applications and platforms. Samer received his PhD from the University of British Columbia in 2013. After earning his PhD, he joined the University of Wisconsin–Madison as a postdoctoral fellow. Dr. Al-Kiswany is the recipient of ten national and international awards, including the Killam Doctoral Fellowship and the NSERC Postdoctoral Fellowship.

• 19:10 - 19:40: Invited Talk II: Kay Ousterhout (LightStep)

Sampling Distributed Traces: Evolution from 2005 to Today

Distributed tracing has become a widespread tool for understanding the performance of large-scale systems: unlike metrics or logs, traces follow a request through every service to provide critical context for debugging problems. Retaining traces for every request through a system is typically prohibitively expensive, so all systems for distributed tracing sample a subset of traces to save. In this talk, I’ll talk about three iterations of sampling for distributed tracing, starting from the simple, random approach employed by Google’s production tracing system, Dapper, in 2005, and ending in a new approach that Lightstep is beginning to use in production. Over time, technology improvements have allowed sampling decisions to be delayed later and later in the data ingestion pipeline, which has enabled more sophisticated sampling algorithms that consider more dimensions in choosing which traces to save. I’ll end by talking about ongoing challenges and opportunities in selecting the most useful sample of tracing data.

Bio: Kay Ousterhout is a software engineer at Lightstep, where she's building performance management tools that enable users to understand the performance of complex distributed systems. Before Lightstep, Kay received a PhD from UC Berkeley. Her thesis focused on building high-performance data analytics frameworks that allow

Website:https://www.ladisworkshop.org/2021/
Slack: #workshop-ladis
YouTube: TBD
PC Chairs: Idit Keidar (Technion), Peter Pietzuch (Imperial)
General Chairs: Gregory Chockler (University of Surrey), Ymir Vigfusson (Emory University)

Schedule (all times are in British Summer Time). Full program here.

16:00 – 16:50 Session 1: Blockchain scalability

• Yossi Gilad (HUJI): Scaling Byzantine Agreements for Cryptocurrencies.
• Emin Gün Sirer (Cornell/Ava Labs): The Avalanche network and the Internet of Finance being built upon it.
• Dahlia Malkhi (Diem Association and Novi Financial): Twins -- Production BFT Systems Made Robust .

16:50 – 17:00 Break
17:00 – 17:50 Joint keynote with PaPoC

• Peter Alvaro (USC): What not where: Sharing in a world of distributed, persistent memory

17:50 – 18:00 Break
18:00 – 19:15 Session 2: Large-scale ML & graph processing

• Marco Canini (KAUST): Accelerated Deep Learning via Efficient, Compressed and Managed Communication.
• Keval Vora (SFU): Efficient Large-Scale Graph Analytics
• Matteo Interlandi (Microsoft): Using Tensor Computations for Traditional Machine Learning Prediction Serving and Beyond.
• Alexey Tumanov (GaTech): Unified Distributed Dataflow in Ray.

19:15 – 19:45 Open discussions/hallroom conversations/break
19:45 – 20:45 Session 3: Scalable and consistent data processing and storage

• Natacha Crooks (UC Berkeley): Oblivious Transactions In the Cloud.
• Mahesh Balakrishnan (Facebook): Virtual Consensus in the Delos Storage System.
• Kyle Kingsbury (Jepsen): Everything Is Broken.

20:45 – 21:00 Closing

Further details:

"Scaling Byzantine Agreements for Cryptocurrencies."
Algorand is a new cryptocurrency that confirms over a thousand transactions per second with a latency of a few seconds. It ensures that users never have divergent views of confirmed transactions, even if some of the users are malicious and the network is temporarily partitioned. Algorand uses a new Byzantine Agreement (BA) protocol to reach consensus among millions of participants on the next set of transactions. To scale the consensus to many participants, Algorand uses a novel mechanism based on Verifiable Random Functions that allows users to privately check whether they are selected to participate in the BA to agree on the next set of transactions, and to include proof of their selection in their network messages. In Algorand’s BA protocol, participants do not keep any private state except for their private keys, which allows Algorand to replace participants immediately after they send a message. This mitigates targeted attacks on chosen participants after their identity is revealed.

Yossi Gilad is a Harry & Abe Sherman Senior Lecturer at the Hebrew University of Jerusalem. His research focuses on designing, building, and analyzing secure and scalable protocols and networked systems. Prior to the Hebrew University, he was a postdoc researcher at MIT and Boston University.


"The Avalanche network and the Internet of Finance being built upon it"
Before Ethereum, many would have scoffed at the very notion of decentralized finance. Now, it's one of the most hyped areas of fintech. Ava Labs is building upon that momentum with a breakthrough in consensus protocols – Avalanche – to usher in a new era of finance defined by velocity, efficient use of capital, security
against bad actors, and preservation of network value. This talk will focus on the Avalanche network and the Internet of Finance being built upon it.

Emin Gün Sirer is Co-founder and CEO at Ava Labs and a Professor of Computer Science at Cornell University, where his research focuses on operating systems, networking, and distributed systems. He is well-known for having implemented the first currency that used Proof-of-Work (PoW) to mint coins, as well as his research on selfish mining, characterizing the scale and centralization of existing cryptocurrencies, and having proposed the leading protocols for on-chain and off-chain scaling. He is the Co-Director of the Initiative for Cryptocurrencies and Smart Contracts (IC3), which aims to move blockchain-based applications from whiteboards and proofs-of-concept to tomorrow’s fast and reliable financial systems


"Twins -- Production BFT Systems Made Robust."
Twins is a principled strategy for effectuating Byzantine attack scenarios at scale in Byzantine Fault Tolerant (BFT) systems and examining their behavior.

Dahlia Malkhi is the Chief Technology Officer at Diem Association, Lead Maintainer of the Diem project, and Lead Researcher at Novi. She has applied and foundational research interest in broad aspects of reliability and security of distributed systems. For over two decades, she participated in driving innovation in tech, notably: co-inventor of HotStuff, co-founder and technical co-lead of VMware blockchain, co-inventor of Flexible Paxos, the technology behind Log Device, creator and tech lead of CorfuDB, a database-less database driving VMware’s NSX-T distributed control plane (see Corfu github repo), and co-inventor of the FairPlay project.

Dahlia joined the Diem (Libra) team in June 2019, first as a Lead Reseacher at Novi and later as Chief Technology Officer at the Diem Association. In 2014, after the closing of the Microsoft Research Silicon Valley lab, she co-founded VMware Research and became a Principal Researcher at VMware until June 2019. From 2004-2014, she was a principal researcher at Microsoft Research, Silicon Valley. From 1999-2007, she served as tenured associate professor at the Hebrew University of Jerusalem. From 1995-1999, she was a senior researcher at AT&T Labs, NJ. Dahlia holds Ph.D., M.S. and B.S. in computer science from the Hebrew University of Jerusalem.


Space on Sched exceeded -- CHECK OUT THE FULL LADIS PROGRAM HERE