4 papers
HDLouvain: High-Throughput Incremental Clustering for Hyperdimensional Data
Beenish Gul, Mahbod Afarin, Farhat Ahmed +4
Modern shotgun proteomics generates tens of thousands of tandem mass spectra per hour, producing hundreds of gigabytes of data that strain conventional clustering pipelines. DBSCAN…
Compiling Semi-Ring Dynamic Programming to Tier-Aware 3D-DRAM Processing-in-Memory
Mahbod Afarin, Tsung-Han Lu, Tajana Rosing
Processing-in-Memory (PIM) on monolithic 3D (M3D) DRAM is a promising answer to the memory wall for data-intensive dynamic programming (DP), yet extracting its performance today de…
GenDRAM:Hardware-Software Co-Design of General Platform in DRAM
Tsung-Han Lu, Weihong Xu, Tajana Rosing
Dynamic programming (DP) algorithms, such as All-Pairs Shortest Path (APSP) and genomic sequence alignment, are fundamental to many scientific domains but are severely bottlenecked…
PIM-FW: Hardware-Software Co-Design of All-pairs Shortest Paths in DRAM
Tsung-Han Lu, Zheyu Li, Minxuan Zhou +1
All-pairs shortest paths (APSP) is a fundamental algorithm used for routing, logistics, and network analysis, but the cubic time complexity and heavy data movement of the canonical…