Demo Data from VLDB 2026 / reviewers in the wild / expert
Marjan Fariborz
dblp:252/2043
· DBLP profile ↗
3ranked-venue papers
1as first author
2since 2021 · last 2025
0000-0002-1896-1489ORCID · corroborated
Domains — the database's venue-derived domains; a paper can count in several
Systems, architecture and hardware · 2 · 1 first-author · 1 since 2021Software engineering, systems software and programming languages · 1 · 1 since 2021
Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.
| Computer architecture, parallel and distributed computing, and storage systems
2 papers |
Parallel and multicore computing · 33% Hardware accelerators and domain-specific architectures · 25% Memory systems · 25% | |
| Computer networks
1 paper |
Optical networks · 100% |
Topics — the 5 heaviest of 7, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Hardware accelerators and domain-specific architectures
graph processing accelerator |
0.9 | 1 | 2025 | NOVA: A Novel Vertex Management Architecture for Scalable Graph Processing · HPCA 2025 |
Memory systems
processing-in-memory |
0.9 | 1 | 2025 | NOVA: A Novel Vertex Management Architecture for Scalable Graph Processing · HPCA 2025 |
Parallel and multicore computing › graph processing
vertex-centric graph processing |
0.9 | 1 | 2025 | NOVA: A Novel Vertex Management Architecture for Scalable Graph Processing · HPCA 2025 |
Optical networks
optical interconnect |
0.4 | 1 | 2020 | Architecture and performance studies of 3D-Hyper-FleX-LION for reconfigurable all-to-all HPC networks · SC 2020 |
Parallel and multicore computing › graph processing
scalable graph processing |
0.3 | 1 | 2025 | NOVA: A Novel Vertex Management Architecture for Scalable Graph Processing · HPCA 2025 |
Methods — techniques the papers use, named apart from their topics
cycle-accurate simulation · 0.9simulation · 0.9
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2025 | NOVA: A Novel Vertex Management Architecture for Scalable Graph ProcessingabstractWe propose a scalable graph processing hardware accelerator called NOVA that is based on a novel vertex management architecture that decouples the execution of reduction and propagation operations in the popular vertex-centric graph processing paradigm. This allows us to store the working set in off-chip memory and utilize the available on-chip memory as a buffer to hide the latency of DRAM accesses instead of a traditional cache. This overcomes one of the key drawbacks of almost all the prior works which require temporal partitioning of graphs to scale to large graphs. We develop a cycle-accurate model of the architecture in gem 5 and demonstrate that NOVA exhibits near-perfect weak and strong scaling while scaling to large graphs by spatially tiling multiple nodes. In addition, our simulations show that NOVA is $2.35 \times$ better than a state-of-the-art graph accelerator (PolyGraph) while using a fraction of the on-chip memory on a synthetic graph with 134M vertices and over 2.14B edges. Marjan Fariborz, Mahyar Samani, Austin York, S. J. Ben Yoo, Jason Lowe-Power, Venkatesh Akella |
HPCA | 1 |
| 2021 | Enabling Reproducible and Agile Full-System SimulationabstractRunning experiments in modern computer architecture simulators can be a difficult and error-prone endeavor. Users must track many configurations, components and outputs between simulation runs. The gem5 simulator is no exception to this, requiring researchers to gather, organize, and create a significant number of components for a single simulation. In this paper, we present the gem5art framework, a tool to aid gem5 users in better structuring and running architecture simulations, and gem5 resources, a suite of resources with known compatibility with the simulator. These new additions to the gem5 project make full system simulation easier, allowing researchers to concentrate more so on their architectural innovations over setting up the simulation framework. The gem5art framework carefully logs the resources used in a gem5 simulation and places the results obtained within a database, thus enabling simple reproduction of experiments. The pre-built resources allow researchers to jump straight into running simulations rather than having to spend valuable time creating them. gem5art has been released with a permissive, open source license allowing the broader computer architecture community to contribute as workloads and workflows evolve. An archive of the data, an related materials, presented in this paper can be found at https://doi.org/10.6084/m9.figshare.14176802. Bobby R. Bruce, Ayaz Akram, Hoa Nguyen, Kyle Roarty, Mahyar Samani, Marjan Fariborz, Trivikram Reddy, Matthew D. Sinclair, Jason Lowe-Power |
ISPASS | 6 |
| 2020 | Architecture and performance studies of 3D-Hyper-FleX-LION for reconfigurable all-to-all HPC networksabstractWhile the Fat-Tree network topology represents the dominant state-of-art solution for large-scale HPC networks, its scalability in terms of power, latency, complexity, and cost is significantly challenged by the ever-increasing communication bandwidth among tens of thousands of heterogeneous computing nodes. We propose 3D-Hyper-FleX-LION, a flat hybrid electronic-photonic interconnect network that leverages the multichannel nature of modern multi-terabit switch ASICs (with 100 Gb/s granularity) and a reconfigurable all-to-all photonic fabric called Flex-LIONS. Compared to a Fat-Tree network interconnecting the same number of nodes and with the same oversubscription ratio, the proposed 3D-Hyper-FleX-LION offers a 20% smaller diameter, 3x lower power consumption, 10X fewer cable connections, and 4x reduction in the number of transceivers. When bandwidth reconfiguration capabilities of Flex-LIONS are exploited for non-uniform traffic workloads, simulation results indicate that 3D-Hyper-FleX-LION can achieve up to 4x improvement in energy efficiency for synthetic traffic workloads with high locality compared to Fat-Tree. Gengchen Liu, Roberto Proietti, Marjan Fariborz, Pouya Fotouhi, Xian Xiao, S. J. Ben Yoo |
SC | 3 |