CONSTRUCTING GENERIC CONSTRUCTING GENERIC ALGORITHMS ALGORITHMS BEN DEANE / BEN DEANE / 16TH SEPTEMBER 2020 16TH SEPTEMBER 2020 @ben_deane @ben_deane 1WHAT WE'LL COVER WHAT WE'LL COVER Preliminaries: to further work 2 . 1ALGORITHMS: THE SOUL OF THE STL ALGORITHMS: THE SOUL OF THE STL 3 . 1A WORD ABOUT RANGES A WORD ABOUT RANGES -- Everyone (justifying ranges) "STL algorithms are not composable." " "STL algorithms are not composable." 4 . 1A WORD ABOUT RANGES A WORD ABOUT RANGES What, just because What, just because transform_copy_if transform_copy_if doesn't exist? doesn't exist? -- Everyone

Back to Basics: Algorithms Klaus Iglberger, CppCon 2023 klaus.iglberger@gmx.de2 Klaus Iglberger C++ Trainer/Consultant Author of “C++ Software Design” Chair of the CppCon Software Design track Implementations of the common data collections • Algorithms: work on the data contained in containers • Iterators: The glue between containers and algorithms 4The STL in a Nutshell 5The STL in a Nutshell Implementations of the common data collections • Algorithms: work on the data contained in containers • Iterators: The glue between containers and algorithms 6Back To Basics - Iterators on Tuesday at 2pm

Advanced SIMD Algorithms in Pictures ADVANCED SIMD ALGORITHMS IN PICTURES Denis Yaroshevskiy hapsydenisyaroshevskiygithubialpresentaton res html Advanced SIMD Algorithms in Pictures 6 1015123. 10.53 PM Advanced SIMD Algorithms in Pictures MEMCMP hp Advanced SIMD Algorithms in Pictures hpsyidenisyaroshevskiy gihub_olpresentatonsidyarashev_prasentatonslconferance_tal

… … Stack Traces for Async Code are Unhelpful Threadpool threads: #0 process_file(...) #5 pool.run() #10 __clone … … IO Thread: #0 async_read_some_at(...) #3 ctx Threadpool threads: #0 process_file(...) #5 pool.run() #10 … IO Thread: … #0 async_read_some_at(...) #3 ctx.run() #5 __clone … … Main thread: #0 unifex::sync_wait( … #0 async_read_some_at(...) … #12 unifex::sync_wait(...) #16 main() #19 __libc_start_main() … … Async Stacks are BetterStructured Concurrency Makes Async Stacks Possible

structures and algorithms for parallel programs. Working on C++ library of distributed data structures. Please hire me! About Us 2 Scott, Principal Engineer at CMU SEI Graph/ML/AI algorithms for large- HPEC Seven good reasons, ICCS Standards for graph algorithm primitives, HPEC Graph Algorithms in the Language of Linear Algebra LAGraph, GrAPL@ IPDPS 2013 2014 2015 2016 2017 2018 2019 been approved for public release and unlimited distribution. 43 - Provides uniform API for graph algorithms in the language of linear algebra - Revolve around sparse matrix and vector operations which can

LinkProject Goals - Offer high-level, standard C++ distributed data structures - Support distributed algorithms - Achieve high performance for both multi-GPU, NUMA, and multi-node execution float dot_p Parallelism, Distributed Data Structures) - Distributed Ranges (Concepts) - Implementation (Algorithms and views) - Complex Data Structures (Dense and sparse matrices) - Lessons learnedOutline Parallelism, Distributed Data Structures) - Distributed Ranges (Concepts) - Implementation (Algorithms and views) - Complex Data Structures (Dense and sparse matrices) - Lessons learnedStandard

Apex.AI. CppCon 2023 Building bridges: Leveraging C++ and ROS for simulators, sensor data and algorithms Divya Aggarwal October 5, 2023© 2023 Apex.AI, Inc. | All rights reserved. Apex.AI, Apex.OS inputs. • We can take the example of testing and validation of perception algorithms for autonomous vehicles. • Perception algorithms process sensor data (from LiDAR, cameras) and perceive the environment Grace, Apex.Ida, Apex.Alan, Apex.Ray are trademarks of Apex.AI. Determinism with simulators and algorithms What is missing? 16 Simulation run 1: Camera image: [ Image 1] Detected pedestrians: [Pedestrian

Design patterns for error handling in C++ programs using parallel algorithms and executors Mark Hoemmen* mhoemmen@stellarscience.com CppCon 2020 * hoʊ’mən, or hœm’mən; he/himWho am I? • > 10 years post-PhD experience writing parallel C++ for science and engineering • Background: Parallel algorithms for big linear algebra problems • 1st WG21: Nov 2017 • Started new job at Stellar Science in in March Eschew raw pointersOutline • Parallelism makes error handling harder… • …C++ parallel algorithms and tasks specifically • Message Passing Interface (MPI): 3 decades of distributed-memory parallel

Stephen Brawner, Robottimo Robotics at Compile Time Optimizing Robotics Algorithms with c++’s Compile-Time FeaturesAbout me • Robotics Software Consultant based in Portland, OR • Chief Roboticist

Goals for the Executors proposal 2. Some simple examples, intro to senders 3. The lifecycle of an async operation 4. Under the hood of a concurrent operation 5. Implementing a simple algorithm 6. Senders EXECUTORS PROPOSAL The vision: “An asynchronous analog of the STL” • A full suite of standard async algorithms based on real-world requirements: E.g., then, when_all, sync_wait, repeat, stop_when, timeout etc. (not all proposed yet) • A standard set of abstractions (aka, concepts) derived from the algorithms • Efficient interoperability with coroutines • An open and extensible way to specify where, how