Didier EL BAZ | LAAS-CNRS (original) (raw)

Papers by Didier EL BAZ

Research paper thumbnail of GPU based parallel genetic algorithm for solving an energy efficient dynamic flexible flow shop scheduling problem

Journal of Parallel and Distributed Computing, 2019

Due to new government legislation, customers' environmental concerns and continuously rising cost... more Due to new government legislation, customers' environmental concerns and continuously rising cost of energy, energy efficiency is becoming an essential parameter of industrial manufacturing processes in recent years. Most efforts considering energy issues in scheduling problems have focused on static scheduling. But in fact, scheduling problems are dynamic in the real world with uncertain new arrival jobs after the execution time. This paper proposes a dynamic energy efficient flexible flow shop scheduling model using peak power value with the consideration of new arrival jobs. As the problem is strongly NP-hard, a priority based hybrid parallel Genetic Algorithm with a predictive reactive complete rescheduling approach is developed. In order to achieve a speedup to meet the short response in the dynamic environment, the proposed method is designed to be highly consistent with NVIDIA CUDA software model. Finally, numerical experiments are conducted and show that our approach can not only achieve better performance than the traditional static approach, but also gain competitive results by reducing the time requirements dramatically.

Research paper thumbnail of Keynote speech : Towards using computing accelerators like GPUs and MIC for solving real world problems into operational conditions

Research paper thumbnail of Parallel Monte-Carlo Simulations on GPU and Xeon Phi for Stratospheric Balloon Envelope Drift Descent Analysis

2016 Intl IEEE Conferences on Ubiquitous Intelligence & Computing, Advanced and Trusted Computing, Scalable Computing and Communications, Cloud and Big Data Computing, Internet of People, and Smart World Congress (UIC/ATC/ScalCom/CBDCom/IoP/SmartWorld), Jul 1, 2016

HAL is a multidisciplinary open access archive for the deposit and dissemination of scientific re... more HAL is a multidisciplinary open access archive for the deposit and dissemination of scientific research documents, whether they are published or not. The documents may come from teaching and research institutions in France or abroad, or from public or private research centers. L'archive ouverte pluridisciplinaire HAL, est destinée au dépôt et à la diffusion de documents scientifiques de niveau recherche, publiés ou non, émanant des établissements d'enseignement et de recherche français ou étrangers, des laboratoires publics ou privés.

Research paper thumbnail of Smart systems, the fourth industrial revolution and new challenges in distributed computing

Smart systems and the smart world concept are addressed in the framework of the fourth industrial... more Smart systems and the smart world concept are addressed in the framework of the fourth industrial revolution. New challenges in distributed autonomous robots and computing are considered. An illustration of a new kind of smart and reconfigurable distributed modular robot system is given. A prototype is also presented as well as the associated distributed algorithm.

Research paper thumbnail of Proceedings of the 13th IEEE International Conference on Ubiquitous Intelligence and Computing, 13th IEEE International Conference on Advanced and Trusted Computing, 16 IEEE International Conference on Scalable Computing and Communications, IEEE International Conference on Cloud and Big Data Comp...

Research paper thumbnail of Workshop 9: PDCO Parallel / Distributed Combinatorics and Optimization

2020 IEEE International Parallel and Distributed Processing Symposium Workshops (IPDPSW), 2020

The IEEE Workshop on Parallel / Distributed Combinatorics and Optimization aims at providing a fo... more The IEEE Workshop on Parallel / Distributed Combinatorics and Optimization aims at providing a forum for scientific researchers and engineers on recent advances in the field of parallel or distributed computing for difficult combinatorial optimization problems, like 0–1 multidimensional knapsack problems, cutting stock problems, scheduling problems, large scale linear programming problems, nonlinear optimization problems and global optimization problems. Emphasis is placed on new techniques for the solution of these difficult problems like cooperative methods for integer programming problems. Techniques based on metaheuristics and nature-inspired paradigms are considered. Aspects related to Combinatorial Scientific Computing (CSC) are considered. In particular, we solicit submissions of original manuscripts on sparse matrix computations, graph algorithm and original parallel or distributed algorithms. The use of new approaches in parallel and distributed computing like GPU, MIC, FPGA, volunteer computing are considered. Application to cloud computing, planning, logistics, manufacturing, finance, telecommunications and computational biology are considered.

Research paper thumbnail of Correlation of security events based on the analysis of structures of event types

2017 9th IEEE International Conference on Intelligent Data Acquisition and Advanced Computing Systems: Technology and Applications (IDAACS), 2017

HAL is a multidisciplinary open access archive for the deposit and dissemination of scientific re... more HAL is a multidisciplinary open access archive for the deposit and dissemination of scientific research documents, whether they are published or not. The documents may come from teaching and research institutions in France or abroad, or from public or private research centers. L'archive ouverte pluridisciplinaire HAL, est destinée au dépôt et à la diffusion de documents scientifiques de niveau recherche, publiés ou non, émanant des établissements d'enseignement et de recherche français ou étrangers, des laboratoires publics ou privés.

Research paper thumbnail of The Tung Nguyen

Un environnement pour le calcul intensif pair à pair

Research paper thumbnail of Heterogeneous Computing and Multi-Clustering Support Via Peer-To-Peer HPC

2018 26th Euromicro International Conference on Parallel, Distributed and Network-based Processing (PDP), 2018

This paper aims at presenting Peer-To-Peer HPC a decentralized environment that facilitates the u... more This paper aims at presenting Peer-To-Peer HPC a decentralized environment that facilitates the use of heterogeneous multi-cluster platform for loosely synchronous applications. The goal is to exploit all the computing resources (all the available cores of computing nodes) as well as all networks, e.g., Ethernet, Infiniband and Myrinet. Peer-To-Peer HPC functionality relies on a reconfigurable multi network protocol RMNP for controlling multiple network adapters and on OpenMP for the exploitation of all the available cores of computing nodes. We report on efficiency obtained with Grid5000 testbed by combining synchronous and asynchronous iterative schemes of computation with Peer-To-Peer HPC. The experimental results show that our environment scales well.

Research paper thumbnail of Proceedings of the 2015 IEEE 18th International Conference on Computational Science and Engineering

Research paper thumbnail of CHAPTER 10 GPU computing appliedto linear and mixed-integerprogramming

Tesla NVIDIA computing accelerators are currently based on Kepler and Maxwell architectures. The ... more Tesla NVIDIA computing accelerators are currently based on Kepler and Maxwell architectures. The recent versions of Compute Unified Device Architecture (CUDA), such as CUDA 7.0, coupled with the Kepler and Maxwell architectures facilitate the dynamic use of GPUs. Moreover, data transfers can now happen via high-speed network directly from any GPU memory to any other GPU memory in any other cluster without involving the assistance of the CPU. At present efforts are placed on maximizing the GPU resources and fast data exchanges between host and device. In 2016 the PASCAL architecture should feature more memory, 1 TB/s memory bandwith, and twice as many flops as Maxwell. NVLink technology will also permit data to move 5–10 times faster between GPUs and CPUs than with current PCI-Express, making GPU computing accelerators very efficient devices for HPC. Looking at the GPU computing accelerators previously released (some of which are presented in Table 1, which also summarizes the charac...

Research paper thumbnail of Acceleration of a CUDA-Based Hybrid Genetic Algorithm and its Application to a Flexible Flow Shop Scheduling Problem

2018 19th IEEE/ACIS International Conference on Software Engineering, Artificial Intelligence, Networking and Parallel/Distributed Computing (SNPD), 2018

Genetic Algorithms are commonly used to generate high-quality solutions to combinational optimiza... more Genetic Algorithms are commonly used to generate high-quality solutions to combinational optimization problems. However, the execution time can become a limiting factor for large and complex problems. In this paper, we propose a parallel Genetic Algorithm consisting of an island model at the upper level and a fine-grained model at the lower level. It is designed to be highly consistent with the CUDA framework to get the maximum speedup without compromising to solutions' quality. As several parameters control the performance of the hybrid method, we test them by a flexible flow shop scheduling problem and analyze their influence. Finally, numerical experiments show that our approach cannot only obtain competitive results but also reduces execution time by setting a medium size selection diameter, a relatively large island size and a wide range size migration interval.

Research paper thumbnail of Enabling the Social Internet of Things and Social Cloud

IEEE Cloud Computing, 2015

Social Internet of Things are changing what social patterns can be, and will bring unprecedented ... more Social Internet of Things are changing what social patterns can be, and will bring unprecedented online and offline social experiences. Social cloud is an improvement over social network in order to cooperatively provide computing facilities through social interactions. Both of these two field needs more research efforts to have a generic or unified supporting architecture, in order to integrate with various involved technologies. These two paradigms are both related to Social Networks, Cloud Computing, and Internet of Things. Therefore, we have reasons to believe that they have many potentials to support each other, and we predict that the two will be merged in one way or another.

Research paper thumbnail of D. El Baz, G. Authie, Distributed algorithms for optimal routing in a packet-switched computer network ; shortest path and non linear flow problems, First International Workshop on Methodologies and Application of Complex System Theory, Le Caire, Novembre 15-17, 1983

Research paper thumbnail of D. El Baz, Etude d’algorithmes itératifs de calcul parallèle. Application à la résolution distribuée du problème du routage optimal dans un réseau maillé à commutation de paquets. Thèse de Docteur Ingénieur de l’INSA de Toulouse, soutenue le 12 Janvier 1984 au LAAS du CNRS. Rapport LAAS 2985

Research paper thumbnail of M. Jarraya, D. El Baz, Asynchronous iterations for the solution of Markov systems, in Proceedings of the Third International Conference on the Numerical Solution of Markov Chains, NSMC’99, B. Plateau, W. Stewart, Manuel Silva, editors, Prenzas Universitaria de Zaragoza, Saragosse, Espagne, Septem...

M. Jarraya, D. El Baz, Asynchronous iterations for the solution of Markov systems, in Proceedings of the Third International Conference on the Numerical Solution of Markov Chains, NSMC’99, B. Plateau, W. Stewart, Manuel Silva, editors, Prenzas Universitaria de Zaragoza, Saragosse, Espagne, Septem...

Research paper thumbnail of M. Elkihel, D. El Baz, An efficient dynamic programming parallel algorithm for the 0-1 knapsack problem, Proceedings of the Parallel Computing Conference, ParCo 2001, Naples, Italy, 4-7 September 2001, in Advances in Parallel Computing, Elsevier Science B.V., North Holland, 2002, p. 298-305

M. Elkihel, D. El Baz, An efficient dynamic programming parallel algorithm for the 0-1 knapsack problem, Proceedings of the Parallel Computing Conference, ParCo 2001, Naples, Italy, 4-7 September 2001, in Advances in Parallel Computing, Elsevier Science B.V., North Holland, 2002, p. 298-305

Research paper thumbnail of D. El Baz, L’Internet du futur au service du calcul intensif, in Le calcul intensif : technologie clé pour le futur, Les Cahiers de l’ANR N° 3, Janvier 2010, p. 40

Research paper thumbnail of A dynamic programming method with dominance technique for the knapsack sharing problem

2009 International Conference on Computers & Industrial Engineering, 2009

In this paper, we propose an original method to solve exactly the knapsack sharing problem (KSP) ... more In this paper, we propose an original method to solve exactly the knapsack sharing problem (KSP) by using a dynamic programming with dominance technique. The original problem (KSP) is decomposed in a set of knapsack problems. Our method is tested on uncorrelated and correlated instances from the literature. Computational experiences show that our method is able to find an optimal solution of large instances within reasonable computing time.

Research paper thumbnail of D. El Baz, Calcul Intensif Pair à pair, Colloque STIC de l’ANR, Lyon, 4-6 Janvier 2012

Research paper thumbnail of GPU based parallel genetic algorithm for solving an energy efficient dynamic flexible flow shop scheduling problem

Journal of Parallel and Distributed Computing, 2019

Due to new government legislation, customers' environmental concerns and continuously rising cost... more Due to new government legislation, customers' environmental concerns and continuously rising cost of energy, energy efficiency is becoming an essential parameter of industrial manufacturing processes in recent years. Most efforts considering energy issues in scheduling problems have focused on static scheduling. But in fact, scheduling problems are dynamic in the real world with uncertain new arrival jobs after the execution time. This paper proposes a dynamic energy efficient flexible flow shop scheduling model using peak power value with the consideration of new arrival jobs. As the problem is strongly NP-hard, a priority based hybrid parallel Genetic Algorithm with a predictive reactive complete rescheduling approach is developed. In order to achieve a speedup to meet the short response in the dynamic environment, the proposed method is designed to be highly consistent with NVIDIA CUDA software model. Finally, numerical experiments are conducted and show that our approach can not only achieve better performance than the traditional static approach, but also gain competitive results by reducing the time requirements dramatically.

Research paper thumbnail of Keynote speech : Towards using computing accelerators like GPUs and MIC for solving real world problems into operational conditions

Research paper thumbnail of Parallel Monte-Carlo Simulations on GPU and Xeon Phi for Stratospheric Balloon Envelope Drift Descent Analysis

2016 Intl IEEE Conferences on Ubiquitous Intelligence & Computing, Advanced and Trusted Computing, Scalable Computing and Communications, Cloud and Big Data Computing, Internet of People, and Smart World Congress (UIC/ATC/ScalCom/CBDCom/IoP/SmartWorld), Jul 1, 2016

HAL is a multidisciplinary open access archive for the deposit and dissemination of scientific re... more HAL is a multidisciplinary open access archive for the deposit and dissemination of scientific research documents, whether they are published or not. The documents may come from teaching and research institutions in France or abroad, or from public or private research centers. L'archive ouverte pluridisciplinaire HAL, est destinée au dépôt et à la diffusion de documents scientifiques de niveau recherche, publiés ou non, émanant des établissements d'enseignement et de recherche français ou étrangers, des laboratoires publics ou privés.

Research paper thumbnail of Smart systems, the fourth industrial revolution and new challenges in distributed computing

Smart systems and the smart world concept are addressed in the framework of the fourth industrial... more Smart systems and the smart world concept are addressed in the framework of the fourth industrial revolution. New challenges in distributed autonomous robots and computing are considered. An illustration of a new kind of smart and reconfigurable distributed modular robot system is given. A prototype is also presented as well as the associated distributed algorithm.

Research paper thumbnail of Proceedings of the 13th IEEE International Conference on Ubiquitous Intelligence and Computing, 13th IEEE International Conference on Advanced and Trusted Computing, 16 IEEE International Conference on Scalable Computing and Communications, IEEE International Conference on Cloud and Big Data Comp...

Research paper thumbnail of Workshop 9: PDCO Parallel / Distributed Combinatorics and Optimization

2020 IEEE International Parallel and Distributed Processing Symposium Workshops (IPDPSW), 2020

The IEEE Workshop on Parallel / Distributed Combinatorics and Optimization aims at providing a fo... more The IEEE Workshop on Parallel / Distributed Combinatorics and Optimization aims at providing a forum for scientific researchers and engineers on recent advances in the field of parallel or distributed computing for difficult combinatorial optimization problems, like 0–1 multidimensional knapsack problems, cutting stock problems, scheduling problems, large scale linear programming problems, nonlinear optimization problems and global optimization problems. Emphasis is placed on new techniques for the solution of these difficult problems like cooperative methods for integer programming problems. Techniques based on metaheuristics and nature-inspired paradigms are considered. Aspects related to Combinatorial Scientific Computing (CSC) are considered. In particular, we solicit submissions of original manuscripts on sparse matrix computations, graph algorithm and original parallel or distributed algorithms. The use of new approaches in parallel and distributed computing like GPU, MIC, FPGA, volunteer computing are considered. Application to cloud computing, planning, logistics, manufacturing, finance, telecommunications and computational biology are considered.

Research paper thumbnail of Correlation of security events based on the analysis of structures of event types

2017 9th IEEE International Conference on Intelligent Data Acquisition and Advanced Computing Systems: Technology and Applications (IDAACS), 2017

HAL is a multidisciplinary open access archive for the deposit and dissemination of scientific re... more HAL is a multidisciplinary open access archive for the deposit and dissemination of scientific research documents, whether they are published or not. The documents may come from teaching and research institutions in France or abroad, or from public or private research centers. L'archive ouverte pluridisciplinaire HAL, est destinée au dépôt et à la diffusion de documents scientifiques de niveau recherche, publiés ou non, émanant des établissements d'enseignement et de recherche français ou étrangers, des laboratoires publics ou privés.

Research paper thumbnail of The Tung Nguyen

Un environnement pour le calcul intensif pair à pair

Research paper thumbnail of Heterogeneous Computing and Multi-Clustering Support Via Peer-To-Peer HPC

2018 26th Euromicro International Conference on Parallel, Distributed and Network-based Processing (PDP), 2018

This paper aims at presenting Peer-To-Peer HPC a decentralized environment that facilitates the u... more This paper aims at presenting Peer-To-Peer HPC a decentralized environment that facilitates the use of heterogeneous multi-cluster platform for loosely synchronous applications. The goal is to exploit all the computing resources (all the available cores of computing nodes) as well as all networks, e.g., Ethernet, Infiniband and Myrinet. Peer-To-Peer HPC functionality relies on a reconfigurable multi network protocol RMNP for controlling multiple network adapters and on OpenMP for the exploitation of all the available cores of computing nodes. We report on efficiency obtained with Grid5000 testbed by combining synchronous and asynchronous iterative schemes of computation with Peer-To-Peer HPC. The experimental results show that our environment scales well.

Research paper thumbnail of Proceedings of the 2015 IEEE 18th International Conference on Computational Science and Engineering

Research paper thumbnail of CHAPTER 10 GPU computing appliedto linear and mixed-integerprogramming

Tesla NVIDIA computing accelerators are currently based on Kepler and Maxwell architectures. The ... more Tesla NVIDIA computing accelerators are currently based on Kepler and Maxwell architectures. The recent versions of Compute Unified Device Architecture (CUDA), such as CUDA 7.0, coupled with the Kepler and Maxwell architectures facilitate the dynamic use of GPUs. Moreover, data transfers can now happen via high-speed network directly from any GPU memory to any other GPU memory in any other cluster without involving the assistance of the CPU. At present efforts are placed on maximizing the GPU resources and fast data exchanges between host and device. In 2016 the PASCAL architecture should feature more memory, 1 TB/s memory bandwith, and twice as many flops as Maxwell. NVLink technology will also permit data to move 5–10 times faster between GPUs and CPUs than with current PCI-Express, making GPU computing accelerators very efficient devices for HPC. Looking at the GPU computing accelerators previously released (some of which are presented in Table 1, which also summarizes the charac...

Research paper thumbnail of Acceleration of a CUDA-Based Hybrid Genetic Algorithm and its Application to a Flexible Flow Shop Scheduling Problem

2018 19th IEEE/ACIS International Conference on Software Engineering, Artificial Intelligence, Networking and Parallel/Distributed Computing (SNPD), 2018

Genetic Algorithms are commonly used to generate high-quality solutions to combinational optimiza... more Genetic Algorithms are commonly used to generate high-quality solutions to combinational optimization problems. However, the execution time can become a limiting factor for large and complex problems. In this paper, we propose a parallel Genetic Algorithm consisting of an island model at the upper level and a fine-grained model at the lower level. It is designed to be highly consistent with the CUDA framework to get the maximum speedup without compromising to solutions' quality. As several parameters control the performance of the hybrid method, we test them by a flexible flow shop scheduling problem and analyze their influence. Finally, numerical experiments show that our approach cannot only obtain competitive results but also reduces execution time by setting a medium size selection diameter, a relatively large island size and a wide range size migration interval.

Research paper thumbnail of Enabling the Social Internet of Things and Social Cloud

IEEE Cloud Computing, 2015

Social Internet of Things are changing what social patterns can be, and will bring unprecedented ... more Social Internet of Things are changing what social patterns can be, and will bring unprecedented online and offline social experiences. Social cloud is an improvement over social network in order to cooperatively provide computing facilities through social interactions. Both of these two field needs more research efforts to have a generic or unified supporting architecture, in order to integrate with various involved technologies. These two paradigms are both related to Social Networks, Cloud Computing, and Internet of Things. Therefore, we have reasons to believe that they have many potentials to support each other, and we predict that the two will be merged in one way or another.

Research paper thumbnail of D. El Baz, G. Authie, Distributed algorithms for optimal routing in a packet-switched computer network ; shortest path and non linear flow problems, First International Workshop on Methodologies and Application of Complex System Theory, Le Caire, Novembre 15-17, 1983

Research paper thumbnail of D. El Baz, Etude d’algorithmes itératifs de calcul parallèle. Application à la résolution distribuée du problème du routage optimal dans un réseau maillé à commutation de paquets. Thèse de Docteur Ingénieur de l’INSA de Toulouse, soutenue le 12 Janvier 1984 au LAAS du CNRS. Rapport LAAS 2985

Research paper thumbnail of M. Jarraya, D. El Baz, Asynchronous iterations for the solution of Markov systems, in Proceedings of the Third International Conference on the Numerical Solution of Markov Chains, NSMC’99, B. Plateau, W. Stewart, Manuel Silva, editors, Prenzas Universitaria de Zaragoza, Saragosse, Espagne, Septem...

M. Jarraya, D. El Baz, Asynchronous iterations for the solution of Markov systems, in Proceedings of the Third International Conference on the Numerical Solution of Markov Chains, NSMC’99, B. Plateau, W. Stewart, Manuel Silva, editors, Prenzas Universitaria de Zaragoza, Saragosse, Espagne, Septem...

Research paper thumbnail of M. Elkihel, D. El Baz, An efficient dynamic programming parallel algorithm for the 0-1 knapsack problem, Proceedings of the Parallel Computing Conference, ParCo 2001, Naples, Italy, 4-7 September 2001, in Advances in Parallel Computing, Elsevier Science B.V., North Holland, 2002, p. 298-305

M. Elkihel, D. El Baz, An efficient dynamic programming parallel algorithm for the 0-1 knapsack problem, Proceedings of the Parallel Computing Conference, ParCo 2001, Naples, Italy, 4-7 September 2001, in Advances in Parallel Computing, Elsevier Science B.V., North Holland, 2002, p. 298-305

Research paper thumbnail of D. El Baz, L’Internet du futur au service du calcul intensif, in Le calcul intensif : technologie clé pour le futur, Les Cahiers de l’ANR N° 3, Janvier 2010, p. 40

Research paper thumbnail of A dynamic programming method with dominance technique for the knapsack sharing problem

2009 International Conference on Computers & Industrial Engineering, 2009

In this paper, we propose an original method to solve exactly the knapsack sharing problem (KSP) ... more In this paper, we propose an original method to solve exactly the knapsack sharing problem (KSP) by using a dynamic programming with dominance technique. The original problem (KSP) is decomposed in a set of knapsack problems. Our method is tested on uncorrelated and correlated instances from the literature. Computational experiences show that our method is able to find an optimal solution of large instances within reasonable computing time.

Research paper thumbnail of D. El Baz, Calcul Intensif Pair à pair, Colloque STIC de l’ANR, Lyon, 4-6 Janvier 2012