Claude Tadonki
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
Claude Tadonki has a total of 38 co-authors. Here are the top co-authors by number of shared publications:
- Mostapha Zbakh
Mohammed V University
3 shared publications - Laila Bouhouch
Mohammed V University in Rabat,National School of Computer science and Systems Analysis,Morocco
2 shared publications - Adilla Susungi
MINES ParisTech-PSL University, Centre de Recherche en Informatique, Fontainebleau Cedex, France
1 shared publication - Alan L. Nunes
Instituto de Computação Universidade Federal Fluminense (UFF) Niterói Brazil
1 shared publication - Alba Cristina Magalhaes Alves de Melo
Department of Computer Science, University of Brasilia, Campus Universitário Darcy Ribeiro, Brasilia 70910-900, Brazil
1 shared publication - Albert Cohen
Google, Paris, France
1 shared publication
Latest Publications
- 2 July 2026
- Published by Springer Nature
- p. 462-478
Experimental Evaluation and Analysis of Gradient Descent in Machine Learning
- 2 July 2026
- Published by Springer Nature
- p. 462-478
Experimental Evaluation and Analysis of Gradient Descent in Machine Learning
- 14 January 2026
- Published by Elsevier in Future Generation Computer Systems
- Vol. 179
Leveraging cutting-edge high performance computing for large-scale applications
- 14 January 2026
- Published by Elsevier in Future Generation Computer Systems
- Vol. 179
Leveraging cutting-edge high performance computing for large-scale applications
- Open Access
- 15 November 2025
- Published by Association for Computing Machinery (ACM)
- p. 2041-2050
EAS-Sim: A Framework and its Methodology for the Co-Design of Multi-Objective, Energy-Aware Schedulers for AI Clusters
- 15 November 2025
- Published by Association for Computing Machinery (ACM)
- p. 2041-2050
Open AccessEAS-Sim: A Framework and its Methodology for the Co-Design of Multi-Objective, Energy-Aware Schedulers for AI Clusters
- Open Access
- 25 June 2024
- Published by Elsevier in Computers & Geosciences
- Vol. 191
DeLIA: A Dependability Library for Iterative Applications applied to parallel geophysical problems
- 25 June 2024
- Published by Elsevier in Computers & Geosciences
- Vol. 191
Open AccessDeLIA: A Dependability Library for Iterative Applications applied to parallel geophysical problems
- 21 November 2023
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 1-9
A New Classification for Data Placement Techniques in Cloud Computing
The efficient management of data placement in cloud computing is of paramount importance, as it fundamentally influences the performance, cost-effectiveness, and execution time of workflows, including the seamless movement of data across diverse data centers. This paper contributes significantly to the global scientific community by introducing a novel classification framework for data placement techniques in the realm of cloud computing. This classification system categorizes these techniques based on their unique approaches to optimizing data placement, thus enhancing system performance. Furthermore, this work offers a valuable overview of existing data placement algorithms found in the extensive literature. This overview serves as a valuable resource for researchers and practitioners, facilitating a comprehensive comparison of the various algorithms in terms of their properties and objectives. Such insights can inform better decision-making in the selection of data placement strategies. In conclusion, this paper not only sheds light on the critical role of data placement in cloud computing but also addresses pertinent open issues in this domain. Its contributions are poised to shape the future of cloud computing research and practice. It is our hope that this work will inspire further research endeavors and pave the way for innovative solutions to the evolving challenges in data placement within cloud computing environments.
- 21 November 2023
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 1-9
A New Classification for Data Placement Techniques in Cloud Computing
The efficient management of data placement in cloud computing is of paramount importance, as it fundamentally influences the performance, cost-effectiveness, and execution time of workflows, including the seamless movement of data across diverse data centers. This paper contributes significantly to the global scientific community by introducing a novel classification framework for data placement techniques in the realm of cloud computing. This classification system categorizes these techniques based on their unique approaches to optimizing data placement, thus enhancing system performance. Furthermore, this work offers a valuable overview of existing data placement algorithms found in the extensive literature. This overview serves as a valuable resource for researchers and practitioners, facilitating a comprehensive comparison of the various algorithms in terms of their properties and objectives. Such insights can inform better decision-making in the selection of data placement strategies. In conclusion, this paper not only sheds light on the critical role of data placement in cloud computing but also addresses pertinent open issues in this domain. Its contributions are poised to shape the future of cloud computing research and practice. It is our hope that this work will inspire further research endeavors and pave the way for innovative solutions to the evolving challenges in data placement within cloud computing environments.
- Open Access
- 15 May 2023
- Published by MDPI AG in Information
- Vol. 14 (5) , 292
Online Task Scheduling of Big Data Applications in the Cloud Environment
The development of big data has generated data-intensive tasks that are usually time-consuming, with a high demand on cloud data centers for hosting big data applications. It becomes necessary to consider both data and task management to find the optimal resource allocation scheme, which is a challenging research issue. In this paper, we address the problem of online task scheduling combined with data migration and replication in order to reduce the overall response time as well as ensure that the available resources are efficiently used. We introduce a new scheduling technique, named Online Task Scheduling algorithm based on Data Migration and Data Replication (OTS-DMDR). The main objective is to efficiently assign online incoming tasks to the available servers while considering the access time of the required datasets and their replicas, the execution time of the task in different machines, and the computational power of each machine. The core idea is to achieve better data locality by performing an effective data migration while handling replicas. As a result, the overall response time of the online tasks is reduced, and the throughput is improved with enhanced machine resource utilization. To validate the performance of the proposed scheduling method, we run in-depth simulations with various scenarios and the results show that our proposed strategy performs better than the other existing approaches. In fact, it reduces the response time by 78% when compared to the First Come First Served scheduler (FCFS), by 58% compared to the Delay Scheduling, and by 46% compared to the technique of Li et al. Consequently, the present OTS-DMDR method is very effective and convenient for the problem of online task scheduling.
- 15 May 2023
- Published by MDPI AG in Information
- Vol. 14 (5) , 292
Open AccessOnline Task Scheduling of Big Data Applications in the Cloud Environment
The development of big data has generated data-intensive tasks that are usually time-consuming, with a high demand on cloud data centers for hosting big data applications. It becomes necessary to consider both data and task management to find the optimal resource allocation scheme, which is a challenging research issue. In this paper, we address the problem of online task scheduling combined with data migration and replication in order to reduce the overall response time as well as ensure that the available resources are efficiently used. We introduce a new scheduling technique, named Online Task Scheduling algorithm based on Data Migration and Data Replication (OTS-DMDR). The main objective is to efficiently assign online incoming tasks to the available servers while considering the access time of the required datasets and their replicas, the execution time of the task in different machines, and the computational power of each machine. The core idea is to achieve better data locality by performing an effective data migration while handling replicas. As a result, the overall response time of the online tasks is reduced, and the throughput is improved with enhanced machine resource utilization. To validate the performance of the proposed scheduling method, we run in-depth simulations with various scenarios and the results show that our proposed strategy performs better than the other existing approaches. In fact, it reduces the response time by 78% when compared to the First Come First Served scheduler (FCFS), by 58% compared to the Delay Scheduling, and by 46% compared to the technique of Li et al. Consequently, the present OTS-DMDR method is very effective and convenient for the problem of online task scheduling.
- 1 March 2023
- Published by Wiley in Concurrency and Computation: Practice and Experience
- Vol. 35 (18)
Optimizing computational costs of Spark for SARS‐CoV‐2 sequences comparisons on a commercial cloud
Summary: Cloud computing is currently one of the prime choices in the computing infrastructure landscape. In addition to advantages such as the pay‐per‐use bill model and resource elasticity, there are technical benefits regarding heterogeneity and large‐scale configuration. Alongside the classical need for performance, for example, time, space, and energy, there is an interest in the financial cost that might come from budget constraints. Based on scalability considerations and the pricing model of traditional public clouds, a reasonable optimization strategy output could be the most suitable configuration of virtual machines to run a specific workload. From the perspective of runtime and monetary cost optimizations, we provide the adaptation of a Hadoop applications execution cost model extracted from the literature aiming at Spark applications modeled with the MapReduce paradigm. We evaluate our optimizer model executing an improved version of the Diff Sequences Spark application to perform SARS‐CoV‐2 coronavirus pairwise sequence comparisons using the AWS EC2's virtual machine instances. The experimental results with our model outperformed 80% of the random resource selection scenarios. By only employing spot worker nodes exposed to revocation scenarios rather than on‐demand workers, we obtained an average monetary cost reduction of 35.66% with a slight runtime increase of 3.36%.
- 1 March 2023
- Published by Wiley in Concurrency and Computation: Practice and Experience
- Vol. 35 (18)
Optimizing computational costs of Spark for SARS‐CoV‐2 sequences comparisons on a commercial cloud
Summary: Cloud computing is currently one of the prime choices in the computing infrastructure landscape. In addition to advantages such as the pay‐per‐use bill model and resource elasticity, there are technical benefits regarding heterogeneity and large‐scale configuration. Alongside the classical need for performance, for example, time, space, and energy, there is an interest in the financial cost that might come from budget constraints. Based on scalability considerations and the pricing model of traditional public clouds, a reasonable optimization strategy output could be the most suitable configuration of virtual machines to run a specific workload. From the perspective of runtime and monetary cost optimizations, we provide the adaptation of a Hadoop applications execution cost model extracted from the literature aiming at Spark applications modeled with the MapReduce paradigm. We evaluate our optimizer model executing an improved version of the Diff Sequences Spark application to perform SARS‐CoV‐2 coronavirus pairwise sequence comparisons using the AWS EC2's virtual machine instances. The experimental results with our model outperformed 80% of the random resource selection scenarios. By only employing spot worker nodes exposed to revocation scenarios rather than on‐demand workers, we obtained an average monetary cost reduction of 35.66% with a slight runtime increase of 3.36%.
- 26 March 2021
- Published by Springer Nature
- p. 74-88
Using Performance Event Profiles to Deduce an Execution Model of MATLAB with Just-In-Time Compilation
- 26 March 2021
- Published by Springer Nature
- p. 74-88
Using Performance Event Profiles to Deduce an Execution Model of MATLAB with Just-In-Time Compilation