Description
Date depot: 16 octobre 2023
Titre: Cooperative Task Synchronization and Scheduling
Directrice de thèse:
Julia LAWALL (Inria-Paris (ED-130))
Encadrant :
Jean-Pierre LOZI (Inria-Paris (ED-130))
Domaine scientifique: Sciences et technologies de l'information et de la communication
Thématique CNRS : Systèmes et réseaux
Resumé: Efficient lock algorithms are key to ensuring application scalability on
multi-core architectures. While many lock algorithms have been proposed in
the past decades to improve lock handover times under high contention as
well as cache and NUMA locality, even the best lock algorithms can perform
poorly due to unfortunate decisions from the OS scheduler.
The Berkeley Packet Filter (BPF) makes it possible to inject verified code
inside the Linux kernel. While BPF was historically used for packet
filtering, it is now commonly used for profiling, and it has recently been
used in more exotic use cases (e.g., in-kernel caching for memcached).
We would like to use BPF to design a new family of lock algorithms that
communicate and cooperate with the OS scheduler to overcome the
limitations of the current state of the art. In the long term, the
approach can be extended to other synchronization primitives, such as
barriers.
Doctorant.e: Laforet Victor