Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

Amin Mamandipoor

dblp:350/2135 · DBLP profile ↗
← Back
5ranked-venue papers
0as first author
5since 2021 · last 2026
0009-0000-6686-3851ORCID · corroborated

Domains — the database's venue-derived domains; a paper can count in several

Systems, architecture and hardware · 4 · 4 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
3 papers
Memory systems · 70% Cloud and datacenter computing · 30%
Network and information security
1 paper
Network security · 77% Cryptographic protocols and secure computation · 23%
Computer networks
1 paper
Datacenter networks · 100%

Topics — the 8 heaviest of 11, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Cloud and datacenter computing › datacenter architecture
datacenter acceleration
0.812024
Data Motion Acceleration: Chaining Cross-Domain Multi Accelerators · HPCA 2024
Cloud and datacenter computing
data movement acceleration
0.812024
Data Motion Acceleration: Chaining Cross-Domain Multi Accelerators · HPCA 2024
Memory systems
processing-in-memory
0.812024
SmartDIMM: In-Memory Acceleration of Upper Layer Protocols · HPCA 2024
Memory systems
DRAM
0.712023
XFM: Accelerated Software-Defined Far Memory · MICRO 2023
Memory systems › memory disaggregation
far memory
0.712023
XFM: Accelerated Software-Defined Far Memory · MICRO 2023
Memory systems › processing-in-memory › memory-centric computing
near-memory accelerator
0.712023
XFM: Accelerated Software-Defined Far Memory · MICRO 2023
Memory systems › processing-in-memory
near-memory processing
0.712023
XFM: Accelerated Software-Defined Far Memory · MICRO 2023
Memory systems
data movement
0.212024
Data Motion Acceleration: Chaining Cross-Domain Multi Accelerators · HPCA 2024

Methods — techniques the papers use, named apart from their topics

