IHIzzat El Hajj

Izzat El Hajj

*This is an algorithmically generated author record based on publicly available information.

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


Izzat El Hajj has a total of 51 co-authors. Here are the top co-authors by number of shared publications:


Latest Publications

  • Open Access

    Parallel Bidirectional A* Search for GPU-Accelerated Pathfinding

    by Hadi Al Khansa, Juan Gómez Luna, Amer Mouawad, Izzat El Hajj

  • Open Access

    Are We There Yet? Predicting if Executing Applications are Near Completion

    by Mohammad Sonji, Mohammed Baydoun, Safaa Diab, Amir Nassereldine, Pedro Bruel, Aditya Dhakal, Rolando Pablo Hong Enriquez, Gourav Rattihalli, Diman Zad Tootaghaj, Gallig Renaud, et al.

  • Open Access

    OASIS: Optimal Allocation Strategy for Inference Services in Cloud Environments

    by Viyom Mittal, Mohammed Baydoun, Alok Mishra, Pavana Prakash, Gourav Rattihalli, Aditya Dhakal, Eitan Frachtenberg, Izzat El Hajj, Michails Faloutsos, Dejan Milojicic

    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

    Variability-Guided Performance Optimization

    by Eitan Frachtenberg, Viyom Mittal, Mohammed Baydoun, Aditya Dhakal, Izzat El Hajj, Dejan Milojicic

    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.

  • Technology Predictions 2026

    by Christof Ebert, Izzat El Hajj, Eitan Frachtenberg, Albert Lysko, Dejan Milojicic, Roxana Saint Nom, Saurabh Sinha, Julio Toro

    IEEE Computer Society technology experts have unveiled 26 breakthrough technologies set to redefine industries and shape the future of our world for decades to come.


  • Faster Vertex Cover Algorithms on GPUs With Component-Aware Parallel Branching

    by Hussein Amro, Basel Fakhri, Amer E. Mouawad, Izzat El Hajj

    Algorithms for finding minimum or bounded vertex covers in graphs use a branch-and-reduce strategy, which involves exploring a highly imbalanced search tree. Prior GPU solutions assign different thread blocks to different sub-trees, while using a shared worklist to balance the load. However, these prior solutions do not scale to large and complex graphs because their unawareness of when the graph splits into components causes them to solve these components redundantly. Moreover, their high memory footprint limits the number of workers that can execute concurrently. We propose a novel GPU solution for vertex cover problems that detects when a graph splits into components and branches on the components independently. Although the need to aggregate the solutions of different components introduces non-tail-recursive branches which interfere with load balancing, we overcome this challenge by delegating the post-processing to the last descendant of each branch. We also reduce the memory footprint by reducing the graph and inducing a subgraph before exploring the search tree. Our solution substantially outperforms the state-of-the-art GPU solution, finishing in seconds when the state-of-the-art solution exceeds 6 hours. To the best of our knowledge, our work is the first to parallelize non-tail-recursive branching patterns on GPUs in a load balanced manner.


  • Low-latency control system for feedback experiments with optical-tweezer arrays

    by Amir H. Dadpour, Timur Khayrullin, Fouad Afiouni, Remy El Sabeh, Amer E. Mouawad, Izzat El Hajj, Alexandre Cooper


  • Efficient algorithms to solve atom reconfiguration problems. II. Assignment-rerouting-ordering algorithm

    by Remy El Sabeh, Jessica Bohm, Zhiqian Ding, Stephanie Maaz, Naomi Nishimura, Izzat El Hajj, Amer E. Mouawad, Alexandre Cooper

    Programmable arrays of optical traps enable the assembly of configurations of single atoms to perform controlled experiments on quantum many-body systems. Finding the sequence of control operations to transform an arbitrary configuration of atoms into a predetermined one requires solving an atom reconfiguration problem quickly and efficiently. A typical approach to solving atom reconfiguration problems is to use an assignment algorithm to determine which atoms to move to which traps. This approach results in control protocols that exactly minimize the number of displacement operations; however, this approach does not optimize for the number of displaced atoms or the number of times each atom is displaced, resulting in unnecessary control operations that increase the execution time and failure rate of the control protocol. In this work we propose the assignment-rerouting-ordering (ARO) algorithm to improve the performance of assignment-based algorithms in solving atom reconfiguration problems. The ARO algorithm uses an assignment subroutine to minimize the total distance traveled by all atoms, a rerouting subroutine to reduce the number of displaced atoms, and an ordering subroutine to guarantee that each atom is displaced at most once. The ordering subroutine relies on the existence of a partial ordering of moves that can be obtained using a polynomial-time algorithm that we introduce within the formal framework of graph theory. We numerically quantify the performance of the ARO algorithm in the presence and in the absence of loss and show that it outperforms the exact, approximation, and heuristic algorithms that we use as benchmarks. Our results are useful for assembling large configurations of atoms with high success probability and fast preparation time, as well as for designing and benchmarking novel atom reconfiguration algorithms.


  • Efficient algorithms to solve atom reconfiguration problems. I. Redistribution-reconfiguration algorithm

    by Barry Cimring, Remy El Sabeh, Marc Bacvanski, Stephanie Maaz, Izzat El Hajj, Naomi Nishimura, Amer E. Mouawad, Alexandre Cooper

    We propose the redistribution-reconfiguration (red-rec) algorithm to prepare large configurations of atoms using programmable arrays of optical traps. Red-rec exploits simple heuristics and exact subroutines to solve atom reconfiguration problems on grids. It admits a fast and efficient implementation suitable for real-time operation. We numerically quantify its performance using realistic physical parameters and operational constraints, in both the absence and presence of loss. Red-rec enables assembling large configurations of atoms with high mean success probability. Fast preparation times are achieved by harnessing parallel control operations that actuate multiple traps simultaneously. Faster preparation times are achieved by rejecting configurations of atoms containing fewer atoms than a given threshold. However, the number of traps required to prepare a compact-centered configuration of atoms on a grid with a probability of 0.5 scales as the 3/2 power of the number of desired atoms. This finding highlights some of the challenges associated with scaling up configurations of atoms beyond tens of thousands of atoms.