SOSP21 conference (Day 1)

-

SOSP, along with OSDI, is the premiere conference in computer systems. SOSP was held biannually; I had attended SOSP19 in person, and shared notes and paper summaries from that. 

This year SOSP is virtual, which made it a lot easier to travel to. It is nice attending the conference from the convenience of your home. The experience is not too inferior to physical conference attending if you take the convenience factor into account. 

Here are some notes from SOSP21. If you find and interesting paper, you can dig in, because:


Opening

The conference opened with announcements from program committee (PC) chairs. SOSP21 had 348 submissions from 2078 authors, resulting on avg 6 authors per paper. 54 out of 348 papers are accepted. Reviews were conducted by 64 PC members, who produced 1500+ reviews.

The trend is clear, the number of submissions are growing steeply.  Last year OSDI had announced it is going annual.  In the second day of SOSP it is announced that SOSP is going annual, starting from 2023.

To provide consistency across PCs, the OSDI rejected paper reviews were submitted to the conference along with those papers. The SOSP reviewers first reviewed the papers themselves, then saw OSDI reviews. This provided more consistency/continuation across submissions. The feedback is to make this optional rather than mandatory in the future.

Another experiment was to allow appendices in submissions. The appendices will be included in the cameraready, with the appendix marked as not peer-reviewed. This will help those who want to dive deeper into the paper. 

Best paper awards went to:

SOSP had put serious effort on artifact evaluation, which involved 91 reviewers, 171 reviews, 4.3 reviews per artifact. This resulted in issuing of  38 artifacts evaluated certificates and 27 results reproduced certificates.

The distinguished artifact award went to Rudra: finding memory safety bugs in Rust at the ecosystem scale. You can find results of the artifact evaluation, including links to all of the artifacts and summaries of the work done by the AEC at: https://sysartifacts.github.io/sosp2021/results.html


Logistics

Zoom was used for the conference. Audio/video is set to be off for audience by default. I didn't know this until the announcement was made. I was confused as I tried searching in vain to find the audio controls to mute myself. But I agree that this is a good setup for avoiding accidental zoom-bombing. When someone needs to ask a question, they are promoted to get access to video and audio. 

The poster session was done through gathertown. This was awesome. Gathertown overlays a physical space, where you run into people, look at posters. This felt like going to the conference, running people at the hallways. I enjoyed it. 


BFT session

Basil Breaking up BFT with ACID transactions

BIDL: A High-throughput, Low-latency Permissioned Blockchain Framework for Datacenter Networks

Kauri: Scalable BFT Consensus with Pipelined Tree-Based Dissemination and Aggregation


Bug finding session

iGUARD: In-GPU Advanced Race Detection

The title may be misleading. This is not a GPU application for computer vision-based race detection from photos/videos. GPU applications are growing. Every gpu generation is growing in size and complexity. GPUs introduce advance synchronization for programming. Sync only within a subset of threads, warp (32 thread), threadblock (1000 threads), or grid (even more threads). Independent thread scheduling (ITS). Races in CUDA code due to insufficient scopes. 12 races caught in popular. Anyways, it was great to see race issues being discussed in SOSP. 


Snowboard: Finding Kernel Concurrency Bugs through Systematic Inter-thread Communication Analysis

Finding concurrent inputs is challenging. Snowboard a tool for finding kernel concurrency bugs. It analyzes potential memory communications (pmc). It finds pmcs, prioritizes pmcs, and test them to find bugs.


Rudra: Finding Memory Safety Bugs in Rust at the Ecosystem Scale (Distinguished Artifact Award)

This work identified 3 bug patterns in "unsafe" Rust: panic safety bug, higher order invariant bug, and send/sync variance bugs.


Consistency

Witcher: Systematic Crash Consistency Testing for Non-Volatile Memory Key-Value Stores

NVM is here to stay. Two main operations: flush operation writes back a cache line to memory, fence operation provides ordering guarantee between flushes. They did an NVM software survey, and categorized things as persistence ordering bugs, persistence atomicity bugs, and persistence performance bugs. They use  rules for inferring likely correctness conditions specific to NVM programming. They then use output equivalence checking to validate a crashed state (this is not NVM specific). The tool takes program and test-case as input, do an  llvm compiler pass, and  run instrumented bytecode.


Understanding and Detecting Software Upgrade Failures in Distributed Systems

There is a tradeoff between safe versus fast upgrade. Developers use canary deployment to achieve some safety, but 20% of those take add 1000+ minutes to deployment. They did a study focusing on upgrade failures: 2/3 of upgrage failures were only caugth after software release. In 2/3rd of upgrade failures, the cause was data format and data semantic incompatibilities. 20% of syntax incompatibilities are defined by serialization libraries or enum.


Crash Consistent Non-Volatile Memory Express


Databases

Cuckoo Trie: Exploiting Memory-Level Parallelism for Efficient DRAM Indexing

Cuckoo trie: an ordered index that exploits memory-level parallelism (mlp). Start with a trie, store nodes in a hash table, no pointers are needed, you can read nodes in parallel. https://youtu.be/_YmXL2gYzRI


Regular Sequential Serializability and Regular Sequential Consistency 

Strict serializability guarantees total order of transactions: The order respects causality and the order also respects some real-time: reads must return up-to-date values. They introduce regular sequential serializability (rss). Informally any application inv that holds with a strictly serializable service also holds with an rss service. https://youtu.be/GauK7QhaAEQ


Caracal: Contention Management with Deterministic Concurrency Control 

Comments

Post a Comment

Popular posts from this blog

Hints for Distributed Systems Design

-
This is with apologies to Butler Lampson, who published the " Hints for computer system design " paper 40 years ago in SOSP'83. I don't claim to match that work of course. I just thought I could draft this post to organize my thinking about designing distributed systems and get feedback from others. I start with the same  disclaimer Lampson gave. These hints are not novel, not foolproof recipes, not laws of design, not precisely formulated, and not always appropriate. They are just hints.  They are context dependent, and some of them may be controversial. That being said, I have seen these hints successfully applied in distributed systems design throughout my 25 years in the field, starting from the theory of distributed systems (98-01), immersing into the practice of wireless sensor networks (01-11), and working on cloud computing systems both in the academia and industry ever since. These heuristic principles have been applied knowingly or unknowingly and has proven
Read more >>

Learning about distributed systems: where to start?

-
This is definitely not a "learn distributed systems in 21 days" post. I recommend a principled, from the foundations-up, studying of distributed systems, which will take a good three months in the first pass, and many more months to build competence after that. If you are practical and coding oriented you may not like my advice much. You may object saying, "Shouldn't I learn distributed systems with coding and hands on? Why can I not get started by deploying a Hadoop cluster, or studying the Raft code." I think that is the wrong way to go about learning distributed systems, because seeing similar code and programming language constructs will make you think this is familiar territory, and will give you a false sense of security. But, nothing can be further from the truth. Distributed systems need radically different software than centralized systems do.  --A. Tannenbaum This quotation is literally the first sentence in my distributed systems syllabus. Inst
Read more >>

Making database systems usable

-
Image
C. J. Date's Sigmod 1983 keynote, "Database Usability", was prescient. Usability is the most important thing to the customers. They care less about impressive benchmarks or clever algorithms, and more about whether they can operate and use a database efficiently to query, update, analyze, and persist their data with minimal headache. (BTW, does anyone have a link to the contents of this Sigmod'83 talk? There is no transcript around, except for this short abstract .) The paper we cover today is from Sigmod 2007. It takes on the database usability problem raised in that 1983 keynote head-on, and calls out that the king is still naked.  Let's give some context for the year 2007. Yes, XML format was still popular then. The use-case in the paper is XQuery. The paper does not contain any  reference to json. MongoDB would be released in 2009 with the document model; and that seems to be great timing for some of the usability pains mentioned in the paper! Web 2.0 was in
Read more >>

Looming Liability Machines (LLMs)

-
As part of our zoom reading group ( wow, 4.5 years old now ), we discussed a paper that uses LLMs for automatic root cause analysis (RCA) for cloud incidents. This was a pretty straightforward application of LLMs. The proposed system employs an LLM to match incoming incidents to incident handlers based on their alert types, predicts the incident's root cause category, and provides an explanatory narrative. The only customization is through prompt-engineering. Since this is a custom domain, I think a more principled and custom-designed  machine learning system would be more appropriate rather than adopting LLMs. Anyways, the use of LLMs for RCAs spooked me vicerally. I couldn't find the exact words during the paper discussion, but I can articulate this better now. Let me explain. RCA is serious business Root cause analysis (RCA) is the process of identifying the underlying causes of a problem/incident, rather than just addressing its symptoms. One RCA heuristic is asking 5 Why&#
Read more >>

Foundational distributed systems papers

-
I talked about the importance of reading foundational papers last week. To followup, here is my compilation of foundational papers in the distributed systems area. (I focused on the core distributed systems area, and did not cover networking, security, distributed ledgers, verification work etc. I even left out distributed transactions, I hope to cover them at a later date.)  I classified the papers by subject, and listed them in chronological order. I also listed expository papers and blog posts at the end of each section. Time and State in Distributed Systems Time, Clocks, and the Ordering of Events in a Distributed System. Leslie Lamport, Commn. of the ACM,  1978. Distributed Snapshots: Determining Global States of a Distributed System. K. Mani Chandy Leslie Lamport, ACM Transactions on Computer Systems, 1985. Virtual Time and Global States of Distributed Systems.  Mattern, F. 1988. Practical uses of synchronized clocks in distributed systems. B. Liskov, 1991. Expository papers
Read more >>

Advice to the young

-
Image
I notice I haven't written any advice posts recently. Here is a collection of my advice posts pre 2020. I've been feeling all this elderly wisdom pent up in me, ready to pour at any moment. So here it goes. Get ready to quench your thirst from my fount of wisdom. No man, think for yourself, only get what works for you. It is called foundations, not theory Foundations of computer science (or rather any field of study) are the most important topics you can learn. These lay down the frame of thinking/perspective for that area of study. Yet, I am saddened to hear these called as "theory", and labeled as "unpractical". This couldn't be farther from the truth. Take a look at how I recommend studying distributed systems . Don't you dare call this "theory" and "unpractical". This lays the bedrock that you build your practice on. Don't skimp on the foundations. Don't build your home on quicksand. Keep your hands dirty, your mind cl
Read more >>

Linearizability: A Correctness Condition for Concurrent Objects

-
Image
This paper is from Herlihy and Wing appeared in ACM Transactions on Programming Languages and Systems 1990. This is the canonical reference for the linearizability definition. I had not read this paper in detail before, so I thought it would be good to go to the source to see if there are additional delightful surprises in the original text. Hence, this post. I will dive into a technical analysis of the paper first, and then discuss some of my takes toward the end. I had written an accessible explanation of linearizability earlier; you may want to read that first. I will assume an understanding of linearizability to keep this review at reasonable length. Introduction I love how the old papers just barge in with the model, without bothered by pleasantries such as motivation of the problem. These are the first two sentences of the introduction. "A concurrent system consists of a collection of sequential processes that communicate through shared typed objects . This model encompass
Read more >>

Scalable OLTP in the Cloud: What’s the BIG DEAL?

-
Image
This paper is from Pat Helland, the apostate philosopher of database systems, overall a superb person, and a good friend of mine. The paper appeared this week at CIDR'24. (Check out the program for other interesting papers). The motivating question behind this work is: " What are the asymptotic limits to scale for cloud OLTP (OnLine Transaction Processing) systems? " Pat says that the CIDR 2023 paper "Is Scalable OLTP in the Cloud a Solved Problem?" prompted this question.  The answer to the question? Pat says that the answer lies in the joint responsibility of database and the application. If you know of Pat's work, which I have summarized several in this blog , you would know that Pat has been advocating along these lines before. But this paper provides a very crisp, specific, concrete answer. Read on for my summary of the paper. Disclaimer: This is a wisdom and technical information/detail packed 13-page paper, so I will try my best to summarize the sa
Read more >>

Understanding the Performance Implications of Storage-Disaggregated Databases

-
Image
Storage-compute disaggregation in databases has emerged as a pivotal architecture in cloud environments, as evidenced by Amazon ( Aurora ), Microsoft ( Socrates ), Google (AlloyDB), Alibaba ( PolarDB ), and Huawei (Taurus). This approach decouples compute from storage, allowing for independent and elastic scaling of compute and storage resources. It provides fault-tolerance at the storage level. You can then share the storage for other services, such as adding read-only replicas for the databases. You can even use the storage level for easier sharding of your database. Finally, you can also use this for exporting a changelog asynchronously to feed into peripheral cloud services, such as analytics. Disaggregated architecture was the topic of Sigmod 23 panel . I think this quote summarizes the industry's thinking on the topic. "Disaggregated architecture is here, and is not going anywhere. In a disaggregated architecture, storage is fungible, and computing scales independently.
Read more >>

Designing Data Intensive Applications (DDIA) Book

-
Image
We started reading this book as part of Alex Petrov's book club . We just got started, so you can join us, by joining the discord channel above. We meet Wednesday's 11am Eastern Time.  Previously we had read transaction processing book by Grey and Reuters. This page links to my summaries of that book. Chp 1. Reliable, Scalable, and Maintainable Applications I love the diagrams opening each chapter. Beautiful! The first chapter consists of warm up stuff. It talks about the definitions of reliabilty, scalability, and maintainability. It is still engaging, because  it is written with an educator and technical blogger voice, rather than a dry academic voice. This book came out on 2017. Martin is working on the new version. So if you have comments for things to focus on for the new version, it would be helpful to collect them in a document and email it to Martin. For example, I am curious about how the below paragraph from the Preface will get revised with 8 more years of hindsight:
Read more >>