5 citations · 11 across the 6 of their papers we have counts for
7 papers
Faster Distributed Inference-Only Recommender Systems via Bounded Lag Synchronous Collectives
Kiril Dichev, Filip Pawlowski, Albert-Jan Yzelman
Recommender systems are enablers of personalized content delivery, and therefore revenue, for many large companies. In the last decade, deep learning recommender models (DLRMs) are…
HiCR, an Abstract Model for Distributed Heterogeneous Programming
Sergio Miguel Martin, Luca Terracciano, Kiril Dichev +3
We present HiCR, a model to represent the semantics of distributed heterogeneous applications and runtime systems. The model describes a minimal set of abstract operations to enabl…
Distributed and heterogeneous tensor-vector contraction algorithms for high performance computing
Pedro J. Martinez-Ferrer, Albert-Jan Yzelman, Vicenç Beltran
The tensor-vector contraction (TVC) is the most memory-bound operation of its class and a core component of the higher-order power method (HOPM). This paper brings distributed-memo…
Open Problems in (Hyper)Graph Decomposition
Deepak Ajwani, Rob H. Bisseling, Katrin Casel +26
Large networks are useful in a wide range of applications. Sometimes problem instances are composed of billions of entities. Decomposing and analyzing these structures helps us gai…
Effective implementation of the High Performance Conjugate Gradient benchmark on GraphBLAS
Alberto Scolari, Albert-Jan Yzelman
Applications in High-Performance Computing (HPC) environments face challenges due to increasing complexity. Among them, the increasing usage of sparse data pushes the limits of dat…
DAG Scheduling in the BSP Model
Pál András Papp, Georg Anegg, A. N. Yzelman
We study the problem of scheduling an arbitrary computational DAG on a fixed number of processors while minimizing the makespan. While previous works have mostly studied this probl…
Partitioning Hypergraphs is Hard: Models, Inapproximability, and Applications
Pál András Papp, Georg Anegg, A. N. Yzelman
We study the balanced -way hypergraph partitioning problem, with a special focus on its practical applications to manycore scheduling. Given a hypergraph on nodes, our goal…