Safe Shared Stack Bounds in Systems with Offsets and Precedences

Markus Bohlin, Kaj Hänninen, Jukka Mäki-Turja, Jan Carlson, Mikael Nolin · 2008

The paper presents two novel methods to bound the stack memory used in preemptive, shared stack, real-time systems. The first method is based on branch-and-bound search for possible preemption patt ...

Read the paper · More papers on PaperTik