<html><head><meta http-equiv="Content-Type" content="text/html; charset=utf-8"></head><body style="word-wrap: break-word; -webkit-nbsp-mode: space; line-break: after-white-space;" class=""><br class=""><div><blockquote type="cite" class=""><div class="">On Jan 28, 2020, at 3:59 AM, Björn Brandenburg <<a href="mailto:bbb@mpi-sws.org" class="">bbb@mpi-sws.org</a>> wrote:</div><br class="Apple-interchange-newline"><div class=""><div class="">Dear Laurent,<br class=""><br class="">On 22. Jan 2020, at 21:04, Laurent Pautet <<a href="mailto:laurent.pautet@telecom-paristech.fr" class="">laurent.pautet@telecom-paristech.fr</a>> wrote:<br class=""><blockquote type="cite" class=""><br class="">i am investigating existing solutions to define a table driven scheduling with litmus. I found the table-driven scheduling tutorial.<br class="">It seems that it is a time partitioning scheduling but also a partitioned scheduling (tasks attached to a given core). Since it was designed in 2016, i would like to know if this has been extended to support global scheduling.<br class=""></blockquote><br class="">no, such a feature has not been implemented to date. <br class=""><br class=""><blockquote type="cite" class="">If not, how difficult would it be to extend the current table driven scheduling.<br class=""></blockquote><br class="">Conceptually not any more difficult than non-table-driven global schedulers, but it would require a bit of engineering work. <br class=""><br class="">Best,<br class="">Björn<br class=""></div></div></blockquote></div><br class=""><div class="">Herman et al. Implemented _partitioned_ table-driven scheduling in Litmus 2011.1, for their paper "RTOS Support for Mixed-Criticality Systems” (<a href="http://www.cs.unc.edu/~anderson/papers/rtas12b.pdf" class="">http://www.cs.unc.edu/~anderson/papers/rtas12b.pdf</a>). You can find it as a part of this patch: <a href="http://www.cs.unc.edu/~anderson/litmus-rt/download/RTAS12/wip-mc.patch" class="">http://www.cs.unc.edu/~anderson/litmus-rt/download/RTAS12/wip-mc.patch</a> (look for code related to “cyclic executive” or “ce”).</div><div class=""><br class=""></div><div class="">The patch is for an old version of Litmus, and is for partitioned scheduling, but it may give you some ideas on how to approach a global table-driven scheduler (e.g., how to express the table to the scheduler—under Herman’s patch, you write a CSV file, representing the schedule table, to a file in /proc).</div><div class=""><br class=""></div><div class="">-Glenn</div></body></html>