Shadi Ibrahim

Shadi Ibrahim

Auto-generated profile, based on publicly available information

Shadi Ibrahim

INRIA, Univ. Rennes, CNRS, IRISA, Rennes, France

Research Focus & Metrics

Academic Career Length

20Years (2007-Present)

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

Representative Publications

View All Publications
15 September 2023 in ACM Computing Surveys
Verified
Journal Article
Open access
JBJean Luca NMI Bez
Jean Luca NMI Bez
SBSuren Byna
Suren Byna
SIShadi Ibrahim
Shadi Ibrahim
The high-performance computing I/O stack has been complex due to multiple software layers, the inter-dependencies among these layers, and the different performance tuning options for each layer. In this complex stack, the definition of an “I/O access pattern” has been reappropriated to describe what an application is doing to write or read data from the perspective of different layers of the stack, often comprising a different set of features. It has become common to have to redefine what is meant when discussing a pattern in every new study, as no assumption can be made. This survey aims to propose a baseline taxonomy, harnessing the I/O community’s knowledge over the past 20 years. This definition can serve as a common ground for high-performance computing I/O researchers and developers to apply known I/O tuning strategies and design new strategies for improving I/O performance. We seek to summarize and bring a consensus to the multiple ways to describe a pattern based on common features already used by the community over the years.

25 May 2013 in Peer-to-Peer Networking and Applications
Verified
Journal Article
Closed access
PDF file
SIShadi Ibrahim
Shadi Ibrahim
HJHai Jin
Hai Jin
LLLu Lu
Lu Lu
BHBingsheng He
Bingsheng He
GAGabriel Antoniu
Gabriel Antoniu
SWSong Wu
Song Wu

25 November 2019 in IEEE Transactions on Parallel and Distributed Systems
Verified
Journal Article
Closed access
AZAmelie Chi Zhou
Amelie Chi Zhou
BSBingkun Shen
Bingkun Shen
YXYao Xiao
Yao Xiao
SIShadi Ibrahim
Shadi Ibrahim
BHBingsheng He
Bingsheng He
Graph processing is an emerging computation model for a wide range of applications and graph partitioning is important for optimizing the cost and performance of graph processing jobs. Recently, many graph applications store their data on geo-distributed datacenters (DCs) to provide services worldwide with low latency. This raises new challenges to existing graph partitioning methods, due to the multi-level heterogeneities in network bandwidth and communication prices in geo-distributed DCs. In this paper, we propose an efficient graph partitioning method named Geo-Cut, which takes both the cost and performance objectives into consideration for large graph processing in geo-distributed DCs.Geo-Cut adopts two optimization stages. First, we propose a cost-aware streaming heuristic and utilize the one-pass streaming graph partitioning method to quickly assign edges to different DCs while minimizing inter-DC data communication cost. Second, we propose two partition refinement heuristics which identify the performance bottlenecks of geo-distributed graph processing and refine the partitioning result obtained in the first stage to reduce the inter-DC data transfer time while satisfying the budget constraint. Geo-Cut can be also applied to partition dynamic graphs thanks to its lightweight runtime overhead. We evaluate the effectiveness and efficiency of Geo-Cut using real-world graphs with both real geo-distributed DCs and simulations. Evaluation results show that Geo-Cut can reduce the inter-DC data transfer time by up to 79% (42% as the median) and reduce the monetary cost by up to 75% (26% as the median) compared to state-of-the-art graph partitioning methods with a low overhead.

12 September 2019 in ACM Transactions on Modeling and Performance Evaluation of Computing Systems
Verified
Journal Article
Open access
PDF file
TPTien-Dat Phan
Tien-Dat Phan
GPGuillaume Pallez
Guillaume Pallez
SIShadi Ibrahim
Shadi Ibrahim
PRPadma Raghavan
Padma Raghavan
Big Data systems (e.g., Google MapReduce, Apache Hadoop, Apache Spark) rely increasingly on speculative execution to mask slow tasks, also known as stragglers, because a job’s execution time is dominated by the slowest task instance. Big Data systems typically identify stragglers and speculatively run copies of those tasks with the expectation that a copy may complete faster to shorten job execution times. There is a rich body of recent results on straggler mitigation in MapReduce. However, the majority of these do not consider the problem of accurately detecting stragglers. Instead, they adopt a particular straggler detection approach and then study its effectiveness in terms of performance, e.g., reduction in job completion time or higher efficiency, e.g., high resource utilization. In this article, we consider a complete framework for straggler detection and mitigation. We start with a set of metrics that can be used to characterize and detect stragglers including Precision, Recall, Detection Latency, Undetected Time, and Fake Positive. We then develop an architectural model by which these metrics can be linked to measures of performance including execution time and system energy overheads. We further conduct a series of experiments to demonstrate which metrics and approaches are more effective in detecting stragglers and are also predictive of effectiveness in terms of performance and energy efficiencies. For example, our results indicate that the default Hadoop straggler detector could be made more effective. In a certain case, Precision is low and only 55% of those detected are actual stragglers and the Recall, i.e., percent of actual detected stragglers, is also relatively low at 56%. For the same case, the hierarchical approach (i.e., a green-driven detector based on the default one) achieves a Precision of 99% and a Recall of 29%. This increase in Precision can be translated to achieve lower execution time and energy consumption, and thus higher performance and energy efficiency; compared to the default Hadoop mechanism, the energy consumption is reduced by almost 31%. These results demonstrate how our framework can offer useful insights and be applied in practical settings to characterize and design new straggler detection mechanisms for MapReduce systems.

1 July 2019
Verified
Conference Paper
Open access
SWSong Wu
Song Wu
DHDie Hu
Die Hu
SIShadi Ibrahim
Shadi Ibrahim
HJHai Jin
Hai Jin
Jiang XiaoJiang Xiao
Jiang Xiao
Haikun LiuHaikun Liu
Haikun Liu
Today, stream data applications represent the killer applications for Edge computing: placing computation close to the data source facilitates real-time analysis. Previous efforts have focused on introducing light-weight distributed stream processing (DSP) systems and dividing the computation between Edge servers and the clouds. Unfortunately, given the limited computation power of Edge servers, current efforts may fail in practice to achieve the desired latency of stream data applications. In this vision paper, we argue that by introducing FPGAs in Edge servers and integrating them into DSP systems, we might be able to realize stream data processing in Edge infrastructures. We demonstrate that through the design, implementation, and evaluation of F-Storm, an FPGA-accelerated and general-purpose distributed stream processing system on Edge servers. F-Storm integrates PCIe-based FPGAs into Edge-based stream processing systems and provides accelerators as a service for stream data applications. We evaluate F-Storm using different representative stream data applications. Our experiments show that compared to Storm, F-Storm reduces the latency by 36% and 75% for matrix multiplication and grep application. It also obtains 1.4x and 2.1x improvement for these two applications, respectively. We expect this work to accelerate progress in this domain.

1 August 2017
Verified
Book Chapter
Closed access
PDF file
TPTien-Dat Phan
Tien-Dat Phan
SIShadi Ibrahim
Shadi Ibrahim
AZAmelie Chi Zhou
Amelie Chi Zhou
GAGuillaume Aupy
Guillaume Aupy
GAGabriel Antoniu
Gabriel Antoniu