Felipe Cerqueira

I am a sixth year PhD student at the Max Planck Institute for Software Systems (MPI-SWS), enrolled at TU Kaiserslautern. I work at the Real-Time Systems group, advised by Björn Brandenburg.

Prior to joining MPI-SWS, I did my undergraduate studies in the Federal University of Bahia (Brazil), where I worked with George Lima.

Research Interests

Currently, I'm investigating how to use proof assistants to derive guaranteed-correct schedulability analysis, in order to increase the confidence levels of future real-time systems. I have also worked on other theoretical and practical aspects of real-time scheduling. These include implementing scalable schedulers for multicore platforms and devising schedulability analysis for more realistic task models, such as arbitrary processor affinities (APA).

Conference and Workshop Papers

• F. Cerqueira, G. Nelissen, and B. Brandenburg, “On Strong and Weak Sustainability, with an Application to Self-Suspending Real-Time Tasks”, Proceedings of the 30th Euromicro Conference on Real-Time Systems (ECRTS 2018), to appear, July 2018.
• F. Cerqueira, F. Stutz, and B. Brandenburg, “Prosa: A Case for Readable Mechanized Schedulability Analysis”, Proceedings of the 28th Euromicro Conference on Real-Time Systems (ECRTS 2016), pp. 273–284, July 2016. Best paper award.
  [PDF | project | artifact evaluation | slides]
• F. Cerqueira, A. Gujarati, and B. Brandenburg, “Linux’s Processor Affinity API, Refined: Shifting Real-Time Tasks towards Higher Schedulability”, Proceedings of the 35th IEEE Real-Time Systems Symposium (RTSS 2014), pp. 249-259, December 2014.
  [PDF | slides]
• A. Gujarati, F. Cerqueira, and B. Brandenburg, “Multiprocessor Real-Time Scheduling with Arbitrary Processor Affinities: From Practice to Theory”, Real-Time Systems, in press, available online. Springer Verlag, July 2014.
  [PDF | SpringerLink]
• F. Cerqueira, M. Vanga, and B. Brandenburg, “Scaling Global Scheduling with Message Passing”, Proceedings of the 20th IEEE Real-Time and Embedded Technology and Applications Symposium (RTAS 2014), pp. 263-274, April 2014.
  The extended version contains all overhead measurements and the complete set of schedulability results.
  [PDF | PDF (extended version) | slides]
• M. Vanga, F. Cerqueira, B. Brandenburg, A. Lyons, and G. Heiser, “FlaRe: Efficient Capability Semantics for Timely Processor Access”, manuscript, October 2013.
  [PDF]
• A. Gujarati, F. Cerqueira, and B. Brandenburg, “Schedulability Analysis of the Linux Push and Pull Scheduler with Arbitrary Processor Affinities”, Proceedings of the 25th Euromicro Conference on Real-Time Systems (ECRTS 2013), pp. 69-79, July 2013. Outstanding Paper Award.
  Erratum: the paper has been revised to account for issues in Lemmas 2 and 4 in Section IV of the original ECRTS 2013 paper. A detailed erratum is provided in Appendix A of the revised paper.
  [PDF (revision 1) | slides]
• F. Cerqueira and B. Brandenburg, “A Comparison of Scheduling Latency in Linux, PREEMPT-RT, and LITMUS^RT”, Proceedings of the 9th Annual Workshop on Operating Systems Platforms for Embedded Real-Time applications (OSPERT 2013), pp. 19-29, July 2013. Invited paper.
  The slides include additional graphs comparing Linux 3.8.13 with and without the "threadirqs" option enabled.
  [PDF | slides | proceedings]