Lionel Morel
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
Lionel Morel has a total of 10 co-authors. Here are the top co-authors by number of shared publications:
- Batouma Narkoy
Laboratoire LIESP, INSA Lyon, F-69621, Villeurbanne, France
1 shared publication Damien Couroussé
University of Grenoble Alpes, CEA, List, France
1 shared publication- Firas Alhalabi
Laboratoire LIESP, INSA Lyon, F-69621, Villeurbanne, France
1 shared publication - Gabriel Radanne
INRIA, Lyon, France
1 shared publication - Jean-Louis Sourrouille
Laboratoire LIESP, INSA Lyon, F-69621, Villeurbanne, France
1 shared publication - Laure Gonnord
Grenoble INP - LCIS, UGA
1 shared publication
Latest Publications
- Open Access
- 2 February 2023
- Published by Association for Computing Machinery (ACM) in ACM Computing Surveys
- Vol. 55 (10) , 1-28
A Survey on Parallelism and Determinism
Parallelism is often required for performance. In these situations an excess of non-determinism is harmful as it means the program can have several different behaviours or even different results. Even in domains such as high-performance computing where parallelism is crucial for performance, the computed value should be deterministic. Unfortunately, non-determinism in programs also allows dynamic scheduling of tasks, reacting to the first task that succeeds, cancelling tasks that cannot lead to a result, and so on. Non-determinism is thus both a desired asset or an undesired property depending on the situation. In practice, it is often necessary to limit non-determinism and to identify precisely the sources of non-determinism to control what parts of a program are deterministic or not. This survey takes the perspective of programming languages, and studies how programming models can ensure the determinism of parallel programs. This survey studies not only deterministic languages but also programming models that prevent one particularly demanding source of non-determinism: data races. Our objective is to compare existing solutions to the following questions: How programming languages can help programmers write programs that run in a parallel manner without visible non-determinism? What programming paradigms ensure this kind of properties? We study these questions and discuss the merits and limitations of different approaches.
- 2 February 2023
- Published by Association for Computing Machinery (ACM) in ACM Computing Surveys
- Vol. 55 (10) , 1-28
Open AccessA Survey on Parallelism and Determinism
Parallelism is often required for performance. In these situations an excess of non-determinism is harmful as it means the program can have several different behaviours or even different results. Even in domains such as high-performance computing where parallelism is crucial for performance, the computed value should be deterministic. Unfortunately, non-determinism in programs also allows dynamic scheduling of tasks, reacting to the first task that succeeds, cancelling tasks that cannot lead to a result, and so on. Non-determinism is thus both a desired asset or an undesired property depending on the situation. In practice, it is often necessary to limit non-determinism and to identify precisely the sources of non-determinism to control what parts of a program are deterministic or not. This survey takes the perspective of programming languages, and studies how programming models can ensure the determinism of parallel programs. This survey studies not only deterministic languages but also programming models that prevent one particularly demanding source of non-determinism: data races. Our objective is to compare existing solutions to the following questions: How programming languages can help programmers write programs that run in a parallel manner without visible non-determinism? What programming paradigms ensure this kind of properties? We study these questions and discuss the merits and limitations of different approaches.
- Open Access
- 10 March 2022
- Published by Association for Computing Machinery (ACM) in Digital Threats: Research and Practice
- Vol. 4 (2) , 1-27
Code Polymorphism Meets Code Encryption: Confidentiality and Side-channel Protection of Software Components
In this article, we consider that, in practice, attack scenarios involving side-channel analysis combine two successive phases: an analysis phase, targeting the extraction of information about the target and the identification of possible vulnerabilities, and an exploitation phase, applying attack techniques on candidate vulnerabilities. We advocate that protections need to cover these two phases to be effective against real-life attacks. We present PolEn , a toolchain and a processor architecture that combine countermeasures to provide an effective mitigation of side-channel attacks: As a countermeasure against the analysis phase, our approach considers the use of code encryption; as a countermeasure against the exploitation phase, our approach considers the use of code polymorphism, because it relies on runtime code generation, and its combination with code encryption is particularly challenging. Code encryption is supported by a processor extension such that machine instructions are only decrypted inside the CPU, which effectively prevents reverse engineering or any extraction of useful information from memory dumps. Code polymorphism is implemented by software means. It regularly changes the observable behaviour of the program, making it unpredictable for an attacker, hence reducing the possibility to exploit side-channel leakages. We present a prototype implementation, based on the RISC-V Spike simulator and a modified LLVM toolchain. In our experimental evaluation, we illustrate that PolEn effectively reduces side-channel leakages. For the protected functions evaluated, static memory use increases by a factor of 5 to 22, corresponding to the joint application of code encryption and code polymorphism. The overhead, in terms of execution time, ranges between a factor of 1.8 and 4.6.
- 10 March 2022
- Published by Association for Computing Machinery (ACM) in Digital Threats: Research and Practice
- Vol. 4 (2) , 1-27
Open AccessCode Polymorphism Meets Code Encryption: Confidentiality and Side-channel Protection of Software Components
In this article, we consider that, in practice, attack scenarios involving side-channel analysis combine two successive phases: an analysis phase, targeting the extraction of information about the target and the identification of possible vulnerabilities, and an exploitation phase, applying attack techniques on candidate vulnerabilities. We advocate that protections need to cover these two phases to be effective against real-life attacks. We present PolEn , a toolchain and a processor architecture that combine countermeasures to provide an effective mitigation of side-channel attacks: As a countermeasure against the analysis phase, our approach considers the use of code encryption; as a countermeasure against the exploitation phase, our approach considers the use of code polymorphism, because it relies on runtime code generation, and its combination with code encryption is particularly challenging. Code encryption is supported by a processor extension such that machine instructions are only decrypted inside the CPU, which effectively prevents reverse engineering or any extraction of useful information from memory dumps. Code polymorphism is implemented by software means. It regularly changes the observable behaviour of the program, making it unpredictable for an attacker, hence reducing the possibility to exploit side-channel leakages. We present a prototype implementation, based on the RISC-V Spike simulator and a modified LLVM toolchain. In our experimental evaluation, we illustrate that PolEn effectively reduces side-channel leakages. For the protected functions evaluated, static memory use increases by a factor of 5 to 22, corresponding to the joint application of code encryption and code polymorphism. The overhead, in terms of execution time, ranges between a factor of 1.8 and 4.6.
- 1 April 2008
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 1-6
Centralized vs. Decentralized QoS Management policy
On current operating systems, applications provide services based on a best effort policy, i.e., resources are shared out without regard for applications' requirements. As long as there are enough resources, this resource sharing policy is satisfactory, but when resources become scarce, applications degrade their behavior without any control. This motivates the need of mechanisms to make applications adapt their behavior in a coordinated manner. This paper focuses on resource management of distributed applications. It describes centralized and decentralized policies aiming to manage the QoS by tuning the use of resources. Experiments compare these policies with each other according to QoS parameters and execution contexts.
- 1 April 2008
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 1-6
Centralized vs. Decentralized QoS Management policy
On current operating systems, applications provide services based on a best effort policy, i.e., resources are shared out without regard for applications' requirements. As long as there are enough resources, this resource sharing policy is satisfactory, but when resources become scarce, applications degrade their behavior without any control. This motivates the need of mechanisms to make applications adapt their behavior in a coordinated manner. This paper focuses on resource management of distributed applications. It describes centralized and decentralized policies aiming to manage the QoS by tuning the use of resources. Experiments compare these policies with each other according to QoS parameters and execution contexts.