Shared memory-aware latency-sensitive message aggregation for fine-grained communication

K Chandrasekar, L Kale - SC24-W: Workshops of the …, 2024 - ieeexplore.ieee.org
Message aggregation is widely used with a goal to reduce communication cost in HPC
applications. The difference in the order of overhead of sending a message and cost of per …

Towards a massive-scale distributed neighborhood graph construction

K Iwabuchi, T Steil, B Priest, R Pearce… - Proceedings of the SC'23 …, 2023 - dl.acm.org
Graph-based approximate nearest neighbor algorithms have shown high performance and
quality. However, such approaches require a large amount of memory and still take a long …

[SÁCH][B] Some Generalizations of Bounded-Confidence Models of Opinion Dynamics

GJ Li - 2024 - search.proquest.com
Bounded-confidence models (BCMs) are a type of model of opinion dynamics with
continuous-valued opinions. The two most popular BCMs are the Deffuant–Weisbuch (DW) …

[PDF][PDF] Detection of Overlap** Communities in Undirected Graphs with Personalized PageRank

G Li, T Steil - 2024 - osti.gov
Detection of Overlap** Communities in Undirected Graphs with Personalized PageRank
Page 1 LLNL-TR-864751 Detection of Overlap** Communities in Undirected Graphs with …