Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

Jérôme Lelong

dblp:47/7434 · DBLP profile ↗
← Back
4ranked-venue papers
1as first author
0since 2021 · last 2018
0000-0002-3377-3726ORCID · corroborated

Domains — the database's venue-derived domains; a paper can count in several

Systems, architecture and hardware · 3

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Computer architecture, parallel and distributed computing, and storage systems
1 paper
Cloud and datacenter computing · 91% Performance modeling and evaluation · 9%

Topics — the 3 heaviest of 4, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Cloud and datacenter computing › job scheduling › batch scheduling
backfilling
0.312018
Online Tuning of EASY-Backfilling using Queue Reordering Policies · IEEE Trans. Parallel Distributed Syst. 2018
Cloud and datacenter computing
job scheduling
0.312018
Online Tuning of EASY-Backfilling using Queue Reordering Policies · IEEE Trans. Parallel Distributed Syst. 2018
Cloud and datacenter computing › configuration tuning
online tuning
0.312018
Online Tuning of EASY-Backfilling using Queue Reordering Policies · IEEE Trans. Parallel Distributed Syst. 2018

Methods — techniques the papers use, named apart from their topics

simulation · 0.3multi-armed bandit · 0.3
YearPublicationVenuePosition
2018 Online Tuning of EASY-Backfilling using Queue Reordering Policies
abstract
The EASY-FCFS heuristic is the basic building block of job scheduling policies in most parallel High Performance Computing platforms. Despite its simplicity, and the guarantee of no job starvation, it could still be improved on a per-system basis. Such tuning is difficult because of non-linearities in the scheduling process. The study conducted in this paper considers an online approach to the automatic tuning of the EASY heuristic for HPC platforms. More precisely, we consider the problem of selecting a reordering policy for the job queue under several feedback modes. We show via a comprehensive experimental validation on actual logs that periodic simulation of historical data can be used to recover existing in-hindsight results that allow to divide the average waiting time by almost 2. This results holds even when the simulator results are noisy. Moreover, we show that good performances can still be obtained without a simulator, under what is called bandit feedback - when we can only observe the performance of the algorithm that was picked on the live system. Indeed, a simple multi-armed bandit algorithm can reduce the average waiting time by 40 percent.
Éric Gaussier, Jérôme Lelong, Valentin Reis, Denis Trystram
IEEE Trans. Parallel Distributed Syst.2
2017 Tuning EASY-Backfilling Queues
Jérôme Lelong, Valentin Reis, Denis Trystram
JSSPP1
2014 Using Premia and Nsp for constructing a risk management benchmark for testing parallel architecture
abstract
SUMMARY Financial institutions have massive computations to carry out overnight, which are very CPU demanding. The challenge is to price many different products on a cluster‐like architecture. We have used the Premia software to valuate the financial derivatives. In this work, we explain how Premia can be embedded into Nsp, a scientific software like MATLAB, to provide a powerful tool to valuate a whole portfolio. Finally, we have integrated an Message Passing Interface (MPI) toolbox into Nsp to enable the use of Premia to solve a bunch of pricing problems on a cluster. This unified framework can then be used to test different parallel architectures. Copyright © 2012 John Wiley & Sons, Ltd.
Jean-Philippe Chancelier, Bernard Lapeyre, Jérôme Lelong
Concurr. Comput. Pract. Exp.3
2009 Using Premia and Nsp for constructing a risk management benchmark for testing parallel architecture
abstract
Financial institutions have massive computations to carry out overnight which are very demanding in terms of the consumed CPU. The challenge is to price many different products on a cluster-like architecture. We have used the Premia software to valuate the financial derivatives. In this work, we explain how Premia can be embedded into Nsp, a scientific software like Matlab, to provide a powerful tool to valuate a whole portfolio. Finally, we have integrated an MPI toolbox into Nsp to enable to use Premia to solve a bunch of pricing problems on a cluster. This unified framework can then be used to test different parallel architectures.
Jean-Philippe Chancelier, Bernard Lapeyre, Jérôme Lelong
IPDPS3