Distributed Ranges: A Model for Building Distributed Data Structures, Algorithms, and Views

Explore a comprehensive conference talk on distributed ranges as a model for building distributed data structures, algorithms, and views in C++. Delve into the challenges of writing programs for computer clusters and learn how distributed data structures can simplify this process. Discover how modern C++ features like concepts, customization points, and the ranges library enable generic algorithms and views to interoperate with multiple distributed data structures. Examine background information on distributed computing and data structures, and understand how customization point objects and concepts allow for the implementation of generic algorithms compatible with any distributed data structure meeting the "distributed range" concept. Investigate the implementation of views satisfying this concept, enabling algorithms to operate on lazily evaluated views of distributed data structures. Gain insights into two implementations of this model for multi-GPU and multi-node programs, and explore performance considerations for state-of-the-art HPC systems.