<div dir="ltr">The following lecture might be of interest ...<br><div><br><div class="gmail_quote">---------- Forwarded message ----------<br>Subject: [ceClub] MONDAY 19/5: Bjorn Brandenburg @ CS337 - A Look at Multiprocessor Real-Time Scheduling in Linux: Generality, Feasibility, and Scalability<br>
<br><br><div link="blue" vlink="purple" lang="EN-US"><div><p class="MsoNormal"><span style="font-size:11.0pt;font-family:"Calibri","sans-serif";color:#1f497d"> </span><span style="font-family:"Arial","sans-serif";color:blue"></span><span style="font-size:13.5pt;font-family:"Courier New";color:blue">Speaker: </span><span style="font-size:13.5pt;font-family:"Cambria Math","serif";color:blue"></span><span style="font-family:"Arial","sans-serif""></span></p>
<div><div><div><div><p class="MsoNormal"><span style="font-size:13.5pt;font-family:"Cambria Math","serif";color:blue"></span><span style="font-size:13.5pt;font-family:"Courier New";color:blue">Bjorn Brandenburg</span><u></u><u></u></p>
</div><div><p class="MsoNormal"><span style="font-size:13.5pt;font-family:"Courier New";color:blue">Title: </span><span style="font-size:13.5pt;font-family:"Cambria Math","serif";color:blue"></span><u></u><u></u></p>
</div><div><p class="MsoNormal"><span style="font-size:13.5pt;font-family:"Cambria Math","serif";color:blue"></span><span style="font-size:13.5pt;font-family:"Courier New";color:blue">A Look at Multiprocessor Real-Time Scheduling in Linux: Generality, Feasibility, and Scalability</span><u></u><u></u></p>
</div><div><p class="MsoNormal"><span style="font-size:13.5pt;font-family:"Courier New";color:blue">Affil.:</span><span style="font-size:13.5pt;font-family:"Cambria Math","serif";color:blue"></span><u></u><u></u></p>
</div><div><p class="MsoNormal"><span style="font-size:13.5pt;font-family:"Cambria Math","serif";color:blue"></span><span style="font-size:13.5pt;font-family:"Courier New";color:blue"> Max Plank Institute of Software Systems<br>
</span><span style="font-size:13.5pt;font-family:"Cambria Math","serif";color:blue"></span><u></u><u></u></p></div><div><div><p class="MsoNormal"><span style="font-size:13.5pt;font-family:"Cambria Math","serif";color:blue"></span><span style="font-size:13.5pt;font-family:"Courier New";color:blue">Time: </span><span style="font-size:13.5pt;font-family:"Cambria Math","serif";color:blue"></span><span style="font-family:"Arial","sans-serif""><u></u><u></u></span></p>
</div><p class="MsoNormal" style="margin-bottom:12.0pt"><span style="font-size:13.5pt;font-family:"Cambria Math","serif";color:blue"></span><span style="font-size:13.5pt;font-family:"Courier New";color:blue">Monday 19/5/14 11:30</span><span style="font-family:"Arial","sans-serif""><br>
</span><span style="font-size:13.5pt;font-family:"Cambria Math","serif";color:blue"></span><span style="font-size:13.5pt;font-family:"Courier New";color:blue">Location: CS, Taub 337</span><span style="font-family:"Arial","sans-serif""><u></u><u></u></span></p>
</div><div><p class="MsoNormal"><span style="font-size:13.5pt;font-family:"Courier New";color:blue">Abstract:</span><span style="font-family:"Arial","sans-serif""><u></u><u></u></span></p><p>
<span style="font-family:"Arial","sans-serif"">Given the popularity of Linux and the increasing adoption of embedded multicore platforms, Linux (and Linux-like RTOSs such as LynxOS and QNX) are increasingly used to host real-time workloads on multiprocessors. This naturally exposes new limitations, both in the actual implementation and in the supporting analytical foundations, and has thus been a driving force for a number of recent advances in multiprocessor real-time scheduling. <u></u><u></u></span></p>
<p><span style="font-family:"Arial","sans-serif"">In this talk, I'm going to present two such results: first, I'm going to discuss how Linux's notion of processor affinities turned out to be strictly more general than many of the models typically studied in the real-time literature. And second, I'll discuss the (lack of) scalability of the Linux scheduler on large multicore platforms in terms of average- and worst-case overheads, and present an alternative, much more scalable design based on message passing. <u></u><u></u></span></p>
<p><span style="font-size:13.5pt;font-family:"Courier New";color:blue">Bio:</span><span style="font-family:"Arial","sans-serif""><u></u><u></u></span></p><p><span style="font-family:"Arial","sans-serif"">Bjorn Brandenburg is a tenure-track research group leader at the Max Planck Institute for Software Systems (MPI-SWS) in Kaiserslautern, Germany. He joined MPI-SWS in 2011 after obtaining his PhD from the University of North Carolina at Chapel Hill, where he worked with Jim Anderson. His research is focused on operating systems for predictable multiprocessor real-time systems and spans from the analytical foundations on the one hand to practical systems and implementation issues on the other hand, with a special focus on real-time locking and scheduling. He is the lead developer and maintainer of LITMUS RT (<a href="http://www.litmus-rt.org" target="_blank">http://www.litmus-rt.org</a>), a real-time extension of the Linux kernel that has been in development since 2006. <u></u><u></u></span></p>
<p class="MsoNormal"><span style="font-family:"Arial","sans-serif""><u></u><u></u></span></p></div><p class="MsoNormal"> <br></p></div></div></div></div></div></div>-- <br>Orr Dunkelman,<br><a href="mailto:Orr.Dunkelman@gmail.com" target="_blank">Orr.Dunkelman@gmail.com</a>
</div></div>