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.

Hadi Asghari Moghaddam

dblp:162/9764 · also Hadi Asgharimoghaddam · DBLP profile ↗
← Back
7ranked-venue papers
2as first author
1since 2021 · last 2023
0000-0003-2867-419XORCID · verified

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

Systems, architecture and hardware · 7 · 2 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
5 papers
Hardware accelerators and domain-specific architectures · 40% Memory systems · 35% Energy-efficient computing · 14%
Theoretical computer science
1 paper
Computational geometry · 100%

Topics — the 13 heaviest of 15, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Hardware accelerators and domain-specific architectures › sparsity exploitation
sparse tensor computation
1.022023
Accelerating Sparse Data Orchestration via Dynamic Reflexive Tiling · ASPLOS (3) 2023
ExTensor: An Accelerator for Sparse Tensor Algebra · MICRO 2019
Hardware accelerators and domain-specific architectures
data reuse optimization
0.712023
Accelerating Sparse Data Orchestration via Dynamic Reflexive Tiling · ASPLOS (3) 2023
Memory systems
processing-in-memory
0.622018
Application-Transparent Near-Memory Processing Architecture with Memory Channel Network · MICRO 2018
Chameleon: Versatile and practical near-DRAM acceleration architecture for large memory systems · MICRO 2016
High-performance computing › tensor computation
sparse tensor algebra
0.622023
ExTensor: An Accelerator for Sparse Tensor Algebra · MICRO 2019
Accelerating Sparse Data Orchestration via Dynamic Reflexive Tiling · ASPLOS (3) 2023
Hardware accelerators and domain-specific architectures
tensor accelerator
0.412019
ExTensor: An Accelerator for Sparse Tensor Algebra · MICRO 2019
Memory systems › processing-in-memory
near-memory processing
0.312018
Application-Transparent Near-Memory Processing Architecture with Memory Channel Network · MICRO 2018
Memory systems
DRAM
0.212016
Chameleon: Versatile and practical near-DRAM acceleration architecture for large memory systems · MICRO 2016
Energy-efficient computing › voltage scaling
dynamic voltage scaling
0.212016
VR-scale: runtime dynamic phase scaling of processor voltage regulators for improving power efficiency · DAC 2016
Memory systems › processing-in-memory
near-DRAM acceleration
0.212016
Chameleon: Versatile and practical near-DRAM acceleration architecture for large memory systems · MICRO 2016
Energy-efficient computing
power management
0.212016
VR-scale: runtime dynamic phase scaling of processor voltage regulators for improving power efficiency · DAC 2016
Energy-efficient computing › power management › device power management
processor power management
0.212016
VR-scale: runtime dynamic phase scaling of processor voltage regulators for improving power efficiency · DAC 2016
Computational geometry › geometric intersection
intersection detection
0.112019
ExTensor: An Accelerator for Sparse Tensor Algebra · MICRO 2019
Memory systems › processing-in-memory › memory-centric computing
near-memory accelerator
0.112016
Chameleon: Versatile and practical near-DRAM acceleration architecture for large memory systems · MICRO 2016

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

