Alireza Sanaee
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Previous Organizations / Institutes
The organizations / institutes from the scholar's other articles in the past ten years
Research Subjects
Alireza Sanaee has a total of 28 co-authors. Here are the top co-authors by number of shared publications:
- Mohsen Sharifi
School of Computer Engineering, Iran University of Science and Technology, Tehran, Iran
4 shared publications - Gianni Antichi
Politecnico di Milano, Milan, Italy
3 shared publications - Erfan Sharafzadeh
Johns Hopkins University, Baltimore, USA
2 shared publications - Esmail Asyabi
Boston University
2 shared publications - Joseph Doyle
Queen Mary University of London, London, United Kingdom
2 shared publications - Kamran Razavi
Technical University of Darmstadt, Darmstadt, Germany
2 shared publications
Latest Publications
- 12 June 2026
- Published by Springer Nature in SN Computer Science
- Vol. 7 (5)
Phoenix - A Novel Technique for Performance-Aware Orchestration of Thread and Page Table Placement in NUMA Systems
- 12 June 2026
- Published by Springer Nature in SN Computer Science
- Vol. 7 (5)
Phoenix - A Novel Technique for Performance-Aware Orchestration of Thread and Page Table Placement in NUMA Systems
- Open Access
- 22 March 2026
- Published by Association for Computing Machinery (ACM)
- p. 679-696
Enabling Fast Networking in the Public Cloud
- 22 March 2026
- Published by Association for Computing Machinery (ACM)
- p. 679-696
Open AccessEnabling Fast Networking in the Public Cloud
- Open Access
- 5 May 2025
- Published by Association for Computing Machinery (ACM)
- p. 2-3
IPA: Inference Pipeline Adaptation to Achieve High Accuracy and Cost-Efficiency
- 5 May 2025
- Published by Association for Computing Machinery (ACM)
- p. 2-3
Open AccessIPA: Inference Pipeline Adaptation to Achieve High Accuracy and Cost-Efficiency
- Open Access
- 8 May 2023
- Published by Association for Computing Machinery (ACM)
- p. 78-86
Reconciling High Accuracy, Cost-Efficiency, and Low Latency of Inference Serving Systems
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).
- 8 May 2023
- Published by Association for Computing Machinery (ACM)
- p. 78-86
Open AccessReconciling High Accuracy, Cost-Efficiency, and Low Latency of Inference Serving Systems
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).
- Open Access
- 22 February 2022
- Published by Association for Computing Machinery (ACM)
- p. 1148-1164
Domain specific run time optimization for software data planes
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.
- 22 February 2022
- Published by Association for Computing Machinery (ACM)
- p. 1148-1164
Open AccessDomain specific run time optimization for software data planes
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.
- 1 November 2019
- Published by Elsevier in Journal of Parallel and Distributed Computing
- Vol. 133, 232-243
CTS: An operating system CPU scheduler to mitigate tail latency for latency-sensitive multi-threaded applications
- 1 November 2019
- Published by Elsevier in Journal of Parallel and Distributed Computing
- Vol. 133, 232-243
CTS: An operating system CPU scheduler to mitigate tail latency for latency-sensitive multi-threaded applications
- Open Access
- 11 October 2018
- Published by Association for Computing Machinery (ACM)
- p. 1-4
Experimental validation of the suitability of virtualization-based replication for fault tolerance in real-time control of electric grids
- 11 October 2018
- Published by Association for Computing Machinery (ACM)
- p. 1-4
Open AccessExperimental validation of the suitability of virtualization-based replication for fault tolerance in real-time control of electric grids
- 16 April 2018
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Parallel and Distributed Systems
- Vol. 29 (10) , 2346-2359
TerrierTail: Mitigating Tail Latency of Cloud Virtual Machines
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.
- 16 April 2018
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Parallel and Distributed Systems
- Vol. 29 (10) , 2346-2359
TerrierTail: Mitigating Tail Latency of Cloud Virtual Machines
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.