Friedrich-Alexander-Universität DruckenUnivisEnglish FAU-Logo
Techn. Fakultät Willkommen am Department Informatik FAU-Logo
Codesign
Lehrstuhl für Informatik 12
HT04c
Department Informatik  >  Informatik 12  >  Veröffentlichungen  >  Frank Hannig  >  HT04c

Resource Constrained and Speculative Scheduling
of Dynamic Piecewise Regular Algorithms

Frank Hannig and Jürgen Teich
{hannig, teich}@cs.fau.de
URL: http://www12.informatik.uni-erlangen.de

Department of Computer Science 12
Hardware-Software-Co-Design
University of Erlangen-Nuremberg
Am Weichselgarten 3
D-91058 Erlangen, Germany

Co-Design-Report 01-2004

June 18, 2004

Abstract
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.

Full article in PDF (375 KB)
BibTex entry

© is held by the authors.

  Impressum Stand: 13 September 2004.   F.H.