hierarchical elimination · 0.8data fetching · 0.8sparsity-aware tiling · 0.7dynamic reflexive tiling · 0.7simulation · 0.3microarchitectural simulation · 0.2load current prediction · 0.23d/2.5d stacking · 0.2
YearPublicationVenuePosition
2023 Accelerating Sparse Data Orchestration via Dynamic Reflexive Tiling
abstract
Tensor algebra involving multiple sparse operands is severely memory bound, making it a challenging target for acceleration. Furthermore, irregular sparsity complicates traditional techniques—such as tiling—for ameliorating memory bottlenecks. Prior sparse tiling schemes are sparsity unaware: they carve tensors into uniform coordinate-space shapes, which leads to low-occupancy tiles and thus lower exploitable reuse. To address these challenges, this paper proposes dynamic reflexive tiling (DRT), a novel tiling method that improves data reuse over prior art for sparse tensor kernels, unlocking significant performance improvement opportunities. DRT’s key idea is dynamic sparsity-aware tiling. DRT continuously re-tiles sparse tensors at runtime based on the current sparsity of the active regions of all input tensors, to maximize accelerator buffer utilization while retaining the ability to co-iterate through tiles of distinct tensors.
Toluwanimi O. Odemuyiwa, Hadi Asghari Moghaddam, Michael Pellauer, Kartik Hegde, Po-An Tsai, Neal Clayton Crago, Aamer Jaleel, John D. Owens, Edgar Solomonik, Joel S. Emer, Christopher W. Fletcher
ASPLOS (3)2
2019 ExTensor: An Accelerator for Sparse Tensor Algebra
abstract
Generalized tensor algebra is a prime candidate for acceleration via customized ASICs. Modern tensors feature a wide range of data sparsity, with the density of non-zero elements ranging from 10-6% to 50%. This paper proposes a novel approach to accelerate tensor kernels based on the principle of hierarchical elimination of computation in the presence of sparsity. This approach relies on rapidly finding intersections---situations where both operands of a multiplication are non-zero---enabling new data fetching mechanisms and avoiding memory latency overheads associated with sparse kernels implemented in software.
Kartik Hegde, Hadi Asghari Moghaddam, Michael Pellauer, Neal Clayton Crago, Aamer Jaleel, Edgar Solomonik, Joel S. Emer, Christopher W. Fletcher
MICRO2
2018 Application-Transparent Near-Memory Processing Architecture with Memory Channel Network
abstract
The physical memory capacity of servers is expected to increase drastically with deployment of the forthcoming non-volatile memory technologies. This is a welcomed improvement for emerging data-intensive applications. For such servers to be cost-effective, nonetheless, we must cost-effectively increase compute throughput and memory bandwidth commensurate with the increase in memory capacity without compromising application readiness. Tackling this challenge, we present Memory Channel Network (MCN) architecture in this paper. Specifically, first, we propose an MCN DIMM, an extension of a buffered DIMM where a small but capable processor called MCN processor is integrated with a buffer device on the DIMM for near-memory processing. Second, we implement device drivers to give the host and MCN processors in a server an illusion that they are independent heterogeneous nodes connected through an Ethernet link. These allow the host and MCN processors in a server to run a given data-intensive application together based on popular distributed computing frameworks such as MPI and Spark without any change in the host processor hardware and its application software, while offering the benefits of high-bandwidth and low-latency communications between the host and the MCN processors over memory channels. As such, MCN can serve as an application-transparent framework which can seamlessly unify near-memory processing within a server and distributed computing across such servers for data-intensive applications. Our simulation running the full software stack shows that a server with 8 MCN DIMMs offers 4.56X higher throughput and consume 47.5% less energy than a cluster with 9 conventional nodes connected through Ethernet links, as it facilitates up to 8.17X higher aggregate DRAM bandwidth utilization. Lastly, we demonstrate the feasibility of MCN with an IBM POWER8 system and an experimental buffered DIMM.
Mohammad Alian, Seungwon Min, Hadi Asghari Moghaddam, Ashutosh Dhar, Dong Kai Wang, Adam J. McPadden, Oliver O'Halloran, Deming Chen, Jinjun Xiong, Daehoon Kim 0001, Wen-Mei W. Hwu, Nam Sung Kim
MICRO3
2016 VR-scale: runtime dynamic phase scaling of processor voltage regulators for improving power efficiency
abstract
A voltage regulator (VR) for a processor is one of the most critical platform components. Particularly, a VR is required to support fast, accurate, and fine-grained voltage changes for efficient processor power management. Such requirements, nonetheless, can be relaxed when a processor consumes low power at runtime. Thus, manufacturers begin to offer some knobs so that a processor can adapt VR's operating parameters to cost-effectively satisfy the requirements with high efficiency. In this paper, we first demonstrate that: (1) VR efficiency heavily depends on load current (i.e., current delivered to a processor) and a VR operating parameter (e.g., the number of active phases) at given voltage; (2) a processor running a parallel application mostly consumes small current due to aggressive power management; and (3) when the processor is in active state, all the phases are always activated in the VR. (2) and (3) in turn lead to poor VR efficiency at most runtime. Second, we present VR-Scale that dynamically scales the number of active phases based on the predicted load current for the next interval. Our evaluations based on an Intel processor running emerging parallel applications show that VR-Scale can reduce the total power consumed by a processor and its VR by more than 19% with negligible performance impact.
Hadi Asghari Moghaddam, Hamid Reza Ghasemi, Abhishek A. Sinkar, Indrani Paul, Nam Sung Kim
DAC1
2016 Chameleon: Versatile and practical near-DRAM acceleration architecture for large memory systems
abstract
The performance of computer systems is often limited by the bandwidth of their memory channels, but further increasing the bandwidth is challenging under the stringent pin and power constraints of packages. To further increase performance under these constraints, various near-DRAM acceleration (NDA) architectures, which tightly integrate accelerators with DRAM devices using 3D/2.5D-stacking technology, have been proposed. However, they have not prevailed yet because they often rely on expensive HBM/HMC-like DRAM devices which also suffer from limited capacity, whereas the scalability of memory capacity is critical for some computing segments such as servers. In this paper, we first demonstrate that data buffers in a load-reduced DIMM (LRDIMM), which is originally developed to support large memory systems for servers, are supreme places to integrate near-DRAM accelerators. Second, we propose Chameleon, an NDA architecture that can be realized without relying on 3D/2.5D-stacking technology and seamlessly integrated with large memory systems for servers. Third, we explore three microarchitectures that abate constraints imposed by taking LRDIMM architecture for NDA. Our experiment demonstrates that a Chameleon-based system can offer 2.13 χ higher geo-mean performance while consuming 34% lower geo-mean data transfer energy than a system that integrates the same accelerator logic within the processor.
Hadi Asghari Moghaddam, Young Hoon Son, Jung Ho Ahn, Nam Sung Kim
MICRO1
2015 Energy-Efficient Approximate Multiplication for Digital Signal Processing and Classification Applications
abstract
The need to support various digital signal processing (DSP) and classification applications on energy-constrained devices has steadily grown. Such applications often extensively perform matrix multiplications using fixed-point arithmetic while exhibiting tolerance for some computational errors. Hence, improving the energy efficiency of multiplications is critical. In this brief, we propose multiplier architectures that can tradeoff computational accuracy with energy consumption at design time. Compared with a precise multiplier, the proposed multiplier can consume 58% less energy/op with average computational error of $\sim 1$ %. Finally, we demonstrate that such a small computational error does not notably impact the quality of DSP and the accuracy of classification applications.
Srinivasan Narayanamoorthy, Hadi Asghari Moghaddam, Taejoon Park, Nam Sung Kim
IEEE Trans. Very Large Scale Integr. Syst.2
2013 A novel hardware implementation for joint heart rate, respiration rate, and gait analysis applied to body area networks
abstract
Continuous and remote monitoring of vital health-related and physical activity signs of a patient is one of the most important technology-oriented applications to monitor the health-care of ill individuals. In this paper, an innovative framework for a wireless Body Area Network (BAN) system, based on the IEEE 802.15.6 standard, with three types of sensors is proposed and implemented. These include Electrocardiogram (ECG), Force Sensitive Resistor (FSR) and Gyroscope. The proposed design is a novel implementation of an embedded system for the real-time processing and analyzing of the ECG signal, gait phases, and detection of the respiration rate from the ECG signal, by means of small applicable sensors and wireless data communication. Gait analysis is essential for the precise ECG and respiration analysis according to the body posture. A new comprehensive high-speed six-state design is utilized to cover all walking habits. Moreover, the collected data is sent to an external device for further monitoring. The proposed framework is optimized for hardware implementation and targeted for low power applications. The optimized joint implementation of these health-related sensors makes the proposed design distinct from the previous work.
Moein Khazraee, Ali Reza Zamani, Mohammad Hallajian, Seyed Pooya Ehsani, Hadi Asghari Moghaddam, Alireza Parsafar, Mahdi Shabany
ISCAS5