SmartNIC offload · 2.3PCIe offload · 2.3AxDIMM · 2.3data motion acceleration · 0.8cross-stack hardware-software solution · 0.8simulation · 0.7analytical modeling · 0.7FPGA implementation · 0.7
YearPublicationVenuePosition
2026 Per-Bank Memory Bandwidth Regulation for Predictable and Performant Real-Time Systems
Connor Sullivan, Amin Mamandipoor, Cole Ridge Strickler, Heechul Yun
RTAS2
2024 SmartDIMM: In-Memory Acceleration of Upper Layer Protocols
abstract
There has been significant focus on offloading upperlayer network protocols (ULPs) to accelerators located on CPUs and SmartNICs. However, restricting accelerator placement to these locations limits both the variety of ULPs that can be accelerated and the overall performance. In particular, it overlooks the opportunity to accelerate ULPs running atop a stateful transport protocol in the face of high cache contention. That is, at high network rates, the frequent DRAM accesses and SmartNIC-CPU synchronizations outweigh the benefits of hardware acceleration. This work introduces SmartDIMM, which unlocks the opportunity for accelerating ULPs running atop stateful transport protocols that primarily operate on data stored in DRAM. We prototyped SmartDIMM using Samsung's AxDIMM and implemented endto-end offloading of (de/en)cryption and (de)compression– two ULPs widely employed in datacenters. We then compared the performance of SmartDIMM with accelerator placements on the CPU, SmartNIC, and PCIe cards. Our results demonstrate that ULP offloading on SmartDIMM outperforms CPU, SmartNIC and PCIe-based offload configurations. In comparison to a server executing (de/en)cryption and (de)compression on the CPU, SmartDIMM achieves 21.0% to 10.28 × higher requests per second and 36.3% to 88.9% lower memory bandwidth utilization.
Amin Mamandipoor, Mohammad Nouri, Mohammad Alian
HPCA2
2024 Data Motion Acceleration: Chaining Cross-Domain Multi Accelerators
abstract
There has been an arms race for devising accelerators for deep learning in recent years. However, real-world applications are not only neural networks but often span across multiple domains, e.g., database queries, compression, encryption, video coding, signal processing, and traditional machine learning, which may or may not contain deep learning. The sole focus on this single domain is sub-optimal as it misses the potential to proliferate and promote cross-domain multi-acceleration as there is an opportunity to harness the power of chaining heterogeneous Domain-Specific Architectures (DSAs) in modern datacenter applications. However, there is a catch as the data motion overhead can outweigh the benefits from all these chained heterogeneous accelerators. We dub the data restructuring and communication overhead of executing a single application using a chain of accelerators [1] as the data motion overhead. In a stark contrast with most works on DSAs that deal with accelerating compute kernels, this work focuses on accelerating data motion within a chain of heterogeneous DSAs in a multi-accelerator datacenter. To that end, this paper introduces Data Motion Acceleration (DMX) for (1) reducing data movement, (2) accelerating data restructuring, and (3) enabling interoperability between heterogeneous accelerators from different domains through a cross-stack hardware-software solution. The results with five end-to-end applications show that utilizing DMX offers up to 8.2 ×, 13.6 ×, and 5.2 × improvement in latency, throughput, and energy efficiency in a multi-accelerator system, respectively.
Shu-Ting Wang, Hanyang Xu 0002, Amin Mamandipoor, Rohan Mahapatra, Byung Hoon Ahn, Soroush Ghodrati, Krishnan Kailas, Mohammad Alian, Hadi Esmaeilzadeh
HPCA3
2023 Profiling gem5 Simulator
abstract
In this work, we set out to find the answers to the following questions: (1) Where are the bottlenecks in a state-of-theart architectural simulator? (2) How much faster can architectural simulations run by tuning system configurations? (3) What are the opportunities in accelerating software simulation using hardware accelerators? We choose gem5 as the representative architectural simulator, run several simulations with various configurations, perform a detailed architectural analysis of the gem5 source code on different server platforms, tune both system and architectural settings for running simulations, and discuss the future opportunities in accelerating gem5 as an important application. Our detailed profiling of gem5 reveals that its performance is extremely sensitive to the size of the Ll cache. Our experimental results show that a RISC-V core with 32KB data and instruction cache improves gem5’s simulation speed by 31%$\sim$61% compared with a baseline core with 8KB Ll caches. Our paper is the first step toward building specialized hardware and software environments for accelerating software-based simulators.
Johnson Umeike, Alex Manley, Amin Mamandipoor, Heechul Yun, Mohammad Alian
ISPASS4
2023 XFM: Accelerated Software-Defined Far Memory
abstract
DRAM constitutes over 50% of server cost and 75% of the embodied carbon footprint of a server. To mitigate DRAM cost, far memory architectures have emerged. They can be separated into two broad categories: software-defined far memory (SFM) and disaggregated far memory (DFM). In this work, we compare the cost of SFM and DFM in terms of their required capital investment, operational expense, and carbon footprint. We show that, for applications whose data sets are compressible and have predictable memory access patterns, it takes several years for a DFM to break even with an equivalent capacity SFM in terms of cost and sustainability. We then introduce XFM, a near-memory accelerated SFM architecture, which exploits the coldness of data during SFM-initiated swap ins and outs. XFM leverages refresh cycles to seamlessly switch the access control of DRAM between the CPU and near-memory accelerator. XFM parallelizes near-memory accelerator accesses with row refreshes and removes the memory interference caused by SFM swap ins and outs. We modify an open source far memory implementation to implement a full-stack, user-level XFM. Our experimental results use a combination of an FPGA implementation, simulation, and analytical modeling to show that XFM eliminates memory bandwidth utilization when performing compression and decompression operations with SFM s of capacities up to 1TB. The memory and cache utilization reductions translate to 5 ∼ 27% improvement in the combined performance of co-running applications.
Amin Mamandipoor, Derrick Quinn, Mohammad Alian
MICRO2