2022-05467 - PhD Position F/M PhD Student in Operating Systems
Le descriptif de l’offre ci-dessous est en Anglais

Type de contrat : CDD

Niveau de diplôme exigé : Bac + 5 ou équivalent

Fonction : Doctorant

Mission confiée

Job description

Efficient lock algorithms are key to ensuring application scalability on multi-core architectures [1, 2, 3]. 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., [4]).

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.

As a PhD student at Inria, you will investigate this idea, with the objective of publishing the results of your research in top systems conferences such as SOSP, OSDI, USENIX ATC, and EuroSys.

[1] Jean-Pierre Lozi, Florian David, Gaël Thomas, Julia Lawall, Gilles Muller. Remote Core Locking: migrating critical-section execution to improve the performance of multithreaded applications. USENIX Annual Technical Conference (USENIX ATC) 2012.

[2] Tudor David, Rachid Guerraoui, Vasileios Trigonakis. Everything you always wanted to know about synchronization but were afraid to ask. Symposium on Operating Systems Principles (SOSP) 2013.

[3] Hugo Guiroux, Renaud Lachaize, Vivien Quéma. Multicore locks: the case is not closed yet. USENIX Annual Technical Conference (USENIX ATC) 2016.

[4] Yoann Ghigoff, Julien Sopena, Kahina Lazri, Antoine Blin, Gilles Muller. BMC: accelerating Memcached using safe in-kernel caching and pre-stack processing. Symposium on Networked Systems Design and Implementation (NSDI) 2021.

Principales activités

Main activities (5 maximum) :

  • Design and implement algorithms
  • Evaluate the performance of the proposed algorithms
  • Write reports and papers

Additional activities (3 maximum) :

  • Present the work as well as related work
  • Attend seminars, workshops, and/or conferences


  • Thorough understanding of computer science fundamentals including data structures, algorithms, and complexity analysis
  • Good problem-solving skills
  • Knowledge and/or experience in systems/low-level programming
  • Notions of OS design
  • Advanced C programming
  • Holder of a Master's in computer science or equivalent


  • Subsidized meals
  • Partial reimbursement of public transport costs
  • Leave: 7 weeks of annual leave + 10 extra days off due to RTT (statutory reduction in working hours) + possibility of exceptional leave (sick children, moving home, etc.)
  • Possibility of teleworking and flexible organization of working hours
  • Professional equipment available (videoconferencing, loan of computer equipment, etc.)
  • Social, cultural and sports events and activities
  • Access to vocational training