ASAbel Souza

Abel Souza

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

Current Organizations / Institutes

The organizations/institutes from the scholar's latest article


Abel Souza has a total of 49 co-authors. Here are the top co-authors by number of shared publications:


Latest Publications

  • Untangling the Carbon-Cost Tradeoffs and Stampede Effect Challenges in Cloud Computing

    by Walid A. Hanafy, Thanathorn Sukprasert, Abel Souza, David Irwin, Prashant Shenoy

    As society explores new computing applications, data centers have seen a sharp rise in capacity and energy use, driving up data centers’ carbon footprint and raising concerns about their sustainability. In response, efforts to reduce emissions now complement the traditional goals of cutting energy costs and boosting performance. Given the spatiotemporal variability of the grid carbon intensity, researchers are increasingly adopting workload shifting strategies to minimize the operational carbon footprint of cloud workloads. However, shifting from cost- and performance-centric operations to carbon-aware operations introduces performance penalties and cost overheads. Moreover, large-scale spatial and temporal shifts can cause stampede effects, with synchronized migration to the same low-carbon regions or times, thereby straining resources and creating imbalances. In this paper, we quantify the carbon-cost-performance trade-offs of carbon-aware scheduling and evaluate the risk of such stampede effects. We provide real-world examples illustrating these tradeoffs for application and cloud providers. Lastly, we offer practical insights to help mitigate these challenges and guide sustainable scheduling decisions.


  • Open Access

    CarbonEdge: Leveraging Mesoscale Spatial Carbon-Intensity Variations for Low Carbon Edge Computing

    by Li Wu, Walid A. Hanafy, Abel Souza, Khai Nguyen, Jan Harkes, David Irwin, Mahadev Satyanarayanan, Prashant Shenoy


  • Open Access

    TailClipper: Reducing Tail Response Time of Distributed Services Through System-Wide Scheduling

    by Nathan Ng, Abel Souza, Ahmed Ali-Eldin, David Irwin, Don Towsley, Prashant Shenoy

    Reducing tail latency has become a crucial issue for optimizing the performance of online cloud services and distributed applications. In distributed applications, there are many causes of high end-to-end tail latency, including operating system delays, request re-ordering due to fan-out/fanin, and network congestion. Although recent research has focused on reducing tail latency for individual application components, such as by replicating requests and scheduling, in this paper, we argue for a holistic approach for reducing the end-to-end tail latency across application components. We propose TailClipper, a distributed scheduler that tags each arriving request with an arrival timestamp, and propagates it across the microservices' call chain. TailClipper then uses arrival timestamps to implement an oldest request first scheduler that combines global first-come first serve with a limited form of processor sharing to reduce end-to-end tail latency. In doing so, TailClipper can counter the performance degradation caused by request reordering in multi-tiered and microservices-based applications. We implement TailClipper as a userspace Linux scheduler and evaluate it using cloud workload traces and a real-world microservices application. Compared to state-of-the-art schedulers, our experiments reveal that TailClipper improves the 99th percentile response time by up to 81%, while also improving the mean response time and the system throughput by up to 54% and 29% respectively under high loads.

  • Open Access

    Examining The Adoption of Electromobility Concepts Across Social Contexts For Energy Transition

    by Julia Köhlke, Adam Lechowicz, Oluwole Fabikun, Noman Bashir, Abel Souza, Prashant Shenoy, Sebastian Lehnhoff

    The impact of mobility decisions not only shapes urban traffic patterns and planning, but also its associated effects, such as greenhouse gas (GHG) emissions. Although e-bike sharing is not a new concept, it has shown significant strides in technological progress in recent years due to the ongoing process of digitalization, specifically towards decarbonization effects. Past studies have shown that e-bike sharing shows a potential as a fast, mobile, and environmentally friendly alternative to cars and public transport. Although e-bikes represent a viable alternative to traditional means of transportation, there is a lack of quantification in understanding the impact and acceptance of e-bikes towards social contexts as well as its adoption as a type of sharing concept. In this paper, we employ the Unified Theory of Acceptance and Use of Technology (UTAUT) model as an analytical framework to discern the use and acceptance of e-bike sharing as an emerging technological concept across different cities and social contexts. Our findings reveal that the e-bike sharing system's utilization is skewed towards a small percentage of "frequent users", and overall usage is biased towards younger, more-educated, and higher-income populations who live in bike-friendly areas. Our work contributes to the feasibility of embedding the e-bike sharing concept in the scope of the energy transition.

  • Open Access

    A HPC Co-Scheduler with Reinforcement Learning

    by Abel Souza, Kristiaan Pelckmans, Johan Tordsson

    Although High Performance Computing (HPC) users understand basic resource requirements such as the number of CPUs and memory limits, internal infrastructural utilization data is exclusively leveraged by cluster operators, who use it to configure batch schedulers. This task is challenging and increasingly complex due to ever larger cluster scales and heterogeneity of modern scientific workflows. As a result, HPC systems achieve low utilization with long job completion times (makespans). To tackle these challenges, we propose a co-scheduling algorithm based on an adaptive reinforcement learning algorithm, where application profiling is combined with cluster monitoring. The resulting cluster scheduler matches resource utilization to application performance in a fine-grained manner (i.e., operating system level). As opposed to nominal allocations, we apply decision trees to model applications' actual resource usage, which are used to estimate how much resource capacity from one allocation can be co-allocated to additional applications. Our algorithm learns from incorrect co-scheduling decisions and adapts from changing environment conditions, and evaluates when such changes cause resource contention that impacts quality of service metrics such as jobs slowdowns. We integrate our algorithm in an HPC resource manager that combines Slurm and Mesos for job scheduling and co-allocation, respectively. Our experimental evaluation performed in a dedicated cluster executing a mix of four real different scientific workflows demonstrates improvements on cluster utilization of up to 51% even in high load scenarios, with 55% average queue makespan reductions under low loads.

  • Open Access

    Empowering User-Centered Carbon Management: Bridging Individual Preferences and Sociotechnical Advancements

    by Abel Souza, Mihir Shenoy, Camellia Zakaria

    There is a widespread agreement that society must swiftly decrease and ultimately eliminate its carbon emissions to mitigate climate change, a profound threat to the Earth’s ecosystem and humanity’s existence. Contrary to intuition, the core issue is not the escalation of energy consumption itself, but the carbon footprint resulting from that energy usage and its environmental consequences. As such, recent initiatives aimed at decarbonization in fields such as computing, construction, and transportation leverage the flexibility of energy demand to effectively diminish its associated carbon footprint. Similarly, consumer habits and routine changes have been argued to significantly achieve large energy savings. However, most approaches mainly use financial incentives, which alone cannot be employed as the primary strategy with results pointing to individuals reverting habits due to low rewards and considerable impacts into their routines. In a world where automation spans various applications, Artificial Intelligence (AI) can potentially assist consumers in reshaping daily behavior to lower carbon footprint, all while mitigating inconvenient factors associated with routine changes. In this paper, we propose a vision of using the modeling of sustainability efforts with human-in-the-loop considerations. We begin with understanding what incentivizes behavioral change among consumers. Then, we describe, illustrate, and list the challenges in using automation technologies with recommendation systems to sustain consumer engagement in day-to-day decarbonization efforts.


  • Open Access

    CASPER: Carbon-Aware Scheduling and Provisioning for Distributed Web Services

    by Abel Souza, Shruti Jasoria, Basundhara Chakrabarty, Alexander Bridgwater, Axel Lundberg, Filip Skogh, Ahmed Ali-Eldin, David Irwin, Prashant Shenoy

    There has been a significant societal push towards sustainable practices, including in computing. Modern interactive workloads such as geo-distributed web-services exhibit various spatiotemporal and performance flexibility, enabling the possibility to adapt the location, time, and intensity of processing to align with the availability of renewable and low-carbon energy. An example is a web application hosted across multiple cloud regions, each with varying carbon intensity based on their local electricity mix. Distributed load-balancing enables the exploitation of low-carbon energy through load migration across regions, reducing web applications carbon footprint. In this paper, we present CASPER, a carbon-aware scheduling and provisioning system that primarily minimizes the carbon footprint of distributed web services while also respecting their Service Level Objectives (SLO). We formulate CASPER as an multi-objective optimization problem that considers both the variable carbon intensity and latency constraints of the network. Our evaluation reveals the significant potential of CASPER in achieving substantial reductions in carbon emissions. Compared to baseline methods, CASPER demonstrates improvements of up to 70% with no latency performance degradation.


  • Open Access

    Ecovisor: A Virtual Energy System for Carbon-Efficient Applications

    by Abel Souza, Noman Bashir, Jorge Murillo, Walid Hanafy, Qianlin Liang, David Irwin, Prashant Shenoy

    Cloud platforms' rapid growth is raising significant concerns about their carbon emissions. To reduce emissions, future cloud platforms will need to increase their reliance on renewable energy sources, such as solar and wind, which have zero emissions but are highly unreliable. Unfortunately, today's energy systems effectively mask this unreliability in hardware, which prevents applications from optimizing their carbon-efficiency, or work done per kilogram of carbon emitted. To address this problem, we design an "ecovisor", which virtualizes the energy system and exposes software-defined control of it to applications. An ecovisor enables each application to handle clean energy's unreliability in software based on its own specific requirements. We implement a small-scale ecovisor prototype that virtualizes a physical energy system to enable software-based application-level i) visibility into variable grid carbon-intensity and renewable generation and ii) control of server power usage and battery charging/discharging. We evaluate the ecovisor approach by showing how multiple applications can concurrently exercise their virtual energy system in different ways to better optimize carbon-efficiency based on their specific requirements compared to a general system-wide policy.

  • Network synthesis for tactical environments: scenario, challenges, and opportunities

    by Tzanis Anevlavis, Jonathan Bunton, Jared Coleman, Mine Gokce Dogan, Eugenio Grippo, Abel Souza, Christina Fragouli, Bhaskar Krishnamachari, Matthew Maness, Karl Olson, et al.

    We develop a network synthesis scenario, which is built around a concrete perimeter surveillance application, yet we believe captures a number of the challenges and requirements that are common to other tactical communication and computational network applications. The proposed scenario addresses the problem of binary population identification within a perimeter: our goal is to synthesize a sensing and computing network that classifies people moving within a given perimeter into one of two categories (e.g., friend or foe). We discuss several open challenges that we organize across the following clusters: sensor placement, communication network provisioning and optimization, computational task placement, dynamic re-synthesis and resilience under adversarial settings. We also briefly discuss approaches that attempt to address such challenges.

  • A HPC Co-scheduler with Reinforcement Learning

    by Abel Souza, Kristiaan Pelckmans, Johan Tordsson