[tile] DB libraries, and large-scale graph analytics. Open-source software projects resulting from his work include the Matrix Template Library, the Boost Graph Library and Open MPI. 。Phil Ratzloff *。Distinguished relationships between elements of a data set *，Without regard to what the data set actually is *。 Graph theoretical (abstract) results can be applied to many different practical (concrete) problems -theory cvMuNKCATIOWS 有二有 灿瑟必帮 和一是/第 手太则光大 A，训四 昱 站 -本| 厅 是，主 半一司、|全之体 ~ 对 /人-看 奋才全 和 全原 和 刁曾 The Future ls Big Graph: on meetalThngs soneaiadman MD] Basic Principles *。The C++ standard library (nee STL) provides

Scott, Principal Engineer at CMU SEI Graph/ML/AI algorithms for large- and small- scale parallel systems. Working on GBTL, a linear algebra-based C++ library for graph analytics.[DISTRIBUTION STATEMENT GraphBLAS community, C API Overview of our draft C++ API How might this interoperate with standard C++, graph library proposal? 4[DISTRIBUTION STATEMENT A] This material has been approved for public release GraphBLAS community, C API Overview of our draft C++ API How might this interoperate with standard C++, graph library proposal? 5[DISTRIBUTION STATEMENT A] This material has been approved for public release

top-down task graph What is Task Graph-based Programming System (TGPS) Code 4• TGPS encapsulates function calls and their dependencies in a top-down task graph What is Task Graph-based Programming task graph What is Task Graph-based Programming System (TGPS) Code A B C D B A C D 6• TGPS encapsulates function calls and their dependencies in a top-down task graph What is Task Graph-based precede(task_d); 19 20 sched.schedule(); 21 sched.wait(); B A C D 1. Easy to write and express a task graph 2. Allow to implement irregular parallel decomposition strategies 8Existing TGPSs on Heterogenous

conflict ● Portability ○ Flag meanings depend on the compiler in use (vendor and version) ● Build graph is unknown ○ Generated headers? ○ Generated sources? ○ Generated input files (-include, -fmodule-mapper= -fmodule-mapper=, response files) ● C++ modules… Compilation Databases: Limitations 2 9C++ Modules on the Scene ● Modules complicate C++ compilation ○ Surprise! 🎉 ○ Basically inherit the Fortran 90 modules CXX_MODULES FILES a1.cpp) target_compile_features(A PUBLIC cxx_std_20) 12C++ Modules on the Scene: Compilation Strategy ● CMake uses the “scanning” approach to build Fortran and C++ modules See:

Scene Setting “… functions then provide the basic vocabulary of computation, just as types (built-in and user-defined) provide the basic vocabulary of data.” Bjarne Stroustrup, A Tour of C++, Second struct Foo { int n; std::vector bar_vec; std::string foo_str; }; Scene Setting Foo int std::vector std::string Bar std::string Bar std::string Bar std::stringObject Source Type Graph .o w/ DebugInfostruct Bar { std:string str; }; struct Foo { int n; std::vector bar_vec; std::string foo_str; }; Source Type Graph .o w/ DebugInfostruct

Viewport::load_scene(const char* filename) { ZoneScoped; // ... std::shared_ptr<Scene> new_scene; { ZoneScopedN("new scene"); new_scene = std::make_shared<Scene>(filename); if (!new_scene) return return false; } m_scene = new_scene; return true; } ??? Unexplainable “tail” gaps: Gotchas 66• Implicit deferred execution (e.g. smart-pointer deleting an object) • Instrument expensive destructors Viewport::load_scene(const char* filename) { ZoneScoped; // ... std::shared_ptr<Scene> new_scene; { ZoneScopedN("new scene"); new_scene = std::make_shared<Scene>(filename); if (!new_scene) return

Viewport::load_scene(const char* filename) { ZoneScoped; // ... std::shared_ptr<Scene> new_scene; { ZoneScopedN("new scene"); new_scene = std::make_shared<Scene>(filename); if (!new_scene) return return false; } m_scene = new_scene; return true; } ??? Unexplainable “tail” gaps: Gotchas 63• Have you recently switched to a Debug build? • Only profile Release builds (preferably detached from

transfers between processes and even devices. Fanchen Su, XOffsetDatastructure, CppCon 2024 10 Game Scene Division1.1 XOffsetDatastructure • X + Offset + Datastructure • Data Structures • XOffsetDatastructure communication in games occurs in several key areas: • 1. Between servers and clients: • When entering a new scene or area, data for other players and NPCs must be loaded for display and interaction. • 2. Server-to-server Migration • When a scene process becomes overloaded, it's split into areas and lines. • As shown in the diagram, scenes are divided into different areas. • Area: Spatial partition of a scene managed by one

submaps small region within the larger occupancy grid typically used to constrain the planning scene for navigation usually centered on the position of the robot 47github.com/griswaldbrooks/spanny2 orientation-aware/rotated submaps have a fixed view relative to the robot meaning a consistent planning scene, increasing determinacygithub.com/griswaldbrooks/spanny2 rotated submaps: custom layout struct layout_rotatable

the past that once made sense ● Possibly rewritten by a less skilled eng. org.Your Code as a Crime Scene + code-maat12 How big is the universe? 15 Millions Lines of C/C/Objective-C 670,000 Lines