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.

Mohsen Kiani

dblp:233/0157 · DBLP profile ↗
← Back
3ranked-venue papers
3as first author
2since 2021 · last 2021
0000-0001-7566-3691ORCID · corroborated

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

Systems, architecture and hardware · 2 · 2 first-author · 1 since 2021Computer networks · 1 · 1 first-author · 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
1 paper
Performance modeling and evaluation · 70% GPUs and heterogeneous computing · 30%

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

TopicWeightPapersLastEvidence papers
Performance modeling and evaluation
cache performance modeling
0.412019
Efficient Cache Performance Modeling in GPUs Using Reuse Distance Analysis · ACM Trans. Archit. Code Optim. 2019
GPUs and heterogeneous computing
GPU cache
0.412019
Efficient Cache Performance Modeling in GPUs Using Reuse Distance Analysis · ACM Trans. Archit. Code Optim. 2019
Performance modeling and evaluation › cache performance modeling
reuse distance analysis
0.412019
Efficient Cache Performance Modeling in GPUs Using Reuse Distance Analysis · ACM Trans. Archit. Code Optim. 2019
Performance modeling and evaluation
simulation
0.112019
Efficient Cache Performance Modeling in GPUs Using Reuse Distance Analysis · ACM Trans. Archit. Code Optim. 2019

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

reuse distance analysis · 0.4
YearPublicationVenuePosition
2021 A network-aware and power-efficient virtual machine placement scheme in cloud datacenters based on chemical reaction optimization
Mohsen Kiani, Mohammad Reza Khayyambashi
Comput. Networks1
2021 SDAM: a combined stack distance-analytical modeling approach to estimate memory performance in GPUs
Mohsen Kiani, Amir Rajabzadeh
J. Supercomput.1
2019 Efficient Cache Performance Modeling in GPUs Using Reuse Distance Analysis
abstract
Reuse distance analysis (RDA) is a popular method for calculating locality profiles and modeling cache performance. The present article proposes a framework to apply the RDA algorithm to obtain reuse distance profiles in graphics processing unit (GPU) kernels. To study the implications of hardware-related parameters in RDA, two RDA algorithms were employed, including a high-level cache-independent RDA algorithm, called HLRDA, and a detailed RDA algorithm, called DRDA. DRDA models the effects of reservation fails in cache blocks and miss status holding registers to provide accurate cache-related performance metrics. In this case, the reuse profiles are cache-specific. In a selection of GPU kernels, DRDA obtained the L1 miss-rate breakdowns with an average error of 3.86% and outperformed the state-of-the-art RDA in terms of accuracy. In terms of performance, DRDA is 246,000× slower than the real GPU executions and 11× faster than GPGPU-Sim. HLRDA ignores the cache-related parameters and its obtained reuse profiles are general, which can be used to calculate miss rates in all cache sizes. Moreover, the average error incurred by HLRDA was 16.9%.
Mohsen Kiani, Amir Rajabzadeh
ACM Trans. Archit. Code Optim.1