Julien Schleich
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Julien Schleich has a total of 6 co-authors. Here are the top co-authors by number of shared publications:
- Pascal Bouvry
University of Luxembourg
2 shared publications - Arnaud Glad
Department of Computer Science, University of Luxembourg, 4365 Luxembourg, Luxembourg
1 shared publication - Franck Leprévost
University of Luxembourg
1 shared publication - Kittichai Lavangnananda
Data and Knowledge Engineering Lab, School of Information Technology (SIT) King Mongkut's University of Technology Thonburi (KMUTT), Bangkok, Thailand
1 shared publication - Le Thi Hoai An
University Paul Verlaine—Metz
1 shared publication - Panissara Thanapol
Department of Computer Science, University of Luxembourg, 4365 Luxembourg, Luxembourg
1 shared publication
Latest Publications
- Open Access
- 11 March 2024
- Published by MDPI AG in Applied Sciences
- Vol. 14 (6) , 2349
Round-Based Mechanism and Job Packing with Model-Similarity-Based Policy for Scheduling DL Training in GPU Cluster
Graphics Processing Units (GPUs) are employed for their parallel processing capabilities, which are essential to train deep learning (DL) models with large datasets within a reasonable time. However, the diverse GPU architectures exhibit variability in training performance depending on DL models. Furthermore, factors such as the number of GPUs for distributed training and batch size significantly impact training efficiency. Addressing the variability in training performance and accounting for these influential factors are critical for optimising resource usage. This paper presents a scheduling policy for DL training tasks in a heterogeneous GPU cluster. It builds upon a model-similarity-based scheduling policy by implementing a round-based mechanism and job packing. The round-based mechanism allows the scheduler to adjust its scheduling decisions periodically, whereas job packing optimises GPU utilisation by fitting additional jobs into a GPU that trains a small model. Results show that implementing a round-based mechanism reduces the makespan by approximately 29%, compared to the scenario without it. Additionally, integrating job packing further decreases the makespan by 5%.
- 11 March 2024
- Published by MDPI AG in Applied Sciences
- Vol. 14 (6) , 2349
Open AccessRound-Based Mechanism and Job Packing with Model-Similarity-Based Policy for Scheduling DL Training in GPU Cluster
Graphics Processing Units (GPUs) are employed for their parallel processing capabilities, which are essential to train deep learning (DL) models with large datasets within a reasonable time. However, the diverse GPU architectures exhibit variability in training performance depending on DL models. Furthermore, factors such as the number of GPUs for distributed training and batch size significantly impact training efficiency. Addressing the variability in training performance and accounting for these influential factors are critical for optimising resource usage. This paper presents a scheduling policy for DL training tasks in a heterogeneous GPU cluster. It builds upon a model-similarity-based scheduling policy by implementing a round-based mechanism and job packing. The round-based mechanism allows the scheduler to adjust its scheduling decisions periodically, whereas job packing optimises GPU utilisation by fitting additional jobs into a GPU that trains a small model. Results show that implementing a round-based mechanism reduces the makespan by approximately 29%, compared to the scenario without it. Additionally, integrating job packing further decreases the makespan by 5%.
- 3 May 2011
- Published by Springer Nature in Journal of Combinatorial Optimization
- Vol. 24 (4) , 397-412
Solving the minimum M-dominating set problem by a continuous optimization approach based on DC programming and DCA
- 3 May 2011
- Published by Springer Nature in Journal of Combinatorial Optimization
- Vol. 24 (4) , 397-412
Solving the minimum M-dominating set problem by a continuous optimization approach based on DC programming and DCA