Resource Constrained and Speculative Scheduling of an Algorithm Class with Run-Time Dependent Conditionals

Hannig F, Teich J (2004)


Publication Type: Conference contribution

Publication year: 2004

Journal

Publisher: Institute of Electrical and Electronics Engineers

Edited Volumes: Proceedings of the International Conference on Application-Specific Systems, Architectures and Processors

Pages Range: 17 - 27

Conference Proceedings Title: Proceedings of the 15th IEEE International Conference on Application-specific Systems, Architectures, and Processors (ASAP 2004)

Event location: Galveston, TX US

ISBN: 0-7695-2226-2

Abstract

In this paper we present a significant extension of the quantified equation based algorithm class of piecewise regular algorithms. The main contributions of the following paper 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.

Authors with CRIS profile

Related research project(s)

How to cite

APA:

Hannig, F., & Teich, J. (2004). Resource Constrained and Speculative Scheduling of an Algorithm Class with Run-Time Dependent Conditionals. In Proceedings of the 15th IEEE International Conference on Application-specific Systems, Architectures, and Processors (ASAP 2004) (pp. 17 - 27). Galveston, TX, US: Institute of Electrical and Electronics Engineers.

MLA:

Hannig, Frank, and Jürgen Teich. "Resource Constrained and Speculative Scheduling of an Algorithm Class with Run-Time Dependent Conditionals." Proceedings of the 15th IEEE International Conference on Application-specific Systems, Architectures, and Processors (ASAP ), Galveston, TX Institute of Electrical and Electronics Engineers, 2004. 17 - 27.

BibTeX: Download