## +24 ## Work Contracts Rethinking Task Based Concurrency and Parallelism for Low Latency C++ MICHAEL A MANISCALCO ### “We cannot solve our problems with the same thinking we used when we created them So what is there to Rethink? ## Rethinking: Task Queues  ## Problem #1 - Task Queues Do Not Scale Well: • Contention: ☐ problems: ☐ Task starvation ☐ Load balancing ☐ Forfeits strict FIFO behaviour ○ Increases memory footprint (or requires allocations) ☐ Terrible task selection "fairness" ## Rethinking: Task Queues

## +23 ## Taro: Task graph-based Asynchronous Programming Using C++ Coroutine DIAN-LUN LIN 20 23 October 01 - 06 ## Agenda • Understand the motivation behind Taro • Learn to use the Taro C++ programming • Conclusion ## What is Task Graph-based Programming System (TGPS) • TGPS encapsulates function calls and their dependencies in a top-down task graph ## What is Task Graph-based Programming System (TGPS) calls and their dependencies in a top-down task graph  ## What is Task Graph-based Programming System (TGPS) • TGPS encapsulates

## Back To Basics Concurrency ## +23 ## DAVID OLSEN ## 3 ## BACK TO BASICS: CONCURRENCY David Olsen, Software Engineer, NVIDIA CppCon, October 5, 2023 ![Image](/uploads/documents/8/2/a/3/82a35 threads ## CONCURRENCY Definition # “Multiple logical threads of execution with unknown inter-task dependencies” - Daisy Hollman, “A Unifying Abstraction for Async,” CppCon 2019 ## CONCURRENCY Definition unknown inter-task dependencies” - Daisy Hollman, “A Unifying Abstraction for Async,” CppCon 2019 ## CONCURRENCY Definition “Multiple logical threads of execution with [some] inter-task dependencies”

ER ## Concurrency in Rust Alex Crichton ## What's Rust? Rust is a systems programming language that runs blazingly fast, prevents segfaults, and guarantees thread safety. ## Concurrency? Rust? Libraries Futures ## What's concurrency? In computer science, concurrency is a property of systems in which several computations are executing simultaneously, and potentially interacting with each each other. ## Why concurrency?  ## Getting our feet wet // What does this print? int main() { int pid = fork();

## +21 ## Back to Basics: Concurrency ## MIKE SHAH 2021 October 24-29 ## Please do not redistribute slides without prior permission ## Back to Basics: Concurrency Mike Shah, Ph.D. @MichaelShah | mshah about the free lunch being over for programmers? In this talk we provide a gentle introduction to concurrency with the modern C++ std::thread library. We will introduce topics with pragmatic code examples locks, and showing how these programming primitives enable concurrency. In addition, we will show the common pitfalls to be aware of with concurrency: data races, starvation, and deadlock (the most extreme

## +21 ## Concurrency Patterns ## RAINER GRIMM 20 21 October 24-29 ## Definition "Each pattern is a three-part rule, which expresses a relation between a certain context, a problem, and a solution Interaction 7. Solution 8. Example 9. Consequenses 10. Related pattern 11. Known usages ## Concurrency Patterns ## Pattern-Oriented Software Architecture (Volume 2 and 4)  ## Concurrency Patterns ## Synchronization Patterns Concurrent Architecture ## Dealing with Sharing ■ Copied

## Back to Basics: Concurrency I also do C++ training! arthur.j.odwyer@gmail.com ## Outline - What is a data race and how do we fix it? [3–12] • C++11 mutex and RAI lock types [13–23] Questions? • • The blue/green pattern [46–52] ● Bonus C++20 slides [53–58] Questions? ## What is concurrency? - Concurrency means doing two things concurrently — “running together.” Maybe you’re switching back and music - In extremely broad strokes, parallelism is a hardware problem (think multiple CPUs) and concurrency is a software problem (think time-sharing, but also Intel’s “hyperthreading”). ## Why does C++

## Concurrency Patterns in Go Artsiom Bukhautsou Senior Backend Engineer @Nord Security ## Agenda 1. Fan-in 2. Fan-out 3. Pipeline 4. Fan-in, Fan-out, Pipeline 5. Tee 🌱 ## Why learn these patterns

+24 ## Coroutines and Structured Concurrency in Practice ## DMITRY PROKOPTSEV ## Challenges when onboarding coroutines A lot of existing code mostly callback-based A custom-built I/O event loop predates Structured concurrency And why we care ## A typical async framework class Task { ... } represents a unit of background work Task::join() explicit call to suspend the current task until another task completes propagates uncaught exceptions Task::detach() allows the task to run alongside the rest of the program ## Detached tasks considered harmful No way to figure out task lifetime => no automatic object

## +23 ### BehaviorTree.CPP: Task Planning for Robots and Virtual Agents ## DAVIDE FACONTI ## 20 23 October 01 - 06 ## What you will learn today 1. What Behavior Trees are 2. About the C++ library robotics In the last 20 years, the de-facto standard in robotics has been (informally) Component Based Software Engineering - Multi-process and multi-nodes, distributed systems. • Lot of inter-process ments/8/d/b/6/8db662e9d441565a9dd326035c73ae34/p7_1.jpg) ## Robot Behaviors This Coordinator or Task Planner is also the highest level of abstraction of our system, where we focus on WHAT the robot does