Mohammed Baydoun
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Mohammed Baydoun has a total of 28 co-authors. Here are the top co-authors by number of shared publications:
- Aditya Dhakal
Hewlett Packard Enterprise, Milpitas, USA
3 shared publications - Dejan Milojicic
Hewlett Packard Enterprise, Milpitas, USA
3 shared publications - Eitan Frachtenberg
Hewlett Packard Enterprise Co. Labs, Palo Alto, CA, USA
3 shared publications - Izzat El Hajj
American University of Beirut, Beirut, Lebanon
3 shared publications - Gourav Rattihalli
Hewlett Packard Enterprise, Milpitas, USA
2 shared publications - Viyom Mittal
Hewlett Packard Labs, Milpitas, California, USA
2 shared publications
Latest Publications
- Open Access
- 3 May 2026
- Published by Association for Computing Machinery (ACM)
- p. 364-377
Are We There Yet? Predicting if Executing Applications are Near Completion
- 3 May 2026
- Published by Association for Computing Machinery (ACM)
- p. 364-377
Open AccessAre We There Yet? Predicting if Executing Applications are Near Completion
- Open Access
- 3 May 2026
- Published by Association for Computing Machinery (ACM)
- p. 277-286
OASIS: Optimal Allocation Strategy for Inference Services in Cloud Environments
Provisioning language models as inference services can be significantly challenging to cloud providers because of the need to balance service-level objectives (SLOs) with capital and operational costs. The heterogeneous nature of user queries, combined with temporal variations in workload patterns and the high energy consumption of GPUs warrants an intelligent resource-allocation strategy. We present OASIS (Optimal Allocation Strategy for Inference Services), a comprehensive methodology that combines static and dynamic optimizations to provision inference services efficiently. OASIS employs a two-phase approach: (1) pre-deployment profiling to determine optimal parameter configurations for different query types across various hardware options, and (2) run-time query routing and dynamic provisioning based on observed workload patterns. We evaluate OASIS using real-world BurstGPT traces on NVIDIA A100 and H100 GPUs. Our results show that: (1) GPU frequency scaling from 1320 MHz to 855 MHz reduces power by 39% with only 7% throughput loss; (2) query type classification reveals long-input-short-output workloads achieve 2.1× higher throughput than short-input-long-output; (3) MIG-based multi-tenancy achieves 42-43% power reduction when running two models simultaneously; and (4) runtime adaptation on real campus traces achieves statistically significant 12.4% power reduction while maintaining SLO compliance and identical throughput.
- 3 May 2026
- Published by Association for Computing Machinery (ACM)
- p. 277-286
Open AccessOASIS: Optimal Allocation Strategy for Inference Services in Cloud Environments
Provisioning language models as inference services can be significantly challenging to cloud providers because of the need to balance service-level objectives (SLOs) with capital and operational costs. The heterogeneous nature of user queries, combined with temporal variations in workload patterns and the high energy consumption of GPUs warrants an intelligent resource-allocation strategy. We present OASIS (Optimal Allocation Strategy for Inference Services), a comprehensive methodology that combines static and dynamic optimizations to provision inference services efficiently. OASIS employs a two-phase approach: (1) pre-deployment profiling to determine optimal parameter configurations for different query types across various hardware options, and (2) run-time query routing and dynamic provisioning based on observed workload patterns. We evaluate OASIS using real-world BurstGPT traces on NVIDIA A100 and H100 GPUs. Our results show that: (1) GPU frequency scaling from 1320 MHz to 855 MHz reduces power by 39% with only 7% throughput loss; (2) query type classification reveals long-input-short-output workloads achieve 2.1× higher throughput than short-input-long-output; (3) MIG-based multi-tenancy achieves 42-43% power reduction when running two models simultaneously; and (4) runtime adaptation on real campus traces achieves statistically significant 12.4% power reduction while maintaining SLO compliance and identical throughput.
- Open Access
- 3 May 2026
- Published by Association for Computing Machinery (ACM)
- p. 192-207
Variability-Guided Performance Optimization
The past few decades have seen software and hardware growing more heterogeneous and layered in abstractions. This trend produced many benefits for hiding complexity and increasing efficiency and modularity. But it also makes reasoning about performance and identifying its underlying factors more challenging because of the presence of performance variability. Moreover, performance variability can prevent synchronous applications from scaling and server applications from meeting service-level agreements. In this paper, we present a variability-guided optimization (VGO) workflow that leverages information in performance distributions to optimize performance, and more importantly, to reduce performance variability. It works by uncovering software, hardware, and compiler factors associated with specific aspects of variability and then suggesting measures for reducing it. Our experimental evaluation on a set of CPU and GPU benchmarks and applications shows that our tool successfully reduces the standard deviation and coefficient of variation of application run times by 0.374× and 0.444×, while also reducing mean run time by 0.843×. This technique enables tuning applications and their environments, improving their performance and predictability.
- 3 May 2026
- Published by Association for Computing Machinery (ACM)
- p. 192-207
Open AccessVariability-Guided Performance Optimization
The past few decades have seen software and hardware growing more heterogeneous and layered in abstractions. This trend produced many benefits for hiding complexity and increasing efficiency and modularity. But it also makes reasoning about performance and identifying its underlying factors more challenging because of the presence of performance variability. Moreover, performance variability can prevent synchronous applications from scaling and server applications from meeting service-level agreements. In this paper, we present a variability-guided optimization (VGO) workflow that leverages information in performance distributions to optimize performance, and more importantly, to reduce performance variability. It works by uncovering software, hardware, and compiler factors associated with specific aspects of variability and then suggesting measures for reducing it. Our experimental evaluation on a set of CPU and GPU benchmarks and applications shows that our tool successfully reduces the standard deviation and coefficient of variation of application run times by 0.374× and 0.444×, while also reducing mean run time by 0.843×. This technique enables tuning applications and their environments, improving their performance and predictability.
- 22 May 2018
- Published by Springer Nature in The Journal of Supercomputing
- Vol. 74 (8) , 3975-3998
CPU and GPU parallelized kernel K-means
- 22 May 2018
- Published by Springer Nature in The Journal of Supercomputing
- Vol. 74 (8) , 3975-3998
CPU and GPU parallelized kernel K-means
- 1 January 2018
- Published by Inderscience Publishers in International Journal of High Performance Computing and Networking
- Vol. 11 (4) , 261
Towards distributed acceleration of image processing applications using reconfigurable active SSD clusters: a case study of seismic data analysis
International publishers of academic, scientific and professional journals since 1979.
- 1 January 2018
- Published by Inderscience Publishers in International Journal of High Performance Computing and Networking
- Vol. 11 (4) , 261
Towards distributed acceleration of image processing applications using reconfigurable active SSD clusters: a case study of seismic data analysis
International publishers of academic, scientific and professional journals since 1979.
- Open Access
- 22 May 2014
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Access
- Vol. 2, 485-499
Enhancing Stereo Matching With Classification
This paper presents a novel approach that employs classification to enhance the accuracy of the stereo matching problem. First, the images are treated in order to improve their pixel to pixel correspondence and reduce illumination differences. After that, stereo matching is addressed using different methods with emphasis on local ones like the sum of absolute distances and normalized cross correlation. Other state-of-the-art approaches are also considered. Then, and for every pixel, different features are computed from the input stereo image and the initially found depth map. Afterward, boosting and neural networks, as classification methods, are used to handle occlusion and enhance stereo matching by finding the erroneous disparity values. These values are then corrected through a completion stage. The accuracy of the proposed implementation improves on the problem in an efficient manner. A timing analysis of the method is provided to validate the real time performance. This paper further clarifies some of the possible developments based on various discussions.
- 22 May 2014
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Access
- Vol. 2, 485-499
Open AccessEnhancing Stereo Matching With Classification
This paper presents a novel approach that employs classification to enhance the accuracy of the stereo matching problem. First, the images are treated in order to improve their pixel to pixel correspondence and reduce illumination differences. After that, stereo matching is addressed using different methods with emphasis on local ones like the sum of absolute distances and normalized cross correlation. Other state-of-the-art approaches are also considered. Then, and for every pixel, different features are computed from the input stereo image and the initially found depth map. Afterward, boosting and neural networks, as classification methods, are used to handle occlusion and enhance stereo matching by finding the erroneous disparity values. These values are then corrected through a completion stage. The accuracy of the proposed implementation improves on the problem in an efficient manner. A timing analysis of the method is provided to validate the real time performance. This paper further clarifies some of the possible developments based on various discussions.