Published in: LIPIcs, Volume 165, 32nd Euromicro Conference on Real-Time Systems (ECRTS 2020)
Daniel Bristot de Oliveira, Daniel Casini, Rômulo Silva de Oliveira, and Tommaso Cucinotta. Demystifying the Real-Time Linux Scheduling Latency. In 32nd Euromicro Conference on Real-Time Systems (ECRTS 2020). Leibniz International Proceedings in Informatics (LIPIcs), Volume 165, pp. 9:1-9:23, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2020)
@InProceedings{deoliveira_et_al:LIPIcs.ECRTS.2020.9, author = {de Oliveira, Daniel Bristot and Casini, Daniel and de Oliveira, R\^{o}mulo Silva and Cucinotta, Tommaso}, title = {{Demystifying the Real-Time Linux Scheduling Latency}}, booktitle = {32nd Euromicro Conference on Real-Time Systems (ECRTS 2020)}, pages = {9:1--9:23}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-152-8}, ISSN = {1868-8969}, year = {2020}, volume = {165}, editor = {V\"{o}lp, Marcus}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ECRTS.2020.9}, URN = {urn:nbn:de:0030-drops-123721}, doi = {10.4230/LIPIcs.ECRTS.2020.9}, annote = {Keywords: Real-time operating systems, Linux kernel, PREEMPT\underlineRT, Scheduling latency} }
Published in: LIPIcs, Volume 83, 42nd International Symposium on Mathematical Foundations of Computer Science (MFCS 2017)
Catarina Carvalho, Barnaby Martin, and Dmitriy Zhuk. The Complexity of Quantified Constraints Using the Algebraic Formulation. In 42nd International Symposium on Mathematical Foundations of Computer Science (MFCS 2017). Leibniz International Proceedings in Informatics (LIPIcs), Volume 83, pp. 27:1-27:14, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2017)
@InProceedings{carvalho_et_al:LIPIcs.MFCS.2017.27, author = {Carvalho, Catarina and Martin, Barnaby and Zhuk, Dmitriy}, title = {{The Complexity of Quantified Constraints Using the Algebraic Formulation}}, booktitle = {42nd International Symposium on Mathematical Foundations of Computer Science (MFCS 2017)}, pages = {27:1--27:14}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-046-0}, ISSN = {1868-8969}, year = {2017}, volume = {83}, editor = {Larsen, Kim G. and Bodlaender, Hans L. and Raskin, Jean-Francois}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.MFCS.2017.27}, URN = {urn:nbn:de:0030-drops-80793}, doi = {10.4230/LIPIcs.MFCS.2017.27}, annote = {Keywords: Quantified Constraints, Computational Complexity, Universal Algebra, Constraint Satisfaction} }
Feedback for Dagstuhl Publishing