Mahbod Afarin
Mahbod Afarin
Home
News
Publications
Teachings
Services
Awards
Research
Light
Dark
Automatic
1
HDLouvain: High-Throughput Incremental Clustering for Hyperdimensional Data
Modern shotgun proteomics generates tens of thousands of tandem mass spectra per hour, producing hundreds of gigabytes of data that …
Beenish Gul
,
Mahbod Afarin
,
Farhat Ahmed
,
Sumukh Pinge
,
Tsung-Han Lu
,
Tajana Rosing
,
Kevin Skadron
Cite
arXiv
Indexing Evolving Graphs via Query Evolution Prediction
Real-world graphs evolve, and analytical tasks over them are posed across a sequence of temporally indexed snapshots. A recurring …
Chao Gao
,
Xizhe Yin
,
Mahbod Afarin
,
Nael Abu-Ghazaleh
,
Rajiv Gupta
Cite
Sagas: Temporally Consistent Sampling of Evolving Graphs
Graph sampling algorithms create a smaller representative subgraph by picking a subset of the vertices and edges of the original …
Chao Gao
,
Mahbod Afarin
,
Xizhe Yin
,
Nael Abu-Ghazaleh
,
Rajiv Gupta
Cite
ApproxHDC: Approximation Tuning for Hyperdimensional Computing
As Moore's law reaches its physical and economic limits, domain-specific approaches are increasingly employed to accelerate machine …
Xavier Routh
,
Abdul Rafae Noor
,
Akash Kothari
,
Zheyu Li
,
Mahbod Afarin
,
Tajana Rosing
,
Vikram Adve
Cite
arXiv
GenMLIR: An MLIR Compiler for Dynamic Programming Workloads on Tier-Aware 3D-DRAM PIM
Processing-in-Memory (PIM) on monolithic 3D (M3D) DRAM is a promising answer to the memory wall for data-intensive dynamic programming …
Mahbod Afarin
,
Tsung-Han Lu
,
Tajana Rosing
Cite
arXiv
DeduBB: Binary Code Size Reduction via Post-Link Basic Block De-duplication
Binary sizes of upgraded versions of software applications tend to be larger, primarily due to feature bloat. This poses various …
Chaitanya Mamatha Ananda
,
Mahbod Afarin
,
Rajiv Gupta
,
Sriraman Tallam
,
Han Shen
,
Xinliang David Li
Cite
DOI
UVVs: Identifying Unchanged Vertex Values in Evolving Graphs via Intersection-Union Analysis
Evaluating a query over a large, irregular graph is inherently challenging. This challenge intensifies when solving a query over a …
Mahbod Afarin
,
Chao Gao
,
Xizhe Yin
,
Zhijia Zhao
,
Nael Abu-Ghazaleh
,
Rajiv Gupta
Cite
arXiv
PDF
Core Graph: Exploiting Edge Centrality to Speedup the Evaluation of Iterative Graph Queries
When evaluating an iterative graph query over a large graph, systems incur significant overheads due to repeated graph transfer across …
Xiaolin Jiang
,
Mahbod Afarin
,
Zhijia Zhao
,
Nael Abu-Ghazaleh
,
Rajiv Gupta
Cite
DOI
PDF
Expressway: Prioritizing Edges for Distributed Evaluation of Graph Queries
Distributed Graph analytics is being widely used in various domains for analyzing large real-world graphs. There have been numerous …
Abbas Mazloumi
,
Mahbod Afarin
,
Rajiv Gupta
Cite
DOI
PDF
MEGA Evolving Graph Accelerator
Graph Processing is an emerging workload for applications working with unstructured data, such as social network analysis, …
Chao Gao
,
Mahbod Afarin
,
Shafiur Rahman
,
Nael Abu-Ghazaleh
,
Rajiv Gupta
Cite
DOI
PDF
»
Cite
×