Alireza Sanaee

Alireza Sanaee

Auto-generated profile, based on publicly available information

Alireza Sanaee

University of Cambridge, Cambridge, United Kingdom and Huawei, Cambridge, United Kingdom

Research Focus & Metrics

Academic Career Length

9Years (2018-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
8 May 2023
Verified
Conference Paper
Open access
MSMehran Salmani
Mehran Salmani
SGSaeid Ghafouri
Saeid Ghafouri
ASAlireza Sanaee
Alireza Sanaee
KRKamran Razavi
Kamran Razavi
MMMax Mühlhäuser
Max Mühlhäuser
MSMohsen Sharifi
Mohsen Sharifi
The use of machine learning (ML) inference for various applications is growing drastically. ML inference services engage with users directly, requiring fast and accurate responses. Moreover, these services face dynamic workloads of requests, imposing changes in their computing resources. Failing to right-size computing resources results in either latency service level objectives (SLOs) violations or wasted computing resources. Adapting to dynamic workloads considering all the pillars of accuracy, latency, and resource cost is challenging. In response to these challenges, we propose InfAdapter, which proactively selects a set of ML model variants with their resource allocations to meet latency SLO while maximizing an objective function composed of accuracy and cost. InfAdapter decreases SLO violation and costs up to 65% and 33%, respectively, compared to a popular industry autoscaler (Kubernetes Vertical Pod Autoscaler).

22 February 2022
Verified
Conference Paper
Open access
SMSebastiano Miano
Sebastiano Miano
ASAlireza Sanaee
Alireza Sanaee
FRFulvio Risso
Fulvio Risso
GRGábor Rétvári
Gábor Rétvári
GAGianni Antichi
Gianni Antichi
State-of-the-art approaches to design, develop and optimize software packet-processing programs are based on static compilation: the compiler's input is a description of the forwarding plane semantics and the output is a binary that can accommodate any control plane configuration or input traffic. In this paper, we demonstrate that tracking control plane actions and packet-level traffic dynamics at run time opens up new opportunities for code specialization. We present Morpheus, a system working alongside static compilers that continuously optimizes the targeted networking code. We introduce a number of new techniques, from static code analysis to adaptive code instrumentation, and we implement a toolbox of domain specific optimizations that are not restricted to a specific data plane framework or programming language. We apply Morpheus to several eBPF and DPDK programs including Katran, Facebook's production-grade load balancer. We compare Morpheus against state-of-the-art optimization frameworks and show that it can bring up to 2x throughput improvement, while halving the 99th percentile latency.

19 August 2019
Verified
Conference Paper
Open access
ESErfan Sharafzadeh
Erfan Sharafzadeh
SKSeyed Alireza Sanaee Kohroudi
Seyed Alireza Sanaee Kohroudi
EAEsmail Asyabi
Esmail Asyabi
MSMohsen Sharifi
Mohsen Sharifi

16 April 2018 in IEEE Transactions on Parallel and Distributed Systems
Verified
Journal Article
Closed access
EAEsmail Asyabi
Esmail Asyabi
SSSeyedAlireza SanaeeKohroudi
SeyedAlireza SanaeeKohroudi
MSMohsen Sharifi
Mohsen Sharifi
ABAzer Bestavros
Azer Bestavros
large-scale online services parallelize sub-operations of a user's request across a large number of physical machines (service components) so as to enhance the responsiveness. Even a temporary spike in latency of any service component can notably inflate the end to end delay; therefore, the tail of the latency distribution of service components has become a subject of intensive research. The key characteristics of clouds such as elasticity and on-demand resource provisioning have made clouds attractive for hosting large-scale online services wherein VMs are the building blocks of services. However, adherence to traditional hypervisor scheduling policies has led to unpredictable CPU access latencies for virtual CPUs (vCPUs) that are responsible for performing network IO processes. This has resulted in poor and unpredictable performance for network IO, exacerbating VMs' long tail latencies and discouraging the hosting of large-scale parallel web services on virtualized clouds. This paper presents TerrierTail, a hypervisor CPU scheduler whose primary goal is to trim the tail of the latency distribution of individual VMs in virtualized clouds. In TerrierTail, we have modified the network driver to identify vCPUs that are responsible for performing network IO processes. Leveraging this information, the TerrierTail scheduler mitigates the CPU access latencies of such vCPUs using novel scheduling policies, resulting in a higher and more predictable network IO performance and therefore lower tail latency. TerrierTail's gains come at no measurable negative impacts on other performance attributes (e.g., fairness) or on the performance of VMs running other types of workloads (e.g., CPU-intensive VMs). A prototype implementation of TerrierTail in the Xen hypervisor substantially outperforms the default Credit scheduler of Xen. For example, TerrierTail mitigates the tail latency of a Memcached server by up to 53% and an RPC server by up to 50% at 99.9th percentile.

1 November 2019 in Journal of Parallel and Distributed Computing
Verified
Journal Article
Closed access
EAEsmail Asyabi
Esmail Asyabi
ESErfan Sharafzadeh
Erfan Sharafzadeh
SSSeyedAlireza SanaeeKohroudi
SeyedAlireza SanaeeKohroudi
MSMohsen Sharifi
Mohsen Sharifi

5 May 2025
Verified
Conference Paper
Open access
SGSaeid Ghafouri
Saeid Ghafouri
KRKamran Razavi
Kamran Razavi
MSMehran Salmani
Mehran Salmani
ASAlireza Sanaee
Alireza Sanaee
TBTania Lorido Botran
Tania Lorido Botran
PJPooyan Jamshidi
Pooyan Jamshidi