Resource Constrained and Speculative Scheduling of Dynamic Piecewise Regular Algorithms
Frank Hannig · 2004
In this report we present a significant extension of the quantified equation based algorithm class of piecewise regular algorithms. The main contributions of the following report are: (1) the class of piecewise regular algorithms is extended by allowing run-time dependent conditionals, (2) a mixed integer linear program is given to derive optimal schedules of the novel class we call dynamic piecewise regular algorithms, and (3) in order to achieve highest performance, we present a speculative scheduling approach. The results are applied to an illustrative example.