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

Reza Karimi

dblp:58/4724 · DBLP profile ↗
← Back
4ranked-venue papers
0as first author
0since 2021 · last 2020
—ORCID · conflict

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

Systems, architecture and hardware · 2Software engineering, systems software and programming languages · 1Applied, interdisciplinary, general and emerging computing · 1

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
Cloud and datacenter computing · 46% Hardware accelerators and domain-specific architectures · 46% Performance modeling and evaluation · 7%

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

TopicWeightPapersLastEvidence papers
Cloud and datacenter computing
cluster resource management and scheduling
0.412020
Serving DNNs like Clockwork: Performance Predictability from the Bottom Up · OSDI 2020
Hardware accelerators and domain-specific architectures › machine learning accelerator › DNN inference
DNN inference serving
0.412020
Serving DNNs like Clockwork: Performance Predictability from the Bottom Up · OSDI 2020
Cloud and datacenter computing › inference serving
DNN serving
0.412020
Serving DNNs like Clockwork: Performance Predictability from the Bottom Up · OSDI 2020
Hardware accelerators and domain-specific architectures
machine learning accelerator
0.412020
Serving DNNs like Clockwork: Performance Predictability from the Bottom Up · OSDI 2020
Performance modeling and evaluation
performance prediction
0.112020
Serving DNNs like Clockwork: Performance Predictability from the Bottom Up · OSDI 2020

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

scheduling · 0.4performance modeling · 0.4
YearPublicationVenuePosition
2020 Bandwidth-Aware Page Placement in NUMA
abstract
Page placement is a critical problem for memory-intensive applications running on a shared-memory multiprocessor with a non-uniform memory access (NUMA) architecture. State-of-the-art page placement mechanisms interleave pages evenly across NUMA nodes. However, this approach fails to maximize memory throughput in modern NUMA systems, characterized by asymmetric bandwidths and latencies, and sensitive to memory contention and interconnect congestion phenomena.We propose BWAP, a novel page placement mechanism based on asymmetric weighted page interleaving. BWAP combines an analytical performance model of the target NUMA system with on-line iterative tuning of page distribution for a given memory-intensive application. Our experimental evaluation with representative memory-intensive workloads shows that BWAP performs up to 66% better than state-of-the-art techniques. These gains are particularly relevant when multiple co-located applications run in disjoint partitions of a large NUMA machine or when applications do not scale up to the total number of cores.
David Gureya, João Neto 0001, Reza Karimi, João Barreto 0001, Pramod Bhatotia, Vivien Quéma, Rodrigo Rodrigues 0001, Paolo Romano 0002, Vladimir Vlassov
IPDPS3
2020 Serving DNNs like Clockwork: Performance Predictability from the Bottom Up
Arpan Gujarati, Reza Karimi, Safya Alzayat, Antoine Kaufmann, Ymir Vigfusson, Jonathan Mace
OSDI2
2017 Mithril: mining sporadic associations for cache prefetching
abstract
The growing pressure on cloud application scalability has accentuated storage performance as a critical bottleneck. Although cache replacement algorithms have been extensively studied, cache prefetching - reducing latency by retrieving items before they are actually requested - remains an underexplored area. Existing approaches to history-based prefetching, in particular, provide too few benefits for real systems for the resources they cost.
Juncheng Yang, Reza Karimi, Trausti Saemundsson, Avani Wildani, Ymir Vigfusson
SoCC2
2011 Brownian Dynamics Simulation of Nucleocytoplasmic Transport: A Coarse-Grained Model for the Functional State of the Nuclear Pore Complex
abstract
The nuclear pore complex (NPC) regulates molecular traffic across the nuclear envelope (NE). Selective transport happens on the order of milliseconds and the length scale of tens of nanometers; however, the transport mechanism remains elusive. Central to the transport process is the hydrophobic interactions between karyopherins (kaps) and Phe-Gly (FG) repeat domains. Taking into account the polymeric nature of FG-repeats grafted on the elastic structure of the NPC, and the kap-FG hydrophobic affinity, we have established a coarse-grained model of the NPC structure that mimics nucleocytoplasmic transport. To establish a foundation for future works, the methodology and biophysical rationale behind the model is explained in details. The model predicts that the first-passage time of a 15 nm cargo-complex is about 2.6±0.13 ms with an inverse Gaussian distribution for statistically adequate number of independent Brownian dynamics simulations. Moreover, the cargo-complex is primarily attached to the channel wall where it interacts with the FG-layer as it passes through the central channel. The kap-FG hydrophobic interaction is highly dynamic and fast, which ensures an efficient translocation through the NPC. Further, almost all eight hydrophobic binding spots on kap-β are occupied simultaneously during transport. Finally, as opposed to intact NPCs, cytoplasmic filaments-deficient NPCs show a high degree of permeability to inert cargos, implying the defining role of cytoplasmic filaments in the selectivity barrier.
Ruhollah Moussavi-Baygi, Yousef Jamali, Reza Karimi, Mohammad R. K. Mofrad
PLoS Comput. Biol.3