Rust Search
This talk shows how the Rust Infrastructure team decreased significantly the cost of the Rust CI, the challenges along the way, and our plan to make the CI more sustainable and maintainable in the future.
Player unavailable or embedding blocked? Use the YouTube link above.
In July 2024, I was hired by the Rust Foundation to join the Rust Infrastructure team. In this talk I will share my experience in the team, including our ways of working, the challenges we faced, the solutions we implemented to better serve the Rust Project and the Rust Community, and our plans to make the Rust infrastructure more efficient, secure, and reliable. LEVEL: Introductory and Overview
Most people don't see the work that goes into maintaining open source software. It's not just about writing code — it's also about reviewing PRs, helping new contributors, answering questions, fixing bugs, and writing documentation. In this talk, you will hear stories that explore the invisible work of open source software maintenance and discuss the challenges and rewards of this important work.
Reasoning through concurrent systems has always been a challenging task. Poor code can be riddled with race conditions, non-terminating cases and other complex concurrency bugs; and even well-written code can be hard to understand. Async programming is an innovative concurrent programming model that rises to this challenge. In this talk, we'll explore reasoning with async Rust. We'll be introduced to its fundamental building blocks, such as `async`, `await`, `join` and `Pin`, and learn how to predict the behavior of code written with them. We'll build on these to simplify more complex concurrency puzzlers. Finally, we'll explore other models of concurrent programming to see how async Rust compares.
With chemical plants as application example and engineers as our users in mind, we dig into safe API design with Rust. Therefore we build upon design patterns which are used for decades as catalog of solutions for recurring software architecture challenges. Beside the prominent builder and type-state pattern we will see how the visitor pattern allows us to define algorithms on an heterogeneous graph data structure such as used to represent a chemical process flowsheet.
