2 citations · 2 across the 7 of their papers we have counts for
8 papers
MailRail: Mitigating Incast Congestion with User-Space, Node-Based Flow Control
Noel Gomillion, Lance Fletcher, Trevor Steil +2
Irregular workloads, such as those stemming from Graph Neural Networks (GNNs) and Mixture-of-Experts (MoE) models, frequently induce severe incast congestion in large-scale paralle…
SOLANET: Distributed Neighbor Graph Construction on GPU-Accelerated Systems
Keita Iwabuchi, Trevor Steil, Benjamin W. Priest +3
Neighbor graphs capture relationships among data points and are widely used in data analytics and AI workloads. Many studies have explored approximate construction methods for sing…
Better Learning-Augmented Spanning Tree Algorithms via Metric Forest Completion
Nate Veldt, Thomas Stanley, Benjamin W. Priest +5
We present improved learning-augmented algorithms for finding an approximate minimum spanning tree (MST) for points in an arbitrary metric space. Our work follows a recent framewor…
Survey-Wide Asteroid Discovery with a High-Performance Computing Enabled Non-Linear Digital Tracking Framework
Nathan Golovich, Trevor Steil, Alex Geringer-Sameth +3
Modern astronomical surveys detect asteroids by linking together their appearances across multiple images taken over time. This approach faces limitations in detecting faint astero…
Approximate Tree Completion and Learning-Augmented Algorithms for Metric Minimum Spanning Trees
Nate Veldt, Thomas Stanley, Benjamin W. Priest +4
Finding a minimum spanning tree (MST) for points in an arbitrary metric space is a fundamental primitive for hierarchical clustering and many other ML tasks, but this takes $Ω(…
A Scalable Gaussian Process Approach to Shear Mapping with MuyGPs
Gregory Sallaberry, Benjamin W. Priest, Robert Armstrong +4
Analysis of cosmic shear is an integral part of understanding structure growth across cosmic time, which in-turn provides us with information about the nature of dark energy. Conve…
Scalable Edge Clustering of Dynamic Graphs via Weighted Line Graphs
Michael Ostroski, Geoffrey Sanders, Trevor Steil +1
Timestamped relational datasets consisting of records between pairs of entities are ubiquitous in data and network science. For applications like peer-to-peer communication, email,…
TriPoll: Computing Surveys of Triangles in Massive-Scale Temporal Graphs with Metadata
Trevor Steil, Tahsin Reza, Keita Iwabuchi +3
Understanding the higher-order interactions within network data is a key objective of network science. Surveys of metadata triangles (or patterned 3-cycles in metadata-enriched gra…