21 citations · 51 across the 20 of their papers we have counts for
5 papers · 1 filter
HexaMesh: Scaling to Hundreds of Chiplets with an Optimized Chiplet Arrangement
Patrick Iff, Maciej Besta, Matheus Cavalcante +3
2.5D integration is an important technique to tackle the growing cost of manufacturing chips in advanced technology nodes. This poses the challenge of providing high-performance in…
Sparse Hamming Graph: A Customizable Network-on-Chip Topology
Patrick Iff, Maciej Besta, Matheus Cavalcante +3
Chips with hundreds to thousands of cores require scalable networks-on-chip (NoCs). Customization of the NoC topology is necessary to reach the diverse design goals of different ch…
Neural Graph Databases
Maciej Besta, Patrick Iff, Florian Scheidl +5
Graph databases (GDBs) enable processing and analysis of unstructured, complex, rich, and usually vast graph datasets. Despite the large significance of GDBs in both academia and i…
ProbGraph: High-Performance and High-Accuracy Graph Mining with Probabilistic Set Representations
Maciej Besta, Cesare Miglioli, Paolo Sylos Labini +11
Important graph mining problems such as Clustering are computationally demanding. To significantly accelerate these problems, we propose ProbGraph: a graph representation that enab…
PolarFly: A Cost-Effective and Flexible Low-Diameter Topology
Kartik Lakhotia, Maciej Besta, Laura Monroe +4
In this paper we present PolarFly, a diameter-2 network topology based on the Erdos-Renyi family of polarity graphs from finite geometry. This is a highly scalable low-diameter